Efficient execution of dynamically controllable simple temporal networks with uncertainty

DOI10.1007/s00236-015-0227-0zbMath1336.68250OpenAlexW2012801949MaRDI QIDQ262129

Luke Hunsberger

Publication date: 29 March 2016

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-015-0227-0

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Reasoning under uncertainty in the context of artificial intelligence (68T37) Data structures (68P05)

Related Items (4)

Adding flexibility to uncertainty: flexible simple temporal networks with uncertainty (FTNU) ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient execution of dynamically controllable simple temporal networks with uncertainty
• Dynamic controllability via timed game automata
• Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification
• Temporal constraint networks
• CTP: A new constraint-based formalism for conditional, temporal planning
• Handling contingency in temporal constraint networks: from consistency to controllabilities
• Dynamic Controllability and Dispatchability Relationships

This page was built for publication: Efficient execution of dynamically controllable simple temporal networks with uncertainty