Conflict-based search for optimal multi-agent pathfinding
type: Item
instance of: scholarly article
title: Conflict-based search for optimal multi-agent pathfinding
zbMATH Open document ID: 1328.68235
author: Guni Sharon
author: Roni Stern
author: Ariel Felner
author: Nathan R. Sturtevant
published in: Artificial Intelligence
publication date: 2015-05-06T00:00:00Z
Mathematics Subject Classification ID: 68T42
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 6433663
zbMATH Keywords: heuristic search
zbMATH Keywords: multi-agent
zbMATH Keywords: pathfinding
MaRDI profile type: Publication
full work available at URL: j.artint.2014.11.006
OpenAlex ID: W1989407213
cites work: Planning as heuristic search
cites work: Generalized best-first search strategies and the optimality of A*
cites work: On multiple moving objects
cites work: Q5715674
cites work: Enhanced Partial Expansion A*
cites work: Asynchronous Distributed Motion Planning with Safety Guarantees under Second-Order Dynamics
cites work: Understanding planning tasks. Domain complexity and heuristic decomposition
cites work: Depth-first iterative-deepening: An optimal admissible tree search
cites work: Q3624124
cites work: The increasing cost tree search for optimal multi-agent pathfinding
cites work: Q3093656
DOI: 10.1016/J.ARTINT.2014.11.006
description: scientific article