Efficient message passing and propagation of simple temporal constraints: Results on semi-structured networks

COPLAS'08 - International Joint CP/ICAPS Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, Workshop Proceedings

Volumn , Issue , 2008, Pages 38-45

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

^a SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

ALGORITHMS; AUTOMATA THEORY; COMPUTER PROGRAMMING; CONSTRAINT THEORY; FORESTRY;

INFERENCE ENGINES;

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

References (21)

1. C. Bliek and D. Sam-Haroud. Path consistency on triangulated constraint graphs. In Proc. of IJCAI'99, 1999.
2. J. Bresina, A. K. Jónsson, P. Morris, and K. Rajan. Activity planning for the Mars exploration rovers. In Proc. of ICAPS'05, 2005.
3. H. H. Bui, M. Tyson, and N. Yorke-Smith. Efficient message passing and propagation of simple temporal constraints. In Proc. of AAAI 2007 Workshop on Spatial and Temporal Reasoning, 2007.
4. L. Castillo, J. Fdez-Olivares, and F. Palao O. García- Pérez. Efficiently handling temporal knowledge in an HTN planner. In Proc. of ICAPS'06, 2006.
5. B. Y. Choueiry and N. Wilson. Personal communication, February 2006.
6. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. McGraw-Hill, 1990.
7. R. Dechter and J. Pearl. Tree clustering schemes for constraint- processing. Artificial Intelligence, 38(3):353-366, 1989.
8. R. Dechter, I. Meiri, and J. Pearl. Temporal constraint networks. Artificial Intelligence, 49(1-3), 1991.
9. R. Dechter. Constraint Processing. Morgan Kaufmann, 2003.
10. K. Erol, J. Hendler, and D. Nau. Semantics for hierarchical task-network planning. Technical Report CS-TR-3239, University of Maryland, 1994.
11. P. Jégou and C. Terrioux. Hybrid backtracking bounded by tree-decomposition of constraint networks. Artificial Intelligence, 146(1):43-75, 2003.
12. P. Jégou, S. Ndiaye, and C. Terrioux. Computing and exploiting tree-decompositions for solving constraint networks. In Proc. of CP'05, 2005.
13. L. Khatib, P. Morris, R. A. Morris, and F. Rossi. Temporal constraint reasoning with preferences. In Proc. of IJCAI'01, 2001.
14. U. Kjaerulff. Triangulation of graphs: Algorithms giving small total state space. Technical Report R90-09, Aalborg University, Denmark, 1990.
15. P. Laborie and M. Ghallab. Planning with sharable resource constraints. In Proc. of IJCAI'95, 1995.
16. J. Larrosa, E. Morancho, and D. Niso. On the practical use of variable elimination in constraint optimization problems: 'Still-life' as a case study. J. Artificial Intelligence Research, 23:421-440, 2005. (Pubitemid 41525874)
17. K. L. Myers, M. W. Tyson, M. J. Wolverton, P. A. Jarvis, T. J. Lee, and M. desJardins. PASSAT: A user-centric planning framework. In Proc. of the Third Intl. NASA Workshop on Planning and Scheduling for Space, 2002.
18. Y. Shi, A. Lal, and B. Y. Choueiry. Evaluating consistency algorithms for temporal metric constraints. In Proc. of AAAI-04, 2004.
19. D. E. Smith, J. Frank, and A. K. Jónsson. Bridging the gap between planning and scheduling. Knowledge Eng. Review, 15(1):47-83, 2000.
20. L. Xu and B. Y. Choueiry. A new efficient algorithm for solving the simple temporal problem. In Proc. of TIME'03, 2003.
21. N. Yorke-Smith. Exploiting the structure of hierarchical plans in temporal constraint propagation. In Proc. of AAAI-05, 2005.