Planning as Propositional CSP: From Walksat to Local Search Techniques for Action Graphs
暂无分享,去创建一个
[1] Ivan Serina,et al. Fast Plan Adaptation through Planning Graphs: Local and Systematic Search Techniques , 2000, AIPS.
[2] Alexander Nareyek. Beyond the Plan-Length Criterion , 2000, Local Search for Planning and Scheduling.
[3] Craig A. Knoblock,et al. Planning by Rewriting , 2001, J. Artif. Intell. Res..
[4] Bernhard Nebel,et al. The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..
[5] Bart Selman,et al. Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.
[6] Peter van Beek,et al. CPlan: A Constraint Programming Approach to Planning , 1999, AAAI/IAAI.
[7] Alfonso Gerevini,et al. Temporal Planning through Mixed Integer Programming: A Preliminary Report , 2002, CP.
[8] Daniel S. Weld. Recent Advances in AI Planning , 1999, AI Mag..
[9] Enrico Giunchiglia,et al. Act, and the Rest Will Follow: Exploiting Determinism in Planning as Satisfiability , 1998, AAAI/IAAI.
[10] Ivan Serina,et al. LPG: A Planner Based on Local Search for Planning Graphs with Action Costs , 2002, AIPS.
[11] DepartmentBoston CollegeChestnut Hill. Representing and Learning Quality-improving Search Control Knowledge , 1996 .
[12] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[13] Ivan Serina,et al. Fast Planning through Greedy Action Graphs , 1999, AAAI/IAAI.
[14] Benjamin W. Wah,et al. A Discrete Lagrangian-Based Global-Search Method for Solving Satisfiability Problems , 1996, J. Glob. Optim..
[15] Monte Zweben,et al. Scheduling and rescheduling with iterative repair , 1993, IEEE Trans. Syst. Man Cybern..
[16] Maria Fox,et al. The Detection and Exploitation of Symmetry in Planning Problems , 1999, IJCAI.
[17] David E. Smith,et al. Conditional Effects in Graphplan , 1998, AIPS.
[18] Steven Minton,et al. Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..
[19] Jan Karel Lenstra,et al. Job Shop Scheduling by Local Search , 1996, INFORMS J. Comput..
[20] Chu Min Li,et al. Heuristics Based on Unit Propagation for Satisfiability Problems , 1997, IJCAI.
[21] Bart Selman,et al. Encoding Plans in Propositional Logic , 1996, KR.
[22] Steve A. Chien,et al. An Empirical Evaluation of the Effectiveness of Local Search for Replanning , 2000, Local Search for Planning and Scheduling.
[23] Bart Selman,et al. Noise Strategies for Improving Local Search , 1994, AAAI.
[24] Alexander Nareyek,et al. Constraint-Based Agents-An Architecture for Constraint-Based Modeling and Local-Search-Based Reasoni , 2001 .
[25] Ivan Serina,et al. Lagrange Multipliers for Local Search on Planning Graphs , 2000, Local Search for Planning and Scheduling.
[26] Bart Selman,et al. Unifying SAT-based and Graph-based Planning , 1999, IJCAI.
[27] Thomas Stützle,et al. Local Search Algorithms for SAT: An Empirical Evaluation , 2000, Journal of Automated Reasoning.
[28] Subbarao Kambhampati,et al. Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan , 2000, J. Artif. Intell. Res..
[29] Yves Crama,et al. Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.
[30] Zhe Wu,et al. An Efficient Global-Search Strategy in Discrete Lagrangian Methods for Solving Hard Satisfiability Problems , 2000, AAAI/IAAI.
[31] Bernhard Nebel,et al. Extending Planning Graphs to an ADL Subset , 1997, ECP.
[32] M. Fox,et al. Efficient Implementation of the Plan Graph in STAN , 2011, J. Artif. Intell. Res..
[33] Sharad Malik,et al. Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).
[34] Brian Falkenhainer,et al. Dynamic Constraint Satisfaction Problems , 1990, AAAI.
[35] Daniel S. Weld,et al. The LPSAT Engine & Its Application to Resource Planning , 1999, IJCAI.
[36] Jin-Kao Hao,et al. Solving the Sports League Scheduling Problem with Tabu Search , 2000, Local Search for Planning and Scheduling.
[37] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.
[38] Vincent Vidal,et al. Least commitment in Graphplan , 2001, Artif. Intell..
[39] Zhe Wu,et al. The Theory of Discrete Lagrange Multipliers for Nonlinear Discrete Optimization , 1999, CP.
[40] David E. Smith,et al. Temporal Planning with Mutual Exclusion Reasoning , 1999, IJCAI.
[41] Subbarao Kambhampati,et al. Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP , 2001, Artif. Intell..
[42] Subbarao Kambhampati,et al. Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search , 2002, Artif. Intell..
[43] Tara A. Estlin,et al. Learning to Improve both Efficiency and Quality of Planning , 1997, IJCAI.