Complexity of planning for connected agents in a partially known environment

DOI10.1016/j.tcs.2022.11.015OpenAlexW4310059413MaRDI QIDQ2680862

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

zbMATH Keywords

connectivityimperfect knowledgedecentralized planningmulti-agent planningmulti-agent path finding

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Shortest paths without a map
• The computational complexity of propositional STRIPS planning
• Conflict-based search for optimal multi-agent pathfinding
• On the online multi-agent O-D \(k\)-Canadian traveler problem
• Relationships between nondeterministic and deterministic tape complexities
• A Concise Introduction to Decentralized POMDPs
• The k-Canadian Travelers Problem with Communication
• Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity
• Alternation
• Algorithms for Omega-Regular Games with Imperfect Information
• The Complexity of Decentralized Control of Markov Decision Processes
• Lower bounds for multiplayer noncooperative games of incomplete information

This page was built for publication: Complexity of planning for connected agents in a partially known environment