Multiobjective heuristic state-space planning

F. Bacchus The official AIPS-00 planning competition home page, http://www.cs.toronto.edu/aips2000/ Blum, 1997, Fast planning through planning graph analysis, Artificial Intelligence, 90, 281, 10.1016/S0004-3702(96)00047-1 Bonet, 1997, A robust and fast action selection mechanism for planning, 714 Bonet, 1998, HSP: Heuristic search planner Bonet, 1999, Heuristic planning: New results, 359 Bonet, 2001, Planning as heuristic search, Artificial Intelligence (Special Issue on Heuristic Search), 129, 5 Dasgupta, 1996, Multiobjective heuristic search in AND/OR graphs, J. Algorithms, 20, 282, 10.1006/jagm.1996.0015 Dasgupta, 1996, Searching game trees under a partial order, Artificial Intelligence, 82, 237, 10.1016/0004-3702(94)00085-9 Fikes, 1971, STRIPS: A new approach to the application of theorem proving to problem solving, Artificial Intelligence, 2, 189, 10.1016/0004-3702(71)90010-5 Fujimura, 1996, Path planning with multiple objectives, IEEE Robotics and Automation Magazine, 3, 33, 10.1109/100.486659 Haddawy, 1998, Utility models for goal-directed decision-theoretic planners, Computational Intelligence, 14, 392, 10.1111/0824-7935.00068 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 Haslum, 2000, Addmisible heuristics for optimal planning, 140 Haslum, 2001, Heuristic planning with time and resources Hoffmann, 2001, The FF planning system: Fast plan generation through heuristic search, J. Artificial Intelligence Res., 14, 253, 10.1613/jair.855 Koehler, 1997, Extending planning graphs to an ADL subset, 273 Koehler, 1998, Planning under resource constraints, 489 Long, 1998, Efficient implementation of the plan graph in STAN, J. Artificial Intelligence Res., 10, 87, 10.1613/jair.570 Keeney, 1976 McDermott, 1996, A heuristic estimator for means-ends analysis in planning, 142 D. McDermott, The official AIPS-98 planning competition home page, ftp://ftp.cs.yale.edu/pub/mcdermott/aipscomp-results.html McDermott, 1999, Using regression-match graphs to control search in planning, Artificial Intelligence, 109, 111, 10.1016/S0004-3702(99)00010-7 Mollaghasemi, 1997 Moraitis, 2000, Graph based representation of dynamic planning, 516 Nareyek, 2001, A, Beyond the plan-length criterion, 2148, 55 Nigenda, 2000, ALTALT: Combining the advantages of GRAPHPLAN and heuristic state search Penberthy, 1992, UCPOP: A sound and complete, partial order planner for ADL, 103 Refanidis, 1999, GRT: A domain independent heuristic for STRIPS worlds based on greedy regression tables, 346 Refanidis, 1999, On determining and completing incomplete states in STRIPS domains, 289 Refanidis, 2000, Heuristic planning with resources, 521 Refanidis, 2001, The GRT planning system: Backward heuristic construction in forward state-space planning, J. Artificial Intelligence Res., 15, 115, 10.1023/A:1006584801959 Refanidis, 2001, The GRT planner, AI Magazine, 22, 63 Stewart, 1991, Multiobjective A∗, JACM, 38, 775, 10.1145/115234.115368 M. Veloso, Learning by analogical reasoning in general problem solving, Ph.D. Thesis, Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, 1992 Vincke, 1992 Williamson, 1994, Optimal planning with a goal-directed utility model, 176 Wolfman, 1999, The LPSAT engine and its application to resource planning, 310