Name
Abstract | ||
|---|---|---|
Temporal network formalisms allow us to encode a set of constraints relating distinct events in time, and by deploying algorithms over these networks, we can determine whether schedules for these networks exist that satisfy all constraints. By augmenting simple temporal networks, we can consider the effects that disjunctive constraints, temporal uncertainty, and coordinating agents have on modeling fidelity and the algorithmic efficiency of schedule construction. In this paper, we introduce Partially Observable Disjunctive Temporal Networks with Uncertainty (PODTNUs) and Multiagent Disjunctive Temporal Networks with Uncertainty (MaDTNUs), generalizing previously studied multi-agent variants of temporal networks. We provide the first theoretical completeness results for the controllability of multiagent temporal network structures and discuss the importance of these results for modelers. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.5555/3306127.3331727 | adaptive agents and multi-agents systems |
Keywords | Field | DocType |
Single and multiagent planning and scheduling,Coordination and control models for multiagent systems | ENCODE,Fidelity,Algorithmic efficiency,Controllability,Computer science,Generalization,Theoretical computer science,Schedule,Rotation formalisms in three dimensions,Completeness (statistics),Distributed computing | Conference |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nikhil Bhargava | 1 | 1 | 1.71 |
| B C Williams | 2 | 2404 | 426.13 |