A Multi-Agent Path Finding (MAPF) problem involves multiple agents who want to reach their
destinations without obstructing other agents. Although a MAPF problem needs to be solved …

Landmarks play a vital role in human wayfinding by providing the structure for mental spatial
representations and indicating locations with which to orient. Less research effort has been …

One of the main challenges in video games is to compute paths as efficiently as possible for
groups of agents. As both the size of the environments and the number of autonomous …

Pathfinding problems often have to be solved under many constraints including limited
processing time, memory, and computational power. The challenges become bigger as the …

The subject of this paper is the AvatarTraffic simulator–a computer system capable of
modelling in real time environments such as subway stations or airport halls populated with …

The paper presents a simulator of the behavior of people or their groups moving within a
specific 3D scene, prepared for modeling diverse sequences of events-scenarios-that may …

Based on trajectory planning with maximum velocity and acceleration constraints, a novel
high-quality trajectory planning method was proposed for heterogeneous individuals in …

Pathfinding for autonomous agents and robots has been traditionally driven by finding
optimal paths. Where typically optimality means finding the shortest path between two points …

Pathfinding is a popular computer science problem in both academic research and industrial
development. The objective of pathfinding is to search for a path, often the shortest path …

Mechanics and systems for assisting players can be found in many modern video games. In
racing games, examples of assistances are assistance systems for braking or accelerating …