Fast planning through planning graph analysis
Artificial Intelligence
Inferring state constraints for domain-independent planning
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
The Detection and Exploitation of Symmetry in Planning Problems
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
A Possibilistic Planner that Deals with Non-Determinism and Contingency
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Extending Planning Graphs to an ADL Subset
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
TALplanner: An Empirical Investigation of a Temporal Logic-based Forward Chaining Planner
TIME '99 Proceedings of the Sixth International Workshop on Temporal Representation and Reasoning
The automatic inference of state invariants in TIM
Journal of Artificial Intelligence Research
Theoretical Computer Science
Action-space partitioning for planning
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Taming numbers and durations in the model checking integrated planning system
Journal of Artificial Intelligence Research
A weighted CSP approach to cost-optimal planning
AI Communications
| Hi-index | 0.00 |
We describe a new practical domain independent task planner, called ShaPer, specially designed to deal efficiently with large problems. ShaPer performs in two steps. In the first step, executed off-line for a given domain subclass, ShaPer explores and builds a compact representation of the state space called the shape graph. The main contribution of ShaPer is its ability to "resist" to combinatorial explosion thanks to the manipulation of sets of similar state descriptions called shapes. The shape graph is then used by ShaPer to answer very efficiently to planning requests. A first version of the planner has been implemented. It has been tested on several well known benchmark domains. The results are very promising when compared with themost efficient planners from AIPS-2000 competition.