ADL: exploring the middle ground between STRIPS and the situation calculus
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Design patterns: elements of reusable object-oriented software
Design patterns: elements of reusable object-oriented software
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
Using temporal logics to express search control knowledge for planning
Artificial Intelligence
TALplanner: A temporal logic based forward chaining planner
Annals of Mathematics and Artificial Intelligence
Unifying SAT-based and Graph-based Planning
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
RealPlan: Decoupling Causal and Resource Reasoning in Planning
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Extending Planning Graphs to an ADL Subset
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Combining the Expressivity of UCPOP with the Efficiency of Graphplan
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Planning as Heuristic Search: New Results
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
On the compilability and expressive power of propositional planning formalisms
Journal of Artificial Intelligence Research
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
Accelerating partial-order planners: some techniques for effective search control and pruning
Journal of Artificial Intelligence Research
The automatic inference of state invariants in TIM
Journal of Artificial Intelligence Research
The detection and exploitation of symmetry in planning problems
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
SHOP: simple hierarchical ordered planner
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Hybrid STAN: Identifying and managing combinatorial optimisation sub-problems in planning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Fast planning through planning graph analysis
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Planning with sharable resource constraints
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Algorithms and limits for compact plan representations
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
Reformulation of a problem is intended to make the problem more amenable to efficient solution. This is equally true in the special case of reformulating a planning problem. This paper considers various ways in which reformulation has been exploited in planning. In particular, it considers reformulation of planning problems to exploit structure within them by allowing deployment of specialised sub-solvers, capable of tackling sub-problems with greater efficiency than generic planning technologies. The relationship between this reformulation of planning problems and the reformulation of problems in general is briefly considered.