Enhancing Constraint Models for Planning Problems
Explore this paper's citation graph
Summary
The paper describes how to enhance existing constraint models of planning problems by using techniques such as symmetry breaking, singleton consistency, and lifting.
- Type
- article
- Published
- 2009-03-17
- Cited by
- 11
- References
- 17
- OpenAlex
- https://openalex.org/W78771200
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:15232218
Keywords
Constraint satisfaction problem, Boolean satisfiability problem, Satisfiability, Constraint satisfaction, Formalism (music)
References
- Generalizing GraphPlan by Formulating Planning as a CSP
- Automated Planning: Theory and Practice
- Programming Languages: Implementations, Logics, and Programs
- Adaptive Control for Autonomous Underwater Vehicles
- Planning as Satisfiability
- Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems
- Solving Planning-Graph by Compiling It into CSP
- Fast Planning Through Planning Graph Analysis
- COMPLEXITY RESULTS FOR SAS+ PLANNING
- Remote Agent: To Boldly Go Where No AI System Has Gone Before
- On-line Planning and Scheduling for High-speed Manufacturing
- Branching and pruning: An optimal temporal POCL planner based on constraint programming
- Reformulating Constraint Models for Classical Planning
- The Fast Downward Planning System
- Plan Permutation Symmetries as a Source of Planner Inefficiency
- Branching and pruning: an optimal temporal POCL planner based on constraint programming
- Constraint Processing
- An Open-Ended Finite Domain Constraint Solver
Cited by
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: 6th International Conference, CPAIOR 2009 Pittsburgh, PA, USA, May 27-31, 2009 Proceedings
- Coordinating the web of services for a smart home
- Heuristically guided constraint satisfaction for AI planning
- Integrating Constraint Models for Sequential and Partial-Order Planning
- Transition Constraints for Parallel Planning
- Domain-independent planning for services in uncertain and dynamic environments
- Encoding Domain Transitions for Constraint-Based Planning
- University of Groningen Coordinating the Web of Services for a Smart Home Kaldeli,
- Coordinating the Web of Services for a Smart Home
- Constraint Models for Sequential Planning
- Revisiting Constraint Models for Planning Problems
Related papers
- Solving Sequential Planning Problems via Constraint Satisfaction
- Reformulating Constraint Models for Classical Planning
- Automated planning - theory and practice
- Generalizing GraphPlan by Formulating Planning as a CSP
- Integrating Constraint Models for Sequential and Partial-Order Planning
- Branching and pruning: An optimal temporal POCL planner based on constraint programming