Incrementally solving STNs by enforcing partial path consistency

ICAPS 2010 - Proceedings of the 20th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2010, Pages 129-136

  Planken, Léon ^a   De Weerdt, Mathijs ^a   Yorke Smith, Neil ^b  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b AMERICAN UNIVERSITY OF BEIRUT   (Lebanon)

Author keywords

[No Author keywords available]

Indexed keywords

CHORDAL GRAPHS; CONSTRAINT NETWORKS; CONSTRAINT PROPAGATION; EMPIRICAL RESULTS; HIERARCHICAL TASK NETWORKS; PATH CONSISTENCY; SPARSE GRAPHS; TEMPORAL CONSTRAINTS; TEMPORAL INFORMATION; TEMPORAL NETWORKS; TEMPORAL PLANNING; TIME COMPLEXITY;

ALGORITHMS; PLANNING;

GRAPH THEORY;

EID: 78650630116     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. Arnborg, S.; Corneil, D. G.; and Proskurowski, A. 1987. Complexity of finding embeddings in a k -tree. SIAM Journal on Algebraic and Discrete Methods 8(2):277-284.
2. Ausiello, G.; Italiano, G.; Marchetti-Spaccamela, A.; and Nanni, U. 1991. Incremental algorithms for minimal length paths. J. Algorithms 12(4):615-638.
3. Berry, A.; Heggernes, P.; and Villanger, Y. 2006. A vertex incremental approach for maintaining chordality. Discrete Mathematics 306(3):318-336. (Pubitemid 43289236)
4. Bliek, C., and Sam-Haroud, D. 1999. Path consistency on triangulated constraint graphs. In Proc. of IJCAI-99, 456-461.
5. Bresina, J.; Jónsson, A. K.; Morris, P.; and Rajan, K. 2005. Activity planning for the Mars exploration rovers. In Proc. of ICAPS-05, 40-49.
6. Bui, H. H.; Tyson, M.; and Yorke-Smith, N. 2008. Efficient message passing and propagation of simple temporal constraints: Results on semi-structured networks. In Proc. of CP/ICAPS'08 Joint Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, 17-24.
7. Castillo, L.; Fdez-Olivares, J.; and O. Garca-Pérez, F. P. 2006. Efficiently handling temporal knowledge in an HTN planner. In Proc. of ICAPS-06, 63-72.
8. Cesta, A., and Oddi, A. 1996. Gaining efficiency and flexibility in the simple temporal problem. In Proc. of TIME'96, 45-50.
9. Dechter, R.; Meiri, I.; and Pearl, J. 1991. Temporal constraint networks. Artificial Intelligence 49(1-3):61-95.
10. Demetrescu, C., and Italiano, G. 2006a. Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures. Journal of Discrete Algorithms 4(3):353-383. (Pubitemid 44287625)
11. Demetrescu, C, and Italiano, G. 2006b. Experimental analysis of dynamic all pairs shortest path algorithms. ACM Transactions on Algorithms 2(4):578-601. (Pubitemid 46174062)
12. Erol, K.; Hendler, J.; and Nau, D. 1994. Semantics for Hierarchical Task-Network planning. Technical Report CS-TR-3239, University of Maryland.
13. Even, S., and Gazit, H. 1985. Updating distances in dynamic graphs. Methods of Operations Research 49:371-387.
14. Hunsberger, L. 2008. A practical temporal constraint management system for real-time applications. In Proc. of ECAI-08, 553-557.
15. Ibarra, L. 2008. Fully dynamic algorithms for chordal graphs and split graphs. ACM Transactions on Algorithms 4(4):40:1-20.
16. Laborie, P., and Ghallab, M. 1995. Planning with sharable resource constraints. In Proc. of IJCAI-95, 1643-1649.
17. Mohr, R., and Henderson, T. C. 1986. Arc and path consistency revisited. Artificial Intelligence 28(2):225-233.
18. Planken, L. R.; de Weerdt, M. M.; and van der Krogt, R. P. 2008. P3C: A new algorithm for the simple temporal problem. In Proc. of ICAPS-08, 256-263.
19. Planken, L. R. 2008. Incrementally solving the STP by enforcing partial path consistency. In Proc. of 27th PlanSIG Workshop, 87-94.
20. Ramalingam, G.; Song, J.; Joskowicz, L.; and Miller, R. E. 1999. Solving systems of difference constraints incrementally. Algorithmica 23(3):261-275.
21. Ranise, S., and Tinelli, C. 2003. The SMT-LIB format: An initial proposal. In Proc. of PDPAR'03, 94-111.
22. Smith, D. E.; Frank, J.; and Jónsson, A. K. 2000. Bridging the gap between planning and scheduling. Knowledge Engineering Review 15(1):47-83.
23. Stergiou, K., and Koubarakis, M. 2000. Backtracking algorithms for disjunctions of temporal constraints. Artificial Intelligence 120(1):81-117.
24. Thorup, M. 2004. Fully-dynamic all-pairs shortest paths: Faster and allowing negative cycles. In Proc. of 9th Scandinavian Workshop on Algorithm Theory, 384-396.
25. Tsamardinos, I., and Pollack, M. E. 2003. Efficient solution techniques for disjunctive temporal reasoning problems. Artificial Intelligence 151(1-2):43-89.
26. West, D. B. 1996. Introduction to Graph Theory. Prentice-Hall.
27. Xu, L., and Choueiry, B. Y. 2003. A new efficient algorithm for solving the Simple Temporal Problem. In Proc. of TIME-ICTL-03, 210-220.