DocumentCode
2101759
Title
Planning repair sequences using the AND/OR graph representation of assembly plans
Author
De Mello, L. S Homem ; Sanderson, A.C.
Author_Institution
Dept. of Electr. & Comput. Eng., Carnegie-Mellon Univ., Pittsburgh, PA, USA
fYear
1988
fDate
24-29 Apr 1988
Firstpage
1861
Abstract
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
Keywords
assembling; graph theory; production control; scheduling; AND/OR graph; assembly; production control; repair sequence planning; scheduling; space-based satellite equipment; Application software; Assembly systems; Delay; Home computing; Intelligent robots; Orbital robotics; Power generation; Robotic assembly; Satellites; Workstations;
fLanguage
English
Publisher
ieee
Conference_Titel
Robotics and Automation, 1988. Proceedings., 1988 IEEE International Conference on
Conference_Location
Philadelphia, PA
Print_ISBN
0-8186-0852-8
Type
conf
DOI
10.1109/ROBOT.1988.12341
Filename
12341
Link To Document