A systematic literature review of A* pathfinding

D Foead, A Ghifari, MB Kusuma, N Hanafiah… - Procedia Computer …, 2021 - Elsevier
A* is a search algorithm that has long been used in the pathfinding research community. Its
efficiency, simplicity, and modularity are often highlighted as its strengths compared to other …

[PDF][PDF] A review of rotorcraft unmanned aerial vehicle (UAV) developments and applications in civil engineering

P Liu, AY Chen, YN Huang, JY Han, JS Lai… - Smart Struct …, 2014 - academia.edu
Civil engineers always face the challenge of uncertainty in planning, building, and
maintaining infrastructure. These works rely heavily on a variety of surveying and monitoring …

Multi-agent pathfinding: Definitions, variants, and benchmarks

R Stern, N Sturtevant, A Felner, S Koenig… - Proceedings of the …, 2019 - ojs.aaai.org
The multi-agent pathfinding problem (MAPF) is the fundamental problem of planning paths
for multiple agents, where the key constraint is that the agents will be able to follow these …

[图书][B] Artificial intelligence and games

GN Yannakakis, J Togelius - 2018 - Springer
Georgios N. Yannakakis Julian Togelius Page 1 Artificial Intelligence and Games Georgios N.
Yannakakis Julian Togelius Page 2 Artificial Intelligence and Games Page 3 Georgios N …

[HTML][HTML] Conflict-based search for optimal multi-agent pathfinding

G Sharon, R Stern, A Felner, NR Sturtevant - Artificial intelligence, 2015 - Elsevier
In the multi-agent pathfinding problem (MAPF) we are given a set of agents each with
respective start and goal positions. The task is to find paths for all agents while avoiding …

Searching with consistent prioritization for multi-agent path finding

H Ma, D Harabor, PJ Stuckey, J Li, S Koenig - Proceedings of the AAAI …, 2019 - aaai.org
We study prioritized planning for Multi-Agent Path Finding (MAPF). Existing prioritized MAPF
algorithms depend on rule-of-thumb heuristics and random assignment to determine a fixed …

Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem

M Barer, G Sharon, R Stern, A Felner - Proceedings of the international …, 2014 - ojs.aaai.org
The task in the multi-agent path finding problem (MAPF) is to find paths for multiple agents,
each with a different start and goal position, such that agents do not collide. A successful …

Icbs: The improved conflict-based search algorithm for multi-agent pathfinding

E Boyarski, A Felner, R Stern, G Sharon… - Proceedings of the …, 2015 - ojs.aaai.org
Abstract Conflict-Based Search (CBS) and its generalization, Meta-Agent CBS are amongst
the strongest newly introduced algorithms for Multi-Agent Path Finding. This paper …

Search-based optimal solvers for the multi-agent pathfinding problem: Summary and challenges

A Felner, R Stern, S Shimony, E Boyarski… - Proceedings of the …, 2017 - ojs.aaai.org
Multi-agent pathfinding (MAPF) is an area of expanding research interest. At the core of this
research area, numerous diverse search-based techniques were developed in the past 6 …

A survey of real-time strategy game AI research and competition in StarCraft

S Ontanón, G Synnaeve, A Uriarte… - … Intelligence and AI …, 2013 - ieeexplore.ieee.org
This paper presents an overview of the existing work on AI for real-time strategy (RTS)
games. Specifically, we focus on the work around the game StarCraft, which has emerged in …