Abstract
Cellular automata are used to represent physical objects and their interactions for the purpose of planning the assembly process of several parts. Cells assume a vector value, made up of a material/void indicator, a set of cell boundary edge states, and an indicator of the allowable motion direction of the cell. Sets of rules that recognize parts and deduce allowable motions are described. An algorithm to generate allowable disassembly sequences is developed. An implementation is used to study the performance of the rules and algorithm. An example sequence generations is presented.
| Original language | English |
|---|---|
| Pages | 56-65 |
| Number of pages | 10 |
| State | Published - 1995 |
| Event | Proceedings of the IEEE International Symposium on Assembly and Task Planning - Pittsburgh, PA, USA Duration: Aug 10 1995 → Aug 11 1995 |
Conference
| Conference | Proceedings of the IEEE International Symposium on Assembly and Task Planning |
|---|---|
| City | Pittsburgh, PA, USA |
| Period | 08/10/95 → 08/11/95 |
Fingerprint
Dive into the research topics of 'Cellular automata representation for assembly simulation and sequence generation'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver