Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
A Structural Characterization of Temporal Dynamic Controllability
verfasst von : Paul Morris
Erschienen in: Principles and Practice of Constraint Programming - CP 2006
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
An important issue for temporal planners is the ability to handle temporal uncertainty. Recent papers have addressed the question of how to tell whether a temporal network is
Dynamically Controllable
, i.e., whether the temporal requirements are feasible in the light of uncertain durations of some processes. Previous work has presented an
O
(
N
5
) algorithm for testing this property. Here, we introduce a new analysis of temporal cycles that leads to an
O
(
N
4
) algorithm.