A heuristic search approach to planning with temporally extended preferences

Artificial Intelligence

Volumn 173, Issue 5-6, 2009, Pages 593-618

  Baier, Jorge A ^a,b   Bacchus, Fahiem ^a   McIlraith, Sheila A ^a  

^a UNIVERSITY OF TORONTO   (Canada)

^b PONTIFICIA UNIVERSIDAD CATÓLICA DE CHILE   (Chile)

Author keywords

PDDL3; Planning with preferences; Temporally extended preferences

Indexed keywords

HEURISTIC METHODS; LEARNING ALGORITHMS;

FINAL STATE; HEURISTIC SEARCHES; INTERNATIONAL PLANNING COMPETITIONS; OPTIMAL PLANS; PDDL3; PLANNING DOMAINS; PLANNING PROBLEMS; PLANNING SYSTEMS; SEARCH ALGORITHMS; TEMPORALLY EXTENDED PREFERENCES;

PLANNING;

EID: 60549115949     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2008.11.011     Document Type: Article

References (37)

1. Bacchus F., and Kabanza F. Planning for temporally extended goals. Annals of Mathematics and Artificial Intelligence 22 1-2 (1998) 5-27
2. J.A. Baier, S.A. McIlraith, Planning with first-order temporally extended goals using heuristic search, in: Proceedings of the 21st National Conference on Artificial Intelligence (AAAI), Boston, MA, 2006, pp. 788-795
3. J.A. Baier, S.A. McIlraith, On domain-independent heuristics for planning with qualitative preferences, in: 7th Workshop on Nonmonotonic Reasoning, Action and Change (NRAC), 2007
4. J. Benton, S. Kambhampati, M.B. Do, YochanPS: PDDL3 simple preferences and partial satisfaction planning, in: 5th International Planning Competition Booklet (IPC-2006), Lake District, England, July 2006, pp. 54-57
5. J. Benton, M. van den Briel, S. Kambhampati, A hybrid linear programming and relaxed plan heuristic for partial satisfaction problems, in: Proceedings of the 17th International Conference on Automated Planning and Scheduling (ICAPS), Providence, RI, September 2007, pp. 34-41
6. M. Bienvenu, C. Fritz, S. McIlraith, Planning with qualitative temporal preferences, in: Proceedings of the 10th International Conference on Knowledge Representation and Reasoning (KR), Lake District, England, 2006, pp. 134-144
7. Blum A., and Furst M.L. Fast planning through planning graph analysis. Artificial Intelligence 90 1-2 (1997) 281-300
8. Bonet B., and Geffner H. Planning as heuristic search. Artificial Intelligence 129 1-2 (2001) 5-33
9. B. Bonet, H. Geffner, Heuristics for planning with penalties and rewards using compiled knowledge, in: Proceedings of the 10th International Conference on Knowledge Representation and Reasoning (KR), 2006, pp. 452-462
10. R. Brafman, Y. Chernyavsky, Planning with goal preferences and constraints, in: Proceedings of the 15th International Conference on Automated Planning and Scheduling (ICAPS), Monterey, CA, June 2005, pp. 182-191
11. Coles A.I., and Smith A.J. Marvin: A heuristic search planner with online macro-action learning. Journal of Artificial Intelligence Research 28 (February 2007) 119-156
12. J.P. Delgrande, T. Schaub, H. Tompits, Domain-specific preferences for causal reasoning and planning, in: Proceedings of the 14th International Conference on Automated Planning and Scheduling (ICAPS), Whistler, Canada, June 2004, pp. 63-72
13. Dimopoulos Y., Gerevini A., Haslum P., and Saetti A. The benchmark domains of the deterministic part of ipc-5 (July 2006). http://zeus.ing.unibs.it/ipc-5/
14. M.B. Do, J. Benton, M. van den Briel, S. Kambhampati, Planning with goal utility dependencies, in: Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI), Hyderabad, India, 2007, pp. 1872-1878
15. S. Edelkamp, Optimal symbolic PDDL3 planning with MIPS-BDD, in: 5th International Planning Competition Booklet (IPC-2006), Lake District, England, July 2006, pp. 31-33
16. S. Edelkamp, J. Hoffmann, PDDL2.2: The language for the classical part of the 4th International Planning Competition, Tech. Rep. 195, Computer Science Department, University of Freiburg, 2004
17. S. Edelkamp, S. Jabbar, M. Naizih, Large-scale optimal PDDL3 planning with MIPS-XXL, in: 5th International Planning Competition Booklet (IPC-2006), Lake District, England, July 2006, pp. 28-30
18. R. Feldmann, G. Brewka, S. Wenzel, Planning with prioritized goals, in: Proceedings of the 10th International Conference on Knowledge Representation and Reasoning (KR), Lake District, England, July 2006, pp. 503-514
19. Fikes R., and Nilsson N.J. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence 2 3/4 (1971) 189-208
20. Fox M., and Long D. PDDL2.1: An extension to PDDL for expressing temporal planning domains. Journal of Artificial Intelligence Research 20 (2003) 61-124
21. B.C. Gazen, C.A. Knoblock, Combining the expressivity of UCPOP with the efficiency of graphplan, in: ECP97. Toulouse, France, September 1997, pp. 221-233
22. Gerevini A., Dimopoulos Y., Haslum P., and Saetti A. 5th International Planning Competition (July 2006). http://zeus.ing.unibs.it/ipc-5/
23. A. Gerevini, D. Long, Plan constraints and preferences for PDDL3, Tech. Rep. 2005-08-07, Department of Electronics for Automation, University of Brescia, Brescia, Italy, 2005
24. E. Giunchiglia, M. Maratea, Planning as satisfiability with preferences, in: Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI), Vancouver, British Columbia, 2007, pp. 987-992
25. Haslum P. Openstacks SP-NCE domain (2007). http://users.rsise.anu.edu.au/~patrik/ipc5.html
26. Hoffmann J. The Metric-FF planning system: Translating ignoring delete lists to numeric state variables. Journal of Artificial Intelligence Research 20 (2003) 291-341
27. Hoffmann J., and Nebel B. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14 (2001) 253-302
28. C.-W. Hsu, B. Wah, R. Huang, Y. Chen, Constraint partitioning for solving planning problems with trajectory constraints and goal preferences, in: Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI), Hyderabad, India, January 2007, pp. 1924-1929
29. D.V. McDermott, A heuristic estimator for means-ends analysis in planning, in: AIPS96, 1996, pp. 142-149
30. D.V. McDermott, PDDL-The Planning Domain Definition Language, Tech. Rep. TR-98-003/DCS TR-1165, Yale Center for Computational Vision and Control, 1998
31. E.P.D. Pednault, ADL: Exploring the middle ground between STRIPS and the situation calculus, in: Proceedings of the 1st International Conference of Knowledge Representation and Reasoning (KR), Toronto, Canada, May 1989, pp. 324-332
32. A. Pnueli, The temporal logic of programs, in: Proceedings of the 18th IEEE Symposium on Foundations of Computer Science (FOCS), 1977, pp. 46-57
33. R. Sanchez, S. Kambhampati, Planning graph heuristics for selecting objectives in over-subscription planning problems, in: Proceedings of the 15th International Conference on Automated Planning and Scheduling (ICAPS), Monterey, CA, 2005, pp. 192-201
34. D.E. Smith, Choosing objectives in over-subscription planning, in: Proceedings of the 14th International Conference on Automated Planning and Scheduling (ICAPS), Whistler, Canada, 2004, pp. 393-401
35. Son T.C., and Pontelli E. Planning with preferences using logic programming. In: Lifschitz V., and Niemela I. (Eds). Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR). LNCS vol. 2923 (2004), Springer 247-260
36. M. van den Briel, R.S. Nigenda, M.B. Do, S. Kambhampati, Effective approaches for partial satisfaction (over-subscription) planning, in: Proceedings of the 19th National Conference on Artificial Intelligence (AAAI), 2004, pp. 562-569
37. L. Zhu, R. Givan, Simultaneous heuristic search for conjunctive subgoals, in: Proceedings of the 20th National Conference on Artificial Intelligence (AAAI), Pittsburgh, Pennsylvania, USA, July 9-13 2005, pp. 1235-1241