Optimal Symbolic Planning with Action Costs and Preferences

This paper studies the solving of finite-domain action planning problems with discrete action costs and soft constraints. For sequential optimal planning, a symbolic perimeter database heuristic is addressed in a bucket implementation of A*. For computing net-benefits, we propose symbolic branch-and-bound search together with some search refinements. The net-benefit we optimize is the total benefit of satisfying the goals, minus the total action cost to achieve them. This results in an objective function to be minimized that is a linear expression over the violation of the preferences added to the action cost total.

[1]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2]  Robert B. Dial,et al.  Algorithm 360: shortest-path forest with topological ordering [H] , 1969, CACM.

[3]  Darwin Klingman,et al.  Shortest path forest with topological ordering: An algorithm description in SDL , 1980 .

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

[5]  Kurt Mehlhorn,et al.  Faster algorithms for the shortest path problem , 1990, JACM.

[6]  Peter C. Nelson,et al.  Perimeter Search , 1994, Artif. Intell..

[7]  Bart Selman,et al.  Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.

[8]  Fausto Giunchiglia,et al.  Planning via Model Checking: A Decision Procedure for AR , 1997, ECP.

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

[10]  Malte Helmert,et al.  Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length , 1999, ECP.

[11]  Stefan Edelkamp,et al.  Symbolic Pattern Databases in Heuristic Search Planning , 2002, AIPS.

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

[13]  Subbarao Kambhampati,et al.  Effective Approaches for Partial Satisfaction (Over-Subscription) Planning , 2004, AAAI.

[14]  David E. Smith.  Choosing Objectives in Over-Subscription Planning , 2004, ICAPS.

[15]  David E. Smith.  Choosing Objectives in OverSubscription Planning , 2004 .

[16]  Tevfik Bultan,et al.  Efficient BDDs for bounded arithmetic constraints , 2006, International Journal on Software Tools for Technology Transfer.

[17]  Stefan Edelkamp.  Cost-Optimal Symbolic Planning with State Trajectory and Preference Constraints , 2006, ECAI.

[18]  Eric A. Hansen,et al.  Breadth-first heuristic search , 2004, Artif. Intell..

[19]  Simon Richards,et al.  Memory-Efficient Symbolic Heuristic Search , 2006, ICAPS.

[20]  Jonathan Schaeffer,et al.  Partial Pattern Databases , 2007, SARA.

[21]  Manuela M. Veloso,et al.  State-set branching: Leveraging BDDs for heuristic search , 2008, Artif. Intell..

[22]  Malte Helmert,et al.  Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition , 2008, Lecture Notes in Computer Science.

[23]  Robert C. Holte,et al.  The Compression Power of Symbolic Pattern Databases , 2008, ICAPS.

[24]  Patrik Haslum,et al.  Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners , 2009, Artif. Intell..