A tutorial on planning graph - Based reachability heuristics

AI Magazine

Volumn 28, Issue 1, 2007, Pages 47-83

  Bryce, Daniel ^a   Kambhampati, Subbarao ^a  

^a Arizona State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE SYSTEMS; DATA STRUCTURES; GRAPH THEORY; INFORMATION RETRIEVAL; PLANNING; UBIQUITOUS COMPUTING;

PLANNING GRAPH; REACHABILITY HEURISTICS;

HEURISTIC PROGRAMMING;

EID: 34247383920     PISSN: 07384602     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (60)

1. Backstrom, C., and Nebel, B. 1995. Complexity Results for SAS+ Planning. Computational Intelligence 11(4): 625-655.
2. Benton, J.; Do, M. B., and Kambhampati, S. 2005. Over-Subscription Planning with Numeric Goals. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, 1207-1213. Denver, CO: Professional Book Center.
3. Blum, A., and Furst, M. L. 1995. Fast Planning through Planning Graph Analysis. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1636-1642. San Francisco: Morgan Kaufmann Publishers.
4. Boddy, M.; Gohde, J.; Haigh, T.; and Harp, S. 2005. Course of Action Generation for Cyber Security Using Classical Planning. In Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS), 12-21. Menlo Park, CA: AAAI Press.
5. Bonet, B., and Geffner, H. 1999. Planning as Heuristic Search: New Results. In Proceedings of the 5th European Conference on Planning, 360-372. Berlin: Springer-Verlag.
6. Bonet, B., and Geffner, H. 2000a. Planning as Heuristic Search. Artificial Intelligence 129(1-2): 5-33.
7. Bonet, B., and Geffner, H. 2000b. Planning with Incomplete Information as Heuristic Search in Belief Space. In Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems, 52-61. Menlo Park, CA: AAAI Press.
8. Brafman, R., and Hoffmann, J. 2005. Contingent Planning Via Heuristic Forward Search with Implicit Belief States. In Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling, 71-80. Menlo Park, CA: AAAI Press.
9. Bryce, D., and Kambhampati, S. 2004. Heuristic Guidance Measures for Conformant Planning. In Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling, 365-375. Menlo Park, CA: AAAI Press.
10. Bryce, D., and Kambhampati, S. 2005. Cost Sensitive Reachability Heuristics for Handling State Uncertainty. In Proceedings of Twenty-First Conference on Uncertainty in Artificial Intelligence, 60-68. Eugene, OR: Association of Uncertainty in Artificial Intelligence.
11. Bryce, D., and Smith, D. 2006. Using Interaction to Compute Better Probability Estimates in Plan Graphs. Paper Presented at the Sixteenth International Conference on Automated Planning and Scheduling Workshop on Planning Under Uncertainty and Execution Control for Autonomous Systems, 6-10 June, The English Lake District, Cumbria, UK.
12. Bryce, D.; Kambhampati, S.; and Smith, D. 2006a. Planning Graph Heuristics for Belief Space Search. Journal of Artificial Intelligence Research 26: 35-99.
13. Bryce, D.; Kambhampati, S.; and Smith, D. 2006b. Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics. In Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 233-242. Menlo Park, CA: AAAI Press.
14. Cayrol, M.; Regnier, P.; and Vidal, V. 2000. New Results about LCGP, A Least Committed Graphplan. In Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems, 273-282. Menlo Park, CA: AAAI Press.
15. Cushing, W., and Bryce, D. 2005. State Agnostic Planning Graphs and the Application to Belief-Space Planning. In Proceedings of the Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference, 1131-1138. Menlo Park, CA: AAAI Press.
16. Do, M., and Kambhampati, S. 2003. Sapa: A Scalable Multi-Objective Metric Temporal Planner. Journal of Artificial Intelligence Research 20: 155-194.
17. Do, M., and Kambhampati, S. 2004. Partial Satisfaction (Over-Subscription) Planning as Heuristic Search. Paper presented at the Fifth International Conference on Knowledge Based Computer Systems, Hyderabad, India, 19-22 December.
18. Do, M. B.; Benton, J.; and Kambhampati, S. 2006. Planning with Goal Utility Dependencies. Paper Presented at the Sixteenth International Conference on Automated Planning and Scheduling Workshop on Preferences and Soft Constraints, The English Lake District, Cumbria, United Kingdom, 6-10 June.
19. Domshalk, C., and Hoffmann, J. 2006. Fast Probabilistic Planning through Weighted Model Counting. In Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 243-251. Menlo Park, CA: AAAI Press.
20. Doucet, A.; de Freitas, N.; and Gordon, N. 2001. Sequential Monte Carlo Methods in Practice. New York: Springer.
21. Fikes, R., and Nilsson, N. 1971. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving. In Proceedings of Second International Joint Conference on Artificial Intelligence, 608-620. Los Altos, CA: William Kaufmann, Inc.
22. Garrido, A.; Onaindia, E.; and Barber, F. 2001. A Temporal Planning System for Time-Optimal Planning. In Proceedings of the Tenth Portuguese Conference on Artificial Intelligence, 379-392. Berlin: Springer.
23. Gerevini, A.; Bonet, B.; and Givan, R. 2006. The Fifth International Planning Competition. The English Lakes District, Cumbria, United Kingdom.
24. Gerevini, A.; Saetti, A.; and Serina, I. 2003. Planning through Stochastic Local Search and Temporal Action Graphs in LPG. Journal of Artificial Intelligence Research 20: 239-290.
25. Gerevini, A.; Saetti, A.; and Serina, I. 2005. Integrating Planning and Temporal Reasoning for Domains with Durations and Time Windows. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, 1226-1231. Denver, CO: Professional Book Center.
26. Ghallab, M., and Laruelle, H. 1994. Representation and Control in IXTET, A Temporal Planner. In Proceedings of the Second International Conference on Artificial Intelligence Planning Systems, 61-67. Menlo Park, CA: AAAI Press.
27. Ghallab, M.; Nau, D.; and Traverso, P. 2004. Automated Planning: Theory and Practice. San Francisco: Morgan Kaufmann.
28. Haslum, P., and Geffner, H. 2000. Admissible Heuristics for Optimal Planning. In Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems, 140-149. Menlo Park, CA: AAAI Press.
29. Helmert, M. 2004. A Planning Heuristic Based on Causal Graph Analysis. In Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling, 161-170. Menlo Park, CA: AAAI Press.
30. Hoffmann, J., and Brafman, R. 2004. Conformant Planning Via Heuristic Forward Search: A New Approach. In Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling, 355-364. Menlo Park, CA: AAAI Press.
31. Hoffmann, J., and Geffner, H. 2003. Branching Matters: Alternative Branching in Graphplan. In Proceedings of the Thirteenth International Conference on Automated Planning and Scheduling, 22-31. Menlo Park, CA: AAAI Press.
32. Hoffmann, J., and Nebel, B. 2001. The FF Planning System: Fast Plan Generation through Heuristic Search. Journal of Artificial Intelligence Research 14: 253-302.
33. Hoffmann, J. 2003. The Metric-FF Planning System: Translating "Ignoring Delete Lists" to Numeric State Variables. Journal of Artificial Intelligence Research 20: 291-341.
34. Kambhampati, S., and Sanchez, R. 2000. Distance Based Goal Ordering Heuristics for Graphplan. In Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems, 315-322. Menlo Park, CA: AAAI Press.
35. Kambhampati, S.; Lambrecht, E.; and Parker, E. 1997. Understanding and Extending Graphplan. In Proceedings of Fourth European Conference on Planning, 260-272. Berlin: Springer-Verlag.
36. Koehler, J.; Nebel, B.; Hoffmann, J.; and Dimopoulos, Y. 1997. Extending Planning Graphs to an ADL Subset. In Proceedings of Fourth European Conference on Planning, 273-Z85. Berlin: Springer-Verlag.
37. Little, I.; Aberdeen, D.; and Thiebaux, S. 2005. Prottle: A Probabilistic Temporal Planner. In Proceedings of the Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference, 1181-1186. Menlo Park, CA: AAAI Press.
38. Long, D., and Fox, M. 1999. Efficient Implementation of the Plan Graph in Stan. Journal of Artificial Intelligence Research 10: 87-115.
39. Long, D., and Fox, M. 2003. Exploiting a Graphplan Framework in Temporal Planning. In Proceedings of the Thirteenth International Conference on Automated Planning and Scheduling, 52-61. Menlo Park, CA: AAAI Press.
40. McDermott, D. V. 1996. A Heuristic Estimator for Means-Ends Analysis in Planning. In Proceedings of the Third International Conference on Artificial Intelligence Planning Systems, 142-149. Menlo Park, CA: AAAI Press.
41. McDermott, D. 1998. PDDL - The Planning Domain Definition Language. Technical Report CVC TR-98-003 / DCS TR-1165, Yale Center for Computational Vision and Control, New Haven, CT.
42. McDermott, D. 1999. Using Regression-Match Graphs to Control Search in Planning. Artificial Intelligence 109(1-2): 111-159.
43. Nebel, B. 2000. On the Compilability and Expressive Power of Propositional Planning Formalisms. Journal of Artificial Intelligence Research 12: 271-315.
44. Nguyen, X., and Kambhampati, S. 2000. Extracting Effective and Admissible State Space Heuristics from the Planning Graph. In Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence, 798-805. Menlo Park, CA: AAAI Press.
45. Nguyen, X., and Kambhampati, S. 2001. Reviving Partial Order Planning. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 459-466. San Francisco: Morgan Kaufmann Publishers.
46. Nguyen, X.; Kambhampati, S.; and Nigenda, R. 2002. Planning Graph as the Basis for Deriving Heuristics for Plan Synthesis by State Space and CSP Search. Artificial Intelligence 135(1-2): 73-123.
47. Pednault, E. P. D. 1994. ADL and the State-Transition Model of Action. Journal of Logic and Computation 4(5): 467-512.
48. Refanidis, I., and Vlahavas, I. 2001. The GRT Planning System: Backward Heuristic Construction in Forward State-Space Planning. Journal of Artificial Intelligence Research 15: 115-161.
49. Rintanen, J. 2004. Distance Estimates for Planning in the Discrete Belief Space. In Proceedings of the Nineteenth National Conference on Artificial Intelligence, Sixteenth Conference on Innovative Applications of Artificial Intelligence, 525-530. Menlo Park, CA: AAAI Press.
50. Ruml, W.; Do, M. B.; and Fromherz, M. P. J. 2005. On-Line Planning and Scheduling for High-Speed Manufacturing. In Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling, 30-39. Menlo Park, CA: AAAI Press.
51. Sanchez, R., and Kambhampati, S. 2005. Planning Graph Heuristics for Selecting Objectives in Over-Subscription Planning Problems. In Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling 192-201. Menlo Park, CA: AAAI Press.
52. Sanchez, J., and Mali, A. D. 2003. S-Mep: A Planner for Numeric Goals. In Proceedings of the Fifteenth IEEE International Conference on Tools with Artificial Intelligence, 274-283. Los Alamitos, CA: IEEE Computer Society.
53. Smith, D. E., and Weld, D. S. 1999. Temporal Planning with Mutual Exclusion Reasoning. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 326-337. San Francisco: Morgan Kaufmann.
54. Smith, D. E. 2003. The Mystery Talk. Invited Talk at the Second International Planning Summer School, 16-22 September.
55. Smith, D. E. 2004. Choosing Objectives in Over-Subscription Planning. In Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling, 393-401. Menlo Park, CA: AAAI Press.
56. Van Den Briel, M.; Nigenda, R. S.; Do, M. B.; and Kambhampati, S. 2004. Effective Approaches for Partial Satisfaction (Over-Subscription) Planning. In Proceedings of the Nineteenth National Conference on Artificial Intelligence, Sixteenth Conference on Innovative Applications of Artificial Intelligence, 562-569. Menlo Park, CA: AAAI Press.
57. Vidal, V. 2004. A Lookahead Strategy for Heuristic Search Planning. In Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling, 150-160. Menlo Park, CA: AAAI Press.
58. Yoon, S.; Fern, A.; and Givan, R. 2006. Learning Heuristic Functions from Relaxed Plans. In Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 162-171. Menlo Park, CA: AAAI Press.
59. Younes, H., and Simmons, R. 2003. VHPOP: Versatile Heuristic Partial Order Planner. Journal of Artificial Intelligence Research 20: 405-430.
60. Zimmerman, T., and Kambhampati, S. 2005. Using Memory to Transform Search on the Planning Graph. Journal of Artificial Intelligence Research 23: 533-585.