Efficient variable elimination for semi-structured simple temporal networks with continuous domains

Knowledge Engineering Review

Volumn 25, Issue 3, 2010, Pages 337-351

  Yorke Smith, Neil ^a   Bui, Hung H ^a  

^a SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE CONSISTENCY; CONSTRAINT GRAPH; CONTINUOUS DOMAIN; DISCRETE DOMAINS; EMPIRICAL RESULTS; GRAPH ALGORITHMS; HIERARCHICAL TASK NETWORKS; SEMI-STRUCTURED; TEMPORAL CONSTRAINTS; TEMPORAL NETWORKS; TREE-DECOMPOSITION; TREE-WIDTH; VARIABLE ELIMINATION;

INFERENCE ENGINES; MATHEMATICAL OPERATORS; MESSAGE PASSING;

TREES (MATHEMATICS);

EID: 77958606001     PISSN: 02698889     EISSN: 14698005     Source Type: Journal    
DOI: 10.1017/S0269888910000184     Document Type: Article

References (24)

1. Bliek, C. & Sam-Haroud, D. 1999. Path consistency on triangulated constraint graphs. In Proceedings of IJCAI'99, Stockholm, Sweden.
2. Bresina, J., Jó nsson, A. K., Morris, P. & Rajan, K. 2005. Activity planning for the Mars exploration rovers. In Proceedings of ICAPS'05, Monterey, CA.
3. Bui, H. H., Tyson, M. & Yorke-Smith, N. 2007. Efficient message passing and propagation of simple temporal constraints. In Proceedings of AAAI 2007 Workshop on Spatial and Temporal Reasoning, Vancouver, Canada.
4. Bui, H. H., Tyson, M. & Yorke-Smith, N. 2008. Efficient message passing and propagation of simple temporal constraints: Results on semi-structured networks. In Proceedings of CP/ICAPS'08 Workshop on Constraint Satisfaction for Planning and Scheduling Problems, Sydney, Australia.
5. Castillo, L., Fdez-Olivares, J. & García-Pé rez, F. P. O. 2006. Efficiently handling temporal knowledge in an HTN planner. In Proceedings of ICAPS'06, Cumbria, UK.
6. Choueiry, B. Y. & Wilson, N. 2006. Personal communication.
7. Cormen, T., Leiserson, C. & Rivest, R. 1990. Introduction to Algorithms. McGraw-Hill.
8. Dechter, R. 2003. Constraint Processing. Morgan Kaufmann.
9. Dechter, R., Meiri, I. & Pearl, J. 1991. Temporal constraint networks. Artificial Intelligence 49(1-3), 61-95.
10. Dechter, R. & Pearl, J. 1989. Tree clustering schemes for constraint-processing. Artificial Intelligence 38(3), 353-366.
11. Erol, K., Hendler, J. & Nau, D. 1994. Semantics for Hierarchical Task-network Planning. Technical report CS-TR-3239. University of Maryland.
12. Hunsberger, L. 2008. A practical temporal constraint management system for real-time applications. In Proceedings of ECAI'08, Patras, Greece.
13. Jégou, P., Ndiaye, S. & Terrioux, C. 2005. Computing and exploiting tree-decompositions for solving constraint networks. In Proceedings of CP'05, Sitges, Spain.
14. Jégou, P. & Terrioux, C. 2003. Hybrid backtracking bounded by tree-decomposition of constraint networks. Artificial Intelligence 146(1), 43-75.
15. Khatib, L., Morris, P., Morris, R. A. & Rossi, F. 2001. Temporal constraint reasoning with preferences. In Proceedings of IJCAI'01, Seattle, WA.
16. Kjaerulff, U. 1990. Triangulation of Graphs: Algorithms Giving Small Total State Space. Technical report R90-09. Aalborg University.
17. Laborie, P. & Ghallab, M. 1995. Planning with sharable resource constraints. In Proceedings of IJCAI'95, Montréal, Canada.
18. Larrosa, J., Morancho, E. & Niso, D. 2005. On the practical use of variable elimination in constraint optimization problems: 'still-life' as a case study. Journal of Artificial Intelligence Research 23, 421-440.
19. Myers, K. L., Tyson, M. W., Wolverton, M. J., Jarvis, P. A., Lee, T. J. & desJardins, M. 2002. PASSAT: a user-centric planning framework. In Proceedings of the Third Intl. NASA Workshop on Planning and Scheduling for Space, Houston, TX.
20. Planken, L., de Weerdt, M. & van der Krogt, R. 2008. P3C: a new algorithm for the simple temporal problem. In Proceedings of ICAPS'08, Sydney, Australia.
21. Shi, Y., Lal, A. & Choueiry, B. Y. 2004. Evaluating consistency algorithms for temporal metric constraints. In Proceedings of AAAI-04, San Jose, CA.
22. Smith, D. E., Frank, J. & Jó nsson, A. K. 2000. Bridging the gap between planning and scheduling. Knowledge Engineering Review 15(1), 47-83.
23. Xu, L. & Choueiry, B. Y. 2003. A new efficient algorithm for solving the simple temporal problem. In Proceedings of TIME'03, Cairns, Australia.
24. Yorke-Smith, N. 2005. Exploiting the structure of hierarchical plans in temporal constraint propagation. In Proceedings of AAAI-05, Pittsburgh, PA.