Graphics enhanced version of this site

Planning repair sequences using the AND/OR graph representation of assembly plans
L.S.H. de Mello and A.C. Sanderson
Proceedings of the 1988 IEEE International Conference on Robotics and Automation (ICRA '88), Vol. 3, April, 1988, pp. 1861 - 1862.

Jump to: Download | Abstract | Notes | Text Reference | BibTeX Reference

Adobe portable document format (pdf) [188 KB]

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

A simple modification is shown in the set of goal nodes of the AND/OR graph that allows its use in planning repairs such as the replacement of a part or a subassembly. An algorithm for the generation of all feasible sequences for disassembly and reassembly of parts that will achieve a repair is shown. This approach has been demonstrated for the example of the repair of space-based satellite equipment

Number of pages: 2

L.S.H. de Mello and A.C. Sanderson, "Planning repair sequences using the AND/OR graph representation of assembly plans," Proceedings of the 1988 IEEE International Conference on Robotics and Automation (ICRA '88), Vol. 3, April, 1988, pp. 1861 - 1862.

@inproceedings{Mello_1988_4511,
   author = "L.S.H. de Mello and Arthur C Sanderson",
   title = "Planning repair sequences using the AND/OR graph representation of assembly plans",
   booktitle = "Proceedings of the 1988 IEEE International Conference on Robotics and Automation (ICRA '88)",
   month = "April",
   year = "1988",
   volume = "3",
   pages = "1861 - 1862"
}