Dynamic Controllability and Dispatchability Relationships
From MaRDI portal
Publication:5418749
DOI10.1007/978-3-319-07046-9_33zbMath1407.68460OpenAlexW79599084MaRDI QIDQ5418749
Publication date: 27 May 2014
Published in: Integration of AI and OR Techniques in Constraint Programming (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2060/20140008604
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (9)
Planning and execution with flexible timelines: a formal account ⋮ Dynamic controllability via timed game automata ⋮ Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification ⋮ A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form ⋮ Adding flexibility to uncertainty: flexible simple temporal networks with uncertainty (FTNU) ⋮ Sound-and-Complete Algorithms for Checking the Dynamic Controllability of Conditional Simple Temporal Networks with Uncertainty. ⋮ Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty ⋮ Dynamic controllability of simple temporal networks with uncertainty: simple rules and fast real-time execution ⋮ Efficient execution of dynamically controllable simple temporal networks with uncertainty
This page was built for publication: Dynamic Controllability and Dispatchability Relationships
