A representation for discrete assembly sequences in task planning

Author

Ayoub, Rana G. ; Doty, Keith L.

Author_Institution

Machine Intelligence Lab., Florida Univ., Gainesville, FL, USA

fYear

1989

fDate

20-22 Sep 1989

Firstpage

746

Lastpage

753

Abstract

An extended description of a representation for discrete assembly sequences, the discrete task planning tree (DTP tree), is presented. A study of the maximum number of valid discrete assembly sequences generated, K, is made, and the effects of assembly rules and assembly constraints on K are studied. The DTP tree is generated offline, but it is stored for online use in assembly error recovery or for opportunistic assembly. A prototype of the task sequence generator using the DTP tree was implemented in Lisp on a PC

Keywords

data structures; knowledge representation; trees (mathematics); Lisp; PC; artificial intelligence; assembly error recovery; assembly rules; discrete assembly sequences; discrete task planning tree; task planning; task sequence generator; Assembly; Computer aided manufacturing; Computer integrated manufacturing; Desktop publishing; Displays; Laboratories; Machine intelligence; Process planning; Prototypes; Robot programming;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Software and Applications Conference, 1989. COMPSAC 89., Proceedings of the 13th Annual International

Conference_Location

Orlando, FL

Print_ISBN

0-8186-1964-3

Type

conf

DOI

10.1109/CMPSAC.1989.65175

Filename

65175

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2175997