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 …
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
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 …
maintaining infrastructure. These works rely heavily on a variety of surveying and monitoring …
Multi-agent pathfinding: Definitions, variants, and benchmarks
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 …
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 …
Yannakakis Julian Togelius Page 2 Artificial Intelligence and Games Page 3 Georgios N …
[HTML][HTML] Conflict-based search for optimal multi-agent pathfinding
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 …
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
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 …
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
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 …
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
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 …
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
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 …
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
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 …
games. Specifically, we focus on the work around the game StarCraft, which has emerged in …