Temporal planning with continuous change
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Fast planning through planning graph analysis
Artificial Intelligence
Exploiting symmetry in the planning graph via explanation-guided search
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
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Artificial Intelligence
TALplanner: A temporal logic based forward chaining planner
Annals of Mathematics and Artificial Intelligence
Temporal Planning with Mutual Exclusion Reasoning
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
SHOP: Simple Hierarchical Ordered Planner
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
The Detection and Exploitation of Symmetry in Planning Problems
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Understanding and Extending Graphplan
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Planning graph as a (dynamic) CSP: exploiting EBL, DDB and other CSP search techniques in Graphplan
Journal of Artificial Intelligence Research
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
PDDL2.1: an extension to PDDL for expressing temporal planning domains
Journal of Artificial Intelligence Research
Planning through stochastic local search and temporal action graphs in LPG
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
On the application of least-commitment and heuristic search in temporal planning
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Total-order planning with partially ordered subtasks
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Local search topology in planning benchmarks: an empirical analysis
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Hi-index | 0.00 |
Many planning domains have to deal with temporal features that can be expressed using durations that are associated to actions. This paper presents a temporal planning approach that combines the principles of Graphplan and TGP, and uses the information calculated in the planning graph to deal with a model of actions that include local conditions and effects. In this approach, we propose two strategies for search. The first one is based on the Graphplan backward search. The second one is a new strategy for search based on a least-commitment and heuristic search, which attempts to overcome the main limitations of a chronological backtracking search when dealing with large temporal problems. This search has proved to be beneficial in the scalability of the planner and the experiments show that a planner using this new search is competitive with other state-of-the-art planners w.r.t. the plan quality.