DocumentCode :
3663765
Title :
On translation of conformant action planning to linear programming
Author :
Adam Galuszka;Witold Ilewicz;Adrian Olczyk
Author_Institution :
Institute of Automatic Control, Silesian University of Technology, Akademicka 16, 44-100, Gliwice, Poland
fYear :
2015
Firstpage :
353
Lastpage :
357
Abstract :
Planning in Artificial Intelligence is a problem of finding a sequence of actions that transform given initial state of the problem to desired goal situation. In this work we consider computational difficulty of so called conformant planning. Conformant planning is a problem of searching for non-conditional plans that do not depend on sensory information, but still succeed no matter which of the possible initial states the world is actually in. Finding a plan of such problems is computationally difficult. To avoid this difficulty a transformation to Linear Programming Problem, illustrated by an example, is proposed.
Keywords :
"Planning","Artificial intelligence","Linear programming","Complexity theory","Welding","Strips","Sensors"
Publisher :
ieee
Conference_Titel :
Methods and Models in Automation and Robotics (MMAR), 2015 20th International Conference on
Type :
conf
DOI :
10.1109/MMAR.2015.7283901
Filename :
7283901
Link To Document :
بازگشت