The computational complexity of multi-agent pathfinding on directed graphs

Artificial Intelligence 328 (C):104063 (2024)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2023.104063

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,283

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The architecture of complexity: A new blueprint.Peter Turney - 1989 - Synthese 79 (3):515 - 542.
Linguistic Graphs and their Applications.W. B. Vasantha Kandasamy, K. Ilanthenral & Florentin Smarandache - 2022 - Miami, FL, USA: Global Knowledge.
Multi-agent pathfinding with continuous time.Anton Andreychuk, Konstantin Yakovlev, Pavel Surynek, Dor Atzmon & Roni Stern - 2022 - Artificial Intelligence 305 (C):103662.
Conflict-based search for optimal multi-agent pathfinding.Guni Sharon, Roni Stern, Ariel Felner & Nathan R. Sturtevant - 2015 - Artificial Intelligence 219 (C):40-66.
Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language.Jakub Szymanik - 2010 - Linguistics and Philosophy 33 (3):215-250.
Complexity of networks II: The set complexity of edge‐colored graphs.Tomasz M. Ignac, Nikita A. Sakhanenko & David J. Galas - 2012 - Complexity 17 (5):23-36.
The increasing cost tree search for optimal multi-agent pathfinding.Guni Sharon, Roni Stern, Meir Goldenberg & Ariel Felner - 2013 - Artificial Intelligence 195 (C):470-495.
On complexity of verification of interacting agents' behavior.Michael Dekhtyar, Alexander Dikovsky & Mars Valiev - 2006 - Annals of Pure and Applied Logic 141 (3):336-362.
A Paraconsistent Multi-agent Framework for Dealing with Normative Conflicts.Mathieu Beirlaen & Christian Straßer - 2011 - In Joao Leite, Paolo Torroni, Thomas Agotnes, Guido Boella & Leon van der Torre (eds.), Computational Logic in Multi-Agent Systems. CLIMA 2011. Lecture Notes in Computer Science, vol 6814. Springer. pp. 312–329.
Computing the Weighted Isolated Scattering Number of Interval Graphs in Polynomial Time.Fengwei Li, Xiaoyan Zhang, Qingfang Ye & Yuefang Sun - 2019 - Complexity 2019:1-8.
Spectral Complexity of Directed Graphs and Application to Structural Decomposition.Igor Mezić, Vladimir A. Fonoberov, Maria Fonoberova & Tuhin Sahai - 2019 - Complexity 2019:1-18.
On Qualitative Route Descriptions: Representation, Agent Models, and Computational Complexity.Matthias Westphal, Stefan Wölfl, Bernhard Nebel & Jochen Renz - 2015 - Journal of Philosophical Logic 44 (2):177-201.
Reachability is harder for directed than for undirected finite graphs.Miklos Ajtai & Ronald Fagin - 1990 - Journal of Symbolic Logic 55 (1):113-150.
Complexity of networks I: The set‐complexity of binary graphs.Nikita A. Sakhanenko & David J. Galas - 2011 - Complexity 17 (2):51-64.
Betweenness centrality measures for directed graphs.D. R. White & S. P. Borgatti - unknown

Analytics

Added to PP
2024-01-09

Downloads
6 (#1,465,900)

6 months
6 (#530,265)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Will Mathematics Ultimately Describe Nature?James R. Johnson - 2019 - Философия И Космология 23:22-29.

Add more references