scholarly journals Iterative-Deepening Conflict-Based Search

2020 ◽  
Author(s):  
Eli Boyarski ◽  
Ariel Felner ◽  
Daniel Harabor ◽  
Peter J. Stuckey ◽  
Liron Cohen ◽  
...  
Keyword(s):  
Path Finding ◽  
Time Limits ◽  
Incremental Methods ◽  
Multi Agent ◽  
Do So

Conflict-Based Search (CBS) is a leading algorithm for optimal Multi-Agent Path Finding (MAPF). CBS variants typically compute MAPF solutions using some form of A* search. However, they often do so under strict time limits so as to avoid exhausting the available memory. In this paper, we present IDCBS, an iterative-deepening variant of CBS which can be executed without exhausting the memory and without strict time limits. IDCBS can be substantially faster than CBS due to incremental methods that it uses when processing CBS nodes.

scholarly journals Multi-Agent Path Finding with Deadlines

2018 ◽  
Author(s):  
Hang Ma ◽  
Glenn Wagner ◽  
Ariel Felner ◽  
Jiaoyang Li ◽  
T. K. Satish Kumar ◽  
...  
Keyword(s):  
Flow Problem ◽  
Search Algorithms ◽  
The Other ◽  
Path Finding ◽  
Combinatorial Search ◽  
Programming Formulation ◽  
Commodity Flow ◽  
Linear Programming Formulation ◽  
Multi Agent ◽  
Integer Linear Programming Formulation

We formalize Multi-Agent Path Finding with Deadlines (MAPF-DL). The objective is to maximize the number of agents that can reach their given goal vertices from their given start vertices within the deadline, without colliding with each other. We first show that MAPF-DL is NP-hard to solve optimally. We then present two classes of optimal algorithms, one based on a reduction of MAPF-DL to a flow problem and a subsequent compact integer linear programming formulation of the resulting reduced abstracted multi-commodity flow network and the other one based on novel combinatorial search algorithms. Our empirical results demonstrate that these MAPF-DL solvers scale well and each one dominates the other ones in different scenarios.

Following Gesture Following: Grounding the Documentation of a Multi-Agent Music Creation Process

2012 ◽  
Vol 36 (4) ◽  
pp. 59-80 ◽  
Author(s):  
Guillaume Boutard ◽  
Catherine Guastavino
Keyword(s):  
Conceptual Framework ◽  
Creative Process ◽  
Relevant Information ◽  
Musical Work ◽  
Levels Of Abstraction ◽  
Musical Works ◽  
Multi Agent ◽  
Ethnographic Data ◽  
Different Levels ◽  
Do So

The documentation of electroacoustic and mixed musical works typically relies on a posteriori data collection. In this article, we argue that the preservation of musical works having technological components should be grounded in a thorough documentation of the creative process that accounts for both human and nonhuman agents of creation. The present research aims at providing a ground for documentation policies that account for the creative process and provide relevant information for performance, migration, and analysis. To do so, we analyzed secondary ethnographic data from a two-year creation and production process of a musical work having a focus on gesture following. Using grounded theory, we developed a conceptual framework with different levels of abstraction and consequent levels of transferability to other creative contexts. Finally, we propose several paths for grounding a subsequent documentation framework in this conceptual framework.

A Decentralized Token-Based Negotiation Approach for Multi-Agent Path Finding

2021 ◽  
pp. 264-280
Author(s):  
Cihan Eran ◽  
M. Onur Keskin ◽  
Furkan Cantürk ◽  
Reyhan Aydoğan
Keyword(s):  
Path Finding ◽  
Multi Agent

Train Route Planning as a Multi-agent Path Finding Problem

2021 ◽  
pp. 237-246
Author(s):  
Mauricio Salerno ◽  
Yolanda E-Martín ◽  
Raquel Fuentetaja ◽  
Alba Gragera ◽  
Alberto Pozanco ◽  
...  
Keyword(s):  
Route Planning ◽  
Path Finding ◽  
Multi Agent
Sign in / Sign up

Export Citation Format

Share Document