On delete relaxation in partial-order causal-link planning

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn , Issue , 2013, Pages 674-681

  Bercher, Pascal ^a   Geier, Thomas ^a   Richter, Felix ^a   Biundo, Susanne ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

Heuristic search; Partial Order Causal Link Planning; POCL planning

Indexed keywords

COMPLEXITY RESULTS; DECISION PROBLEMS; DOMAIN MODEL; HEURISTIC SEARCH; INTERNATIONAL PLANNING COMPETITIONS; PARTIAL ORDER CAUSAL LINKS;

HEURISTIC ALGORITHMS; TOOLS;

ARTIFICIAL INTELLIGENCE;

EID: 84897723981     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2013.105     Document Type: Conference Paper

References (16)

1. D. McAllester and D. Rosenblitt, " Systematic nonlinear planning," in Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI 1991). AAAI Press, 1991, pp. 634-639.
2. J. S. Penberthy and D. S. Weld, " UCPOP: A sound, complete, partial order planner for ADL," in Proceedings of the third International Conference on Knowledge Representation and Reasoning. Morgan Kaufmann, 1992, pp. 103-114.
3. C. Muise, S. A. McIlraith, and J. C. Beck, "Monitorin g the execution of partial-order plans via regression," in Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011). AAAI Press, 2011, pp. 1975-1982.
4. B. Seegebarth, F. Muller, B. Schattenberg, and S. Biundo, " Making hybrid plans more clear to human users- A formal approach for generating sound explanations," in Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS 2012). AAAI Press, 6 2012, pp. 225-233.
5. M. Helmert and C. Domshlak, " Landmarks, critical paths and abstractions: Whats the difference anyway" in Proceedings of the 19th International C onference on Automated Planning and Scheduling (ICAPS 2009), vol. 9, 2009, pp. 162-169.
6. T. Bylander, "The computational complexity of propositional STRIPS planning," Artificial Intelligence, vol. 94, no. 1-2, pp. 165-204, 1994.
7. J. Hoffmann and B. Nebel, " The FF planning system: Fast plan generation through heuristic search," Journal of Artificial Intelligence Research ( JAIR), vol. 14, pp. 253-302, May 2001.
8. A. L. Blum and M. L. Furst, " Fast planning through planning graph analysis," Artificial Intelligence, vol. 90, pp. 281-300, 1997.
9. X. Nguyen and S. Kambhampati, " Reviving partial order planning," in Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI 2001). Morgan Kaufmann, 2001, pp. 459-466.
10. H. L. S. Younes and R. G. Simmons, " VHPOP: Versatile heuristic partial order planner," Journal of Artificial Intelligence Research (JAIR), vol. 20, pp. 405-430, 2003.
11. P. Bercher, T. Geier, and S. Biundo, " Using state-based planning heuristics for partial-order causal-link planning," in Advances in Artificial Intelligence, Proceedings of the 36nd German Conference on Artificial Intelligence (KI 2013), 2013, pp. 1-12.
12. R. E. Fikes and N. J. Nilsson, " STRIPS: A new approach to the application of theorem proving to problem solving," Artificial Intelligence, vol. 2, pp. 189-208, 1971.
13. M. Katz, J. Hoffmann, and C. Domshlak, " Who said we need to relax all variables" in Proceedings of the 23d International Conference on Automated Planning and Scheduling (ICAPS 2013), 2013.
14. B. Nebel and C. Backstrom, " On the computational complexity of temporal projection, planning, and plan validation," Artificial Intelligence, vol. 66, no. 1, pp. 125-160, 1994.
15. G. Brightwell and P. Winkler, " Counting linear extensions," Order, vol. 8, no. 3, pp. 225-242, 1991.[Online]. Available: Http://dx.doi.org/10.1007/BF00383444
16. D. Joslin and M. E. Pollack, " Least-cost flaw repair: A plan refinement strategy for partial-order planning," in Proceedings of the 12th National Conference on Artificial Intelligence (AAAI 1994). AAAI Press, 1994, pp. 1004-1009.