Referenced Items are not available for this document.
The approach is based on a graph search algorithm. A relational data structure is used to represent a truss structure. There are four types of entities: units, faces, edges, and vertices. There are contain/contained relationships for every pair of entity types, as well as in-contact relationships between faces. A best-first algorithm constitutes the core of the planner. The cost function in the current implementation corresponds to a combination of the rigidity of the intermediate structures and the total distance to be traversed by the agent executing the assembly tasks
Published in:
Systems Engineering, 1990., IEEE International Conference on
Date of Conference: 9-11 Aug. 1990
- Page(s):
- 404 - 407
- Print ISBN:
- 0-7803-0173-0
- INSPEC Accession Number:
- 3927874
- Conference Location :
- Pittsburgh, PA, USA
- Digital Object Identifier :
- 10.1109/ICSYSE.1990.203182
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
