DocumentCode :
3320306
Title :
A predicate-transition net model for single agent planning
Author :
Murata, Tadao ; Nelson, Peter C. ; Yim, Jaegeol
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Illinois Univ., Chicago, IL, USA
fYear :
1990
fDate :
26-27 Mar 1990
Firstpage :
98
Lastpage :
107
Abstract :
A predicate-transition net is proposed for modeling planning problems so that the size of the model is manageably small. As an analysis tool, a bidirectional means-ends search is proposed. This method is efficient and general purpose. The net model is graphical and easier to understand than other representations
Keywords :
digital simulation; graph theory; search problems; bidirectional means-ends; planning problems; predicate-transition net model; single agent planning; Artificial intelligence; Intelligent robots; Logic design; Petri nets; Planing; Robot control; Search methods;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
AI, Simulation and Planning in High Autonomy Systems, 1990., Proceedings.
Conference_Location :
Tucson, AZ
Print_ISBN :
0-8186-2043-9
Type :
conf
DOI :
10.1109/AIHAS.1990.93925
Filename :
93925
Link To Document :
بازگشت