Dynamic controllability and dispatchability relationships

DOI10.1007/978-3-319-07046-9_33MaRDI QIDQ5418749zbMATH OpenOpenAlexFDO

Authors Paul H. Morris

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms (68W40)

Recommendations

• Handling contingency in temporal constraint networks: from consistency to controllabilities
• Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty
• Dynamic controllability via timed game automata
• Quantifying controllability in temporal networks with uncertainty
• Dynamic controllability of controllable conditional temporal problems with uncertainty

Cited in

(14)

• Dynamic control of a tandem system with abandonments
• 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
• 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
• Handling contingency in temporal constraint networks: from consistency to controllabilities
• Sound-and-complete algorithms for checking the dynamic controllability of conditional simple temporal networks with uncertainty
• A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form
• Adding flexibility to uncertainty: flexible simple temporal networks with uncertainty (FTNU)
• Modeling oracles in simple temporal networks with uncertainty
• Recent algorithmic advances in simple temporal networks with uncertainty: from faster controllability checking to faster execution
• Supporting dispatchability in schedules with consumable resources

This page was built for publication: Dynamic controllability and dispatchability relationships

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5418749)