Efficient execution of dynamically controllable simple temporal networks with uncertainty
From MaRDI portal
Recommendations
- Dynamic controllability of simple temporal networks with uncertainty: simple rules and fast real-time execution
- Dynamic controllability made simple
- Faster dynamic controllability checking for simple temporal networks with uncertainty
- Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification
- Sound-and-complete algorithms for checking the dynamic controllability of conditional simple temporal networks with uncertainty
Cites work
- scientific article; zbMATH DE number 5547866 (Why is no real title available?)
- scientific article; zbMATH DE number 2088162 (Why is no real title available?)
- CTP: A new constraint-based formalism for conditional, temporal planning
- Drake: an efficient executive for temporal plans with choice
- Dynamic controllability and dispatchability relationships
- Dynamic controllability via timed game automata
- Efficient execution of dynamically controllable simple temporal networks with uncertainty
- Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification
- Handling contingency in temporal constraint networks: from consistency to controllabilities
- Introduction to algorithms.
- Temporal constraint networks
Cited in
(11)- Quantifying controllability in temporal networks with uncertainty
- A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form
- Dynamic controllability made simple
- Dynamic controllability of temporal plans in uncertain and partially observable environments
- Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification
- Faster dynamic controllability checking for 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
- Sound-and-complete algorithms for checking the dynamic controllability of conditional simple temporal networks with uncertainty
- Efficient execution of dynamically controllable simple temporal networks with uncertainty
- Adding flexibility to uncertainty: flexible simple temporal networks with uncertainty (FTNU)
This page was built for publication: Efficient execution of dynamically controllable simple temporal networks with uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q262129)
