Guided Symbolic Universal Planning

Symbolic universal planning based on the reduced Ordered Binary Decision Diagram (OBDD) has been shown to be an efficient approach for planning in non-deterministic domains. To date, however, no guided algorithms exist for synthesizing universal plans. In this paper, we introduce a general approach for guiding universal planning based on an existing method for heuristic symbolic search in deterministic domains. We present three new sound and complete algorithms for best-first strong, strong cyclic, and weak universal planning. Our experimental results show that guiding the search dramatically can reduce both the computation time and the size of the generated plans.

[1]  Manuela M. Veloso,et al.  SetA*: an efficient BDD-based heuristic search algorithm , 2002, AAAI/IAAI.

[2]  Chih-Chieh Han,et al.  SpotLight: Best-First Search of FSM State Space , 1996 .

[3]  Kenneth L. McMillan,et al.  Symbolic model checking , 1992 .

[4]  Kim G. Larsen,et al.  Guided Synthesis of Control Programs Using UPPAAL , 2000, Nord. J. Comput..

[5]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[6]  Zhengzhu Feng,et al.  Symbolic Heuristic Search Using Decision Diagrams , 2002, SARA.

[7]  Ansgar Fehnker,et al.  Scheduling a steel plant with timed automata , 1999, Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306).

[8]  Paolo Traverso,et al.  Strong Cyclic Planning Revisited , 1999, ECP.

[9]  Matthew L. Ginsberg,et al.  Universal Planning: An (Almost) Universally Bad Idea , 1989, AI Mag..

[10]  Jai Srinivasan,et al.  Branching time temporal logic , 1988, REX Workshop.

[11]  Zhengzhu Feng,et al.  Symbolic LAO* Search for Factored Markov Decision Processes , 2002, AAAI 2002.

[12]  Frank Reffel,et al.  OBDDs in Heuristic Search , 1998, KI.

[13]  Grzegorz Rozenberg,et al.  Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency , 1988, Lecture Notes in Computer Science.

[14]  Jian Shen,et al.  On Combining Formal and Informal Verification , 1997, CAV.

[15]  Stephan Merz,et al.  Model Checking , 2000 .

[16]  Jørn Lind-Nielsen,et al.  BuDDy : A binary decision diagram package. , 1999 .

[17]  E BryantRandal.  Graph-Based Algorithms for Boolean Function Manipulation , 1986 .

[18]  Marcel Schoppers,et al.  Universal Plans for Reactive Robots in Unpredictable Environments , 1987, IJCAI.