Efficient message passing and propagation of simple temporal constraints

AAAI Workshop - Technical Report

Volumn WS-07-12, Issue , 2007, Pages 9-15

  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 GRAPHS; CONSTRAINT NETWORKS; CONTINUOUS DOMAINS; DISCRETE DOMAINS; EMPIRICAL RESULTS; FRAME-WORK; GRAPH ALGORITHMS; HIERARCHICAL TASK NETWORK; NEW ALGORITHM; TECHNICAL REPORTS; TEMPORAL CONSTRAINTS; TEMPORAL REASONING; TREE-DECOMPOSITION; TREE-WIDTH; VARIABLE ELIMINATION;

GRAPH THEORY; ITERATIVE METHODS; TREES (MATHEMATICS);

MESSAGE PASSING;

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

References (14)

1. Bliek, C., and Sam-Haroud, D. 1999. Path consistency on triangulated constraint graphs. In Proc. of IJCAI'99.
2. Castillo, L.; Fdez-Olivares, J.; and O. García-Pérez, F. P. 2006. Efficiently handling temporal knowledge in an HTN planner. In Proc. of ICAPS'06.
3. Choueiry, B. Y., and Wilson, N. 2006. Personal communication.
4. Cormen, T.; Leiserson, C.; and Rivest, R. 1990. Introduction to Algorithms. McGraw-Hill.
5. Dechter, R., and Pearl, J. 1989. Tree clustering schemes for constraint-processing. Artificial Intelligence 38(3):353-366.
6. Dechter, R.; Meiri, I.; and Pearl, J. 1991. Temporal constraint networks. Artificial Intelligence 49(1-3).
7. Dechter, R. 2003. Constraint Processing. Morgan Kaufmann.
8. Erol, K.; Hendler, J.; and Nau, D. 1994. Semantics for hierarchical task-network planning. Technical Report CS-TR-3239, University of Maryland.
9. Kjaerulff, U. 1990. Triangulation of graphs - Algorithms giving small total state space. Technical Report R90-09, Department of Mathematics and Computer Science, Aalborg University, Denmark.
10. Myers, K. L.; Tyson, M. W.; Wolverton, M. J.; Jarvis, P. A.; Lee, T. J.; and desJardins, M. 2002. PASSAT: A user-centric planning framework. In Proc. of the Third Intl. NASA Workshop on Planning and Scheduling for Space.
11. Shi, Y.; Lal, A.; and Choueiry, B. Y. 2004. Evaluating consistency algorithms for temporal metric constraints. In Proc. of AAAI-04.
12. Smith, D. E.; Frank, J.; and Jónsson, A. K. 2000. Bridging the gap between planning and scheduling. Knowledge Eng. Review 15(1).
13. Xu, L., and Choueiry, B. Y. 2003. A new efficient algorithm for solving the simple temporal problem. In Proc. of TIME'03.
14. Yorke-Smith, N. 2005. Exploiting the structure of hierarchical plans in temporal constraint propagation. In Proc. of AAAI-05.