LPG: A Planner Based on Local Search for Planning Graphs with Action Costs
暂无分享,去创建一个
[1] Ivan Serina,et al. Lagrange Multipliers for Local Search on Planning Graphs , 2000, Local Search for Planning and Scheduling.
[2] Bernhard Nebel,et al. The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..
[3] Sharad Malik,et al. Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).
[4] Bart Selman,et al. Encoding Plans in Propositional Logic , 1996, KR.
[5] M. Fox,et al. Efficient Implementation of the Plan Graph in STAN , 2011, J. Artif. Intell. Res..
[6] Benjamin W. Wah,et al. A Discrete Lagrangian-Based Global-Search Method for Solving Satisfiability Problems , 1996, J. Glob. Optim..
[7] Zhe Wu,et al. An Efficient Global-Search Strategy in Discrete Lagrangian Methods for Solving Hard Satisfiability Problems , 2000, AAAI/IAAI.
[8] Bart Selman,et al. Unifying SAT-based and Graph-based Planning , 1999, IJCAI.
[9] Bart Selman,et al. Noise Strategies for Improving Local Search , 1994, AAAI.
[10] Bernhard Nebel,et al. Extending Planning Graphs to an ADL Subset , 1997, ECP.
[11] Ivan Serina,et al. Fast Planning through Greedy Action Graphs , 1999, AAAI/IAAI.
[12] Maria Fox,et al. The Detection and Exploitation of Symmetry in Planning Problems , 1999, IJCAI.
[13] David E. Smith,et al. Temporal Planning with Mutual Exclusion Reasoning , 1999, IJCAI.
[14] Subbarao Kambhampati,et al. Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP , 2001, Artif. Intell..
[15] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.
[16] Zhe Wu,et al. The Theory of Discrete Lagrange Multipliers for Nonlinear Discrete Optimization , 1999, CP.