LPG: A Planner Based on Local Search for Planning Graphs with Action Costs

Proceedings of the 6th International Conference on Artificial Intelligence Planning Systems, AIPS 2002

Volumn , Issue , 2002, Pages 13-22

  Gerevini, Alfonso ^a   Serina, Ivan ^a  

^a UNIVERSITY OF BRESCIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COSTS; LOCAL SEARCH (OPTIMIZATION);

'CURRENT; BENCHMARK DOMAINS; BLACK BOXES; ENCODINGS; LOCAL SEARCH; OBJECTIVE FUNCTIONS; OVERALL COSTS; PLANNING GRAPHS; QUALITY PLANS; SAT PROBLEMS;

LAGRANGE MULTIPLIERS;

EID: 85164908935     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Blum, A., and Furst, M. 1997. Fast planning through planning graph analysis. Artificial Intelligence 90:281-300.
2. Fox, M., and Long, D. 1998. Efficient implementation of the Plan Graph in STAN. Journal of Artificial Intelligence research (JAIR), vol. 10, 87-115.
3. Fox, M., and Long, D. 1999. The detection and exploitation of symmetry in planning problems. In Proc. of the 16th Int. Joint Conf. on Artificial Intelligence (IJCAI-99).
4. Gerevini, A., and Serina, I. 1999. Fast planning through greedy action graphs. In Proc. of the 16th Nat. Conf. of the Am. Assoc. for Artificial Intelligence (AAAI-99).
5. Gerevini, A., and Serina, I. 2001. Lagrange multipliers for local search on planning graphs. In Proc. of the ECAI-2000 Workshop on Local Search for Planning and Scheduling. Springer-Verlag.
6. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence research (JAIR) 14:253-302.
7. Kautz, H., and Selman, B. 1999. Unifying SAT-based and graph-based planning. In Proc. of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99).
8. Kautz, H.; McAllester, D.; and Selman, B. 1996. Encoding plans in propositional logic. In Proc. of the 5th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR'96).
9. Koehler, J.; Nebel, B.; Hoffmann, J.; and Dimopoulos, Y. 1997. Extending planning graphs to an ADL subset. In Proc. of Fourth European Conference on Planning (ECP'97). Springer Verlag.
10. Moskewicz, M.; Madigan, C.; Zhao, Y.; Zhang, L.; and Malik, S. 2001. Chaff: Engineering an efficient SAT solver. In Proc. of 39th Design Automation Conference.
11. Kambhampati, R.; Minh, S.; and Do, B. 2001. Planning as Constraint Satisfaction: Solving the planning graph by compiling it into CSP. Artificial Intelligence 132(2):151-182.
12. Selman, B.; Kautz, H.; and Cohen, B. 1994. Noise strategies for improving local search. In Proc. of the Twelfth Nat. Conference of the American Association for Artificial Intelligence (AAAI-94), 337-343.
13. Shang, Y., and Wah, B. 1998. A discrete Lagrangian-based global-search method for solving satisfiability problems. Journal of Global Optimization 12, 1:61-99.
14. Smith, D., and Weld, D. 1999. Temporal planning with mutual exclusion reasoning. In Proc. of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99).
15. Wah, B. W., and Wu, Z. Oct. 1999. The Theory of Discrete Lagrange Multipliers for Nonlinear Discrete Optimization. In Proc. of Principles and Practice of Constraint Programming. Springer-Verlag.
16. Wu, Z., and Wah, B. 2000. An efficient global-search strategy in discrete Lagrangian methods for solving hard satisfiability problems. In Proc. of the 17th Nat. Conf. of the American Assoc. for Artificial Intelligence (AAAI-00).