Multiobjective heuristic state-space planning

Artificial Intelligence

Volumn 145, Issue 1-2, 2003, Pages 1-32

  Refanidis, Ioannis ^a   Vlahavas, Ioannis ^b  

^a UNIVERSITY OF MACEDONIA   (Greece)

^b ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

Author keywords

Heuristic search; Multiobjective search; Multiple criteria; Planning

Indexed keywords

COSTS; HEURISTIC METHODS; PROBLEM SOLVING; RESOURCE ALLOCATION; STATE SPACE METHODS;

MULTIOBJECTIVE SEARCH;

ARTIFICIAL INTELLIGENCE;

EID: 0037380348     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(02)00371-5     Document Type: Article

References (37)

1. F. Bacchus The official AIPS-00 planning competition home page, http://www.cs.toronto.edu/aips2000/.
2. Blum A.L., Furst M.L. Fast planning through planning graph analysis. Artificial Intelligence. 90:1997;281-300.
3. Bonet B., Loerincs G., Geffner H. A robust and fast action selection mechanism for planning. Proc. AAAI-97, Providence, RI. 1997;714-719.
4. Bonet B., Geffner H. HSP: Heuristic search planner. 4th International Conf. on Artificial Intelligence Planning Systems (AIPS-98) Planning Competition, Pittsburgh, PA. 1998.
5. Bonet B., Geffner H. Heuristic planning: New results. Proc. 5th European Conference on Planning (ECP-99), Durham, UK. 1999;359-371.
6. Bonet B., Geffner H. Planning as heuristic search. Artificial Intelligence (Special Issue on Heuristic Search). 129:(1-2):2001;5-33.
7. Dasgupta P., Chakrabarti P.P., DeSarkar S.C. Multiobjective heuristic search in AND/OR graphs. J. Algorithms. 20:1996;282-311.
8. Dasgupta P., Chakrabarti P.P., DeSarkar S.C. Searching game trees under a partial order. Artificial Intelligence. 82:1996;237-257.
9. Fikes R.E., Nilsson N.J. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence. 2:1971;189-208.
10. Fujimura K. Path planning with multiple objectives. IEEE Robotics and Automation Magazine. 3:(1):1996;33-38.
11. Haddawy P., Hanks S. Utility models for goal-directed decision-theoretic planners. Computational Intelligence. 14:(3):1998;392-429.
12. P.E. Hart, N.J. Nilsson, B. Raphael, A formal basis for the heuristic determination of minimum cost paths, IEEE Trans. Systems Sci. Cybernet. 4 (2), 100-107.
13. Haslum P., Geffner H. Addmisible heuristics for optimal planning. Proc. 5th International Conference on AI Planning and Scheduling (AIPS-00), Breckenridge, CO. 2000;140-149.
14. Haslum P., Geffner H. Heuristic planning with time and resources. Proc. 6th European Conference on Planning, Toledo, Spain. 2001.
15. Hoffmann J., Nebel B. The FF planning system: Fast plan generation through heuristic search. J. Artificial Intelligence Res. 14:2001;253-302.
16. Koehler J., Nebel B., Hoffmann J., Dimopoulos Y. Extending planning graphs to an ADL subset. Proceedings 4th European Conference on Planning (ECP-97), Durham, UK. 1997;273-285.
17. Koehler J. Planning under resource constraints. Proc. 13th European Conference on Artificial Intelligence (ECAI-98), Brighton, UK. 1998;489-493.
18. Long D., Fox M. Efficient implementation of the plan graph in STAN. J. Artificial Intelligence Res. 10:1998;87-115.
19. Keeney R.L., Raiffa H. Decisions with Multiple Objectives: Preferences and Value Tradeoffs. 1976;Wiley, New York.
20. McDermott D. A heuristic estimator for means-ends analysis in planning. Proc. 3rd Internat. Conf. on Artificial Intelligence Planning Systems (AIPS-96), Edinburgh, Scotland. 1996;142-149.
21. D. McDermott, The official AIPS-98 planning competition home page, ftp://ftp.cs.yale.edu/pub/mcdermott/aipscomp-results.html.
22. McDermott D. Using regression-match graphs to control search in planning. Artificial Intelligence. 109:(1-2):1999;111-159.
23. Mollaghasemi M., Pet-Edwards J. Making Multiple-Objective Decisions. 1997;IEEE Computer Society.
24. Moraitis P., Tsoukias A. Graph based representation of dynamic planning. Proc. 14th European Conference on Artificial Intelligence (ECAI-2000) Berlin, Germany. 2000;516-520.
25. Nareyek A. A, Beyond the plan-length criterion. Nareyek A. Local Search for Planning and Scheduling. Lecture Notes Artificial Intelligence. 2148:2001;55-78 Springer, Berlin.
26. Nigenda R.S., Nguyen X., Kambhampati S. ALTALT: Combining the advantages of GRAPHPLAN and heuristic state search. Proc. International Conference on Knowledge-based Computer Systems, India. 2000.
27. Penberthy J., Weld D. UCPOP: A sound and complete, partial order planner for ADL. Proc. KR-92, Cambridge, MA. 1992;103-114.
28. Refanidis I., Vlahavas I. GRT: A domain independent heuristic for STRIPS worlds based on greedy regression tables. Proc. 5th European Conf. on Planning (ECP-99), Durham, UK. 1999;346-358.
29. Refanidis I., Vlahavas I., Tsoukalas L. On determining and completing incomplete states in STRIPS domains. Proc. IEEE International Conference on Information, Intelligence and Systems, Washington, DC. 1999;289-296.
30. Refanidis I., Vlahavas I. Heuristic planning with resources. Proc. 14th European Conference on Artificial Intelligence (ECAI-00), Berlin. 2000;521-525.
31. Refanidis I., Vlahavas I. The GRT planning system: Backward heuristic construction in forward state-space planning. J. Artificial Intelligence Res. 15:2001;115-161.
32. Refanidis I., Vlahavas I. The GRT planner. AI Magazine. 22:(3):2001;63-66.
33. Stewart B.S., White C.C. Multiobjective A* JACM. 38:(4):1991;775-814.
34. M. Veloso, Learning by analogical reasoning in general problem solving, Ph.D. Thesis, Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, 1992.
35. Vincke P. Multi-Criteria Decision Aid, New York. 1992.
36. Williamson M., Hanks S. Optimal planning with a goal-directed utility model. Proc. 2nd Int. Conf. on AI Planning Systems (AIPS-94), Chicago, IL. 1994;176-181.
37. Wolfman S.A., Weld D. The LPSAT engine and its application to resource planning. Proc. IJCAI-99, Stockholm, Sweden. 1999;310-316.