Skip to main content
×
Home
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 1
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Tang, Pan and Shen, Geoffrey Qiping 2015. Decision-making model to generate novel emergency response plans for improving coordination during large-scale emergencies. Knowledge-Based Systems, Vol. 90, p. 111.


    ×

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

  • Neil Yorke-Smith (a1) and Hung H. Bui (a1)
  • DOI: http://dx.doi.org/10.1017/S0269888910000184
  • Published online: 01 September 2010
Abstract
Abstract

The Simple Temporal Network (STN) is a widely used framework for reasoning about quantitative temporal constraints over variables with continuous or discrete domains. The inference tasks of determining consistency and deriving the minimal network are traditionally achieved by graph algorithms (e.g. Floyd-Warshall, Johnson) or by iteration of narrowing operators (e.g. ΔSTP). None of these methods exploits effectively the tree-decomposition structure of the constraint graph of an STN. Methods based on variable elimination (e.g. adaptive consistency) can exploit this structure, but have not been applied to STNs as far as they could, in part because it is unclear how to efficiently pass the ‘messages’ over continuous domains. We show that for an STN, these messages can be represented compactly as sub-STNs. We then present an efficient message-passing scheme for computing the minimal constraints of an STN. Analysis of this algorithm, Prop-STP, brings formal explanation of the performance of the existing STN solvers ΔSTP and SR-PC. Empirical results validate the efficiency of Prop-STP, demonstrating performance comparable to ΔSTP, in cases where the constraint graph is known to have small tree width, such as those that arise during Hierarchical Task Network planning.

Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

R. Dechter 2003. Constraint Processing. Morgan Kaufmann.

R. Dechter , I. Meiri , J. Pearl 1991. Temporal constraint networks. Artificial Intelligence 49(1–3), 6195.

R. Dechter , J. Pearl 1989. Tree clustering schemes for constraint-processing. Artificial Intelligence 38(3), 353366.

P. Jégou , C. Terrioux 2003. Hybrid backtracking bounded by tree-decomposition of constraint networks. Artificial Intelligence 146(1), 4375.

D. E. Smith , J. Frank , A. K. Jónsson 2000. Bridging the gap between planning and scheduling. Knowledge Engineering Review 15(1), 4783.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Knowledge Engineering Review
  • ISSN: 0269-8889
  • EISSN: 1469-8005
  • URL: /core/journals/knowledge-engineering-review
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×