A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
ADL: exploring the middle ground between STRIPS and the situation calculus
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Fast planning through planning graph analysis
Artificial Intelligence
CPlan: a constraint programming approach to planning
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Planning as constraint satisfaction: solving the planning graph by compiling it into CSP
Artificial Intelligence
Planning with natural actions in the situation calculus
Logic-based artificial intelligence
Extending Planning Graphs to an ADL Subset
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Applying integer programming to AI planning
The Knowledge Engineering Review
Planning with resources and concurrency a forward chaining approach
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Effective redundant constraints for online scheduling
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
IEEE Intelligent Systems
A distributed framework for solving the Multiagent Plan Coordination Problem
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Constraint-Based Multi-agent Path Planning
AI '08 Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Representing Multi-agent Planning in CLP
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Revisiting Constraint Models for Planning Problems
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Filtering, decomposition and search space reduction for optimal sequential planning
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Set-structured and cost-sharing heuristics for classical planning
Annals of Mathematics and Artificial Intelligence
Efficient and distributable methods for solving the multiagent plan coordination problem
Multiagent and Grid Systems - Planning in multiagent systems
Multivalued action languages with constraints in CLP(FD)
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Slice encoding for constraint-based planning
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Solving Sequential Planning Problems via Constraint Satisfaction
Fundamenta Informaticae - Methodologies for Intelligent Systems
The Knowledge Engineering Review
Constraint Based Planning with Composable Substate Graphs
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
A weighted CSP approach to cost-optimal planning
AI Communications
Hi-index | 0.00 |
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can be used to eliminate variables and add new constraints to the encoding. We show that our transformations uncover additional structure in the planning problem, structure that subsumes the structure uncovered by GRAPHPLAN planning graphs. We solve the CSP encoded planning problem by using standard CSP algorithms. Empirical evidence is presented to validate the effectiveness of this approach to solving planning problems, and to show that even a prototype implementation is more effective than standard GRAPHPLAN. Our prototype is even competitive with far more optimized planning graph based implementations. We also demonstrate that this approach can be more easily lifted to more complex types of planning than can planning graphs. In particular, we show that the approach can be easily extended to planning with resources.