Lagrange Multipliers for Local Search on Planning Graphs
暂无分享,去创建一个
[1] Ivan Serina,et al. On Plan Adaption through Planning Graph Analysis , 1999, AI*IA.
[2] Daniel S. Weld,et al. UCPOP: A Sound, Complete, Partial Order Planner for ADL , 1992, KR.
[3] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.
[4] Ivan Serina,et al. Fast Plan Adaptation through Planning Graphs: Local and Systematic Search Techniques , 2000, AIPS.
[5] Zhe Wu,et al. The Theory of Discrete Lagrange Multipliers for Nonlinear Discrete Optimization , 1999, CP.
[6] Blai Bonet,et al. Planning as Heuristic Search: New Results , 1999, ECP.
[7] C. Reeves. Modern heuristic techniques for combinatorial problems , 1993 .
[8] Ivan Serina,et al. Fast Planning through Greedy Action Graphs , 1999, AAAI/IAAI.
[9] Jörg Hoffmann. A Heuristic for Domain Independent Planning and its Use in an Enforced Hill-climbing Algorithm , 2000, PuK.
[10] Bart Selman,et al. Noise Strategies for Improving Local Search , 1994, AAAI.
[11] Bart Selman,et al. Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.
[12] Fred W. Glover,et al. A user's guide to tabu search , 1993, Ann. Oper. Res..
[13] Benjamin W. Wah,et al. A Discrete Lagrangian-Based Global-Search Method for Solving Satisfiability Problems , 1996, J. Glob. Optim..
[14] Bernhard Nebel,et al. Extending Planning Graphs to an ADL Subset , 1997, ECP.
[15] Blai Bonet,et al. Planning as heuristic search , 2001, Artif. Intell..
[16] Zhe Wu,et al. An Efficient Global-Search Strategy in Discrete Lagrangian Methods for Solving Hard Satisfiability Problems , 2000, AAAI/IAAI.