This paper provides a performance comparison of different pathfinding Algorithms used in
video games. The Algorithms have been classified into three categories: informed …

The study of algorithms on grids has been widespread in a number of research areas. Grids
are easy to implement and offer fast memory access. Because of their simplicity, they are …

In the recent decades an impressive progress was done in automation and robotic fields.
Projects such as Google driverless car with “sense and avoid” capabilities or intelligent …

Pathfinding has been one of major research areas in video games for many years. It is a key
problem that most of the video games are confronted with. Search algorithms such as the A …

This volume covers both the art and the technology of game AI. It includes core algorithms
that you'll need to succeed, such as behavior trees, utility theory, spatial representation, path …

In this paper we present a method for abstracting an environment represented using
constrained Delaunay triangulations in a way that significantly reduces pathfinding search …

Multi-agent path planning has been shown to be a PSPACE-hard problem. Running a
complete search such as A* at the global level is often intractable in practice, since both the …

Commercial games can be an excellent testbed to artificial intelligence (AI) research, being
a middle ground between synthetic, highly abstracted academic benchmarks, and more …

This paper proposes a new flight path planning algorithm that finds collision-free,
optimal/near-optimal and flyable paths for unmanned aerial vehicles (UAVs) in three …

In many scenarios, quickly solving a relatively small search problem with an arbitrary start
and arbitrary goal state is important (eg, GPS navigation). In order to speed this process, we …