Anytime heuristic search for partial satisfaction planning

Artificial Intelligence

Volumn 173, Issue 5-6, 2009, Pages 562-592

  Benton, J ^a   Do, Minh ^b   Kambhampati, Subbarao ^a  

^a Arizona State University   (United States)

^b PALO ALTO RESEARCH CENTER   (United States)

Author keywords

Heuristics; Partial satisfaction; Planning; Search

Indexed keywords

COSTS; HEURISTIC METHODS; LEARNING ALGORITHMS; LUMINOUS PAINT; MODULAR ROBOTS;

ANYTIME SEARCHES; FUEL COSTS; HEURISTIC SEARCHES; HEURISTICS; INTERNATIONAL PLANNING COMPETITIONS; PARTIAL SATISFACTION; RESOURCE COSTS; SEARCH; SEARCH ALGORITHMS; SOFT CONSTRAINTS; SOFT GOALS; STATE SPACES; STRIPS PLANNING; TERMINATION CRITERION;

PLANNING;

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

References (46)

1. J. Baier, F. Bacchus, S. McIllraith, A heuristic search approach to planning with temporally extended preferences, in: Proceedings of IJCAI-07, 2007
2. J. Baier, J. Hussell, F. Bacchus, S. McIllraith, Planning with temporally extended preferences by heuristic search, in: Proceedings of the ICAPS Booklet on the Fifth International Planning Competition, 2006
3. J. Benton, M.B. Do, S. Kambhampati, Over-subscription planning with numeric goals, in: Proceedings of IJCAI, 2005, pp. 1207-1213
4. J. Benton, S. Kambhampati, M. Do, YochanPS: PDDL3 simple preferences as partial satisfaction planning, in: Proceedings of the ICAPS Booklet on the Fifth International Planning Competition, 2006
5. J. Benton, M. van den Briel, S. Kambhampati, A hybrid linear programming and relaxed plan heuristic for partial satisfaction planning problems, in: Proceedings of ICAPS, 2007
6. M. Bienvenu, C. Fritz, S. McIlraith, Planning with qualitative temporal preferences, in: Proceedings of KR-06, 2006
7. B. Bonet, G. Loerincs, H. Geffner, A robust and fast action selection mechanism for planning, in: Proceedings of AAAI-97, 1997
8. B. Bonet, H. Geffner, Heuristics for planning with penalties and rewards using compiled knowledge, in: Proceedings of KR-06, 2006
9. Boutilier C., Dean T., and Hanks S. Decision-theoretic planning: Structural assumptions and computational leverage. Journal of Artificial Intelligence Research 11 (1999) 1-91
10. R.I. Brafman, Y. Chernyavsky, Planning with goal preferences and constraints, in: Proceeding of ICAPS-05, 2005
11. P. Dasgupta, A. Sen, S. Nandy, B. Bhattacharya, Searching networks with unrestricted edge costs, IEEE Transactions on Systems, Man, and Cybernetics
12. M.B. Do, J. Benton, S. Kambhampati, M. van den Briel, Heuristic planning with utility dependencies, in: Proceedings of IJCAI-07, 2007
13. Do M.B., and Kambhampati S. Sapa: A multi-objective metric temporal planer. Journal of Artificial Intelligence Research 20 (2002) 155-194
14. M.B. Do, S. Kambhampati, Improving the temporal flexibility of position constrained metric temporal plans, in: Proc. of ICAPS-03, 2003
15. M.B. Do, S. Kambhampati, Partial satisfaction (over-subscription) planning as heuristic search, in: Proceedings of KBCS-04, 2004
16. M.B. Do, T. Zimmerman, S. Kambhampati, Planning and scheduling with over-subscribed resources, preferences, and soft constraints, in: Tutorial given at AAAI-07, 2007
17. S. Edelkamp, Optimal symbolic pddl3 planning with mips-bdd, in: Proceedings of the ICAPS Booklet on the Fifth International Planning Competition, 2006
18. S. Edelkamp, S. Jabbar, M. Nazih, Large-scale optimal pddl3 planning with mips-xxl, in: Proceedings of the ICAPS Booklet on the Fifth International Planning Competition, 2006
19. E. Fink, Q. Yang, A spectrum of plan justifications, in: Proceedings of the AAAI 1993 Spring Symposium, 1993, pp. 23-33
20. J. Frank, A. Jonsson, R. Morris, D. Smith, Planning and scheduling for fleets of earth observing satellites, in: Proceedings of Sixth Int. Symp. on Artificial Intelligence, Robotics, Automation & Space, 2001
21. B. Gazen, C. Knoblock, Combining the expressiveness of ucpop with the efficiency of graphplan, in: Fourth European Conference on Planning, 1997
22. A. Gerevini, B. Bonet, B. Givan, Fifth international planning competition, in: IPC06 Booklet, 2006
23. A. Gerevini, D. Long, Plan constraints and preferences in PDDL3: The language of the fifth international planning competition, Tech. rep., University of Brescia, Italy (August 2005)
24. Gerevini A., and Long D. IPC-5 website (2006). http://zeus.ing.unibs.it/ipc-5/
25. Gerevini A., Saetti A., and Serina I. Planning through stochastic local search and temporal action graphs in lpg. Journal of Artificial Intelligence Research 20 (2003) 239-290
26. E. Giunchiglia, M. Maratea, Planning as satisfiability with preferences, in: Proceedings of AAAI-07, 2007
27. A. Globus, J. Crawford, J. Lohn, A. Pryor, Scheduling earth observing satellites with evolutionary algorithms, in: Proceedings of Int. Conf. on Space Mission Challenges for Infor. Tech., 2003
28. Hansen E., and Zhou R. Anytime heuristic search. Journal of Artificial Intelligence Research 28 (2007) 267-297
29. Helmert M. The fast downward planning system. Journal of Artificial Intelligence Research (2006) 191-246
30. J. Hoey, R. St-Aubin, A. Hu, C. Boutilier, Spudd: Stochastic planning using decision diagrams, in: Proceedings of UAI-99, 1999
31. Hoffmann J., and Nebel B. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14 (2001) 253-302
32. C.-W. Hsu, B. Wah, R. Huang, Y. Chen, New features in sgplan for handling preferences and constraints in pddl3.0, in: Proceedings of the ICAPS Booklet on the Fifth International Planning Competition, 2006
33. E. Keyder, H. Geffner, Set-additive and tsp heuristics for planning with action costs and soft goals, in: Proceedings of the Workshop on Heuristics for Domain-Independent Planning, ICAPS-07, 2007
34. L. Kramer, L. Giuliano, Reasoning about and scheduling linked hst observations with spike, in: Proceedings of Int. Workshop on Planning and Scheduling for Space, 1997
35. L. Kramer, S. Smith, Maximizing flexibility: A retraction heuristic for oversubscribed scheduling problems, in: Proceedings of IJCAI-03, 2003
36. M. Likhachev, G. Gordon, S. Thrun, Ara*: Anytime a* with provable bounds on sub-optimality, in: Proceedings of NIPS-04, 2004
37. Nguyen X., Kambhampati S., and Nigenda R.S. Planning graph as the basis to derive heuristics for plan synthesis by state space and csp search. Artificial Intelligence 135 1-2 (2002) 73-124
38. R.S. Nigenda, S. Kambhampati, Planning graph heuristics for selecting objectives in over-subscription planning problems, in: Proceedings of ICAPS-05, 2005
39. W. Potter, J. Gasch, A photo album of earth: Scheduling landsat 7 mission daily activities, in: Proceedings of SpaceOp, 1998
40. D.E. Smith, Choosing objectives in over-subscription planning, in: Proceedings of ICAPS-04, 2004
41. Stefan E. Taming numbers and durations in the model checking integrated planning system. Journal of Artificial Intelligence Research 40 (2003) 195-238
42. Tran S., and Pontelli E. Planning with preferences using logic programming. Theory and Practice of Logic Programming 6 5 (2006) 559-608
43. M. van den Briel, S. Kambhampati, T. Vossen, Planning with preferences and trajectory constraints by integer programming, in: Proceedings of Workshop on Preferences and Soft Constraints at ICAPS-06, 2006
44. M. van den Briel, R.S. Nigenda, M.B. Do, S. Kambhampati, Effective approaches for partial satisfaction (over-subscription) planning, in: Proceedings of AAAI-04, 2004
45. V. Vidal, A lookahead strategy for heuristic search planning, in: Proceedings of ICAPS-04, 2004
46. M. Williamson, S. Hanks, Optimal planning with a goal-directed utility model, in: Proceedings of AIPS-94, 1994