Complexity of planning for connected agents in a partially known environment
From MaRDI portal
Publication:2680862
DOI10.1016/J.TCS.2022.11.015OpenAlexW4310059413MaRDI QIDQ2680862FDOQ2680862
Authors: Arthur Queffelec, Ocan Sankur, François Schwarzentruber 
Publication date: 4 January 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.11.015
Recommendations
- The computational complexity of multi-agent pathfinding on directed graphs
- Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity
- Multi-agent pathfinding with \(n\) agents on graphs with \(n\) vertices: combinatorial classification and tight algorithmic bounds
- Verification of agent navigation in partially-known environments
- Constrained motion planning and multi-agent path finding on directed graphs
Cites Work
- The Complexity of Decentralized Control of Markov Decision Processes
- Relationships between nondeterministic and deterministic tape complexities
- The computational complexity of propositional STRIPS planning
- Alternation
- Lower bounds for multiplayer noncooperative games of incomplete information
- Shortest paths without a map
- Title not available (Why is that?)
- Conflict-based search for optimal multi-agent pathfinding
- Algorithms for Omega-Regular Games with Imperfect Information
- Title not available (Why is that?)
- On the online multi-agent O-D \(k\)-Canadian traveler problem
- A concise introduction to decentralized POMDPs
- Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity
- The \(k\)-Canadian travelers problem with communication
Cited In (1)
This page was built for publication: Complexity of planning for connected agents in a partially known environment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2680862)
