Lagrange multipliers for local search on planning graphs

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2148, Issue , 2001, Pages 37-54

  Gerevini, Alfonso ^a   Serina, Ivan ^a  

^a UNIVERSITY OF BRESCIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COST FUNCTIONS; COSTS; HEURISTIC ALGORITHMS; LOCAL SEARCH (OPTIMIZATION); SCHEDULING;

CONSTRAINT VIOLATION; DYNAMIC PARAMETERS; GRAPH MODIFICATIONS; LOCAL SEARCH HEURISTICS; PLAN ADAPTATION; PLAN GENERATION; PLANNING GRAPHS; STATIC VALUES;

LAGRANGE MULTIPLIERS;

EID: 84937428863     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-45612-0_3     Document Type: Conference Paper

References (15)

1. A. Blum and M.L. Furst. Fast planning through planning graph analysis. Artificial Intelligence, 90:281-300, 1997.
2. B. Bonet and H. Geffner. Planning as heuristic search. Artificial Intelligence, 2000. (Special Issue on Heuristic Search) Forthcoming.
3. A. Gerevini and I. Serina. Fast planning through greedy action graphs. In Proceedings of the 16th National Conference of the American Association for Artificial Intelligence (AAAI-99), pages 503-510, Orlando, Florida, July 1999. AAAI Press/MIT Press.
4. A. Gerevini and I. Serina. Plan adaptation through planning graph analysis. In AIIA: Advances in Artifi cial Intelligence. Lecture Notes in Artificial Intelligence 1792, pages 356-367. Springer-Verlag, 1999.
5. A. Gerevini and I. Serina. Fast plan adaptation through planning graphs: Local and systematic search techniques. In Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems (AIPS-00), Austin, Colorado, 2000. AAAI Press/MIT Press.
6. F. Glover and M. Laguna. Tabu search. In C. R. Reeves, editor, Modern heuristics for combinatorial problems. Blackwell Scientific, Oxford, GB, 1993.
7. F. Glover, E. Taillard, and D. De Werra. A user's guide to tabu search. Annals of Operation Research, 41:3-28, 1993.
8. J. Hoffmann. A heuristic for domain independent planning and its use in an enforced hill-climbing algorithm. Technical Report 133, Institut für Informatik, Universität Frei burg, 2000.
9. H.A. Kautz and B. Selman. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proceedings of the Thirteenth National Conference of the American Association for Artificial In telligence (AAAI-96), Portland, OR, 1996.
10. J. Koehler, B. Nebel, Hoffmann J., and Y. Dimopoulos. Extending planning graphs to an ADL subset. In Fourth European Conference on Planning (ECP'97), pages 273-285. Springer Verlag, 1997.
11. J.S. Penberthy and D.S. Weld. UCPOP: A sound, complete, partial order planner for ADL. In Bernard Nebel, Charles Ri ch, and William Swartout, editors, Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning (KR'92), pages 103-114, Boston, MA, 1992. Morgan Kaufmann.
12. B. Selman, H.A . Kautz, and B. Cohen. Noise strategies for improving local search. In Proceedings of the Twelfth National Conference of the American Association for Artificial Intelligence (AAAI-94), pages 337-343, Seattle, WA, 1994. Morgan Kaufm ann.
13. Y. Shang and B. W. Wah. A discrete Lagrangian-based global-search method for solving satisfiability problems. Journal of Global Optimization, 12 no. 1:61-99, 1998.
14. B. W. Wah and Z. Wu. The theory of discrete Lagrange multipliers for nonlinear discrete optimization. In Proc. Principles and Practice of Constraint Programming, pages 28-42. Springer-Verlag, Oct. 1999.
15. Zhe Wu,Benjamin W Wah. An efficient global-search strategy in discrete Lagrangian methods for solving hard satisfiability problems In Proceedings of the 17th National Conference of the American Association for Artificial Intelligence (AAAI-00 310-315. AAAI Pre ss/MIT Press, July 2000.