Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 5 of 5 for “"Simple Temporal Networks"”.
-
Safe distributed coordination of heterogeneous robots through dynamic simple temporal networks
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2003.
-
Complexity in Infinite Games on Graphs and Temporal Constraint Networks
… of algorithmic problems motivated by automated temporal planning and formal verification of reactive and finite state systems. Particularly, we shall focus on game theoretical methods in order to obtain improved complexity bounds and faster algorithms for the following models: Hyper Temporal …
-
Managing temporal uncertainty under limited communication : a formal model of tight and loose team coordination
… of autonomous robots will cooperate in large networks in order to achieve a common goal. These multi-agent systems will need to be able to execute cooperative temporal plans in the presence of temporal uncertainty and communication limitations. The duration of many planned activities will not …
-
Decentralized Allocation of Tasks with Temporal and Precedence Constraints to a Team of Robots
… multi-robot task allocation problems with temporal and precedence constraints. To address this class of problems, we employ decentralized algorithms to find approximate solutions that minimize the maximum time needed to complete all tasks. To achieve decentralization, we use auction-based …
-
Robust planning and scheduling using column generation
… Strong Controllability (SC). SC of Probabilistic Simple Temporal Networks (PSTN) involves finding a schedule to execute a sequence of actions that maximises the probability that all constraints are satisfied (robustness). Previous approaches to this problem assume independence of probabilistic …