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
Temporal Planning with Mutual Exclusion Reasoning
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
Domain-independent temporal planning in a planning-graph-based approach
AI Communications
| Hi-index | 0.00 |
Graphplan planning graphs are structures widely used in modern planners. The exclusion relations calculated in the planning graph extension provide very useful information, especially in temporal planning where actions have different duration. However, Graphplan backward search has some inefficiencies that impose limitations when dealing with large temporal problems. This paper presents a new search process for temporal planning to avoid these inefficiencies. This search uses the information of a planning graph and shows beneficial in the scalability of the planner. Moreover, our experiments show that a planner with this new search is competitive with other state-of-the-art planners w.r.t. the plan quality.