Multi-agent path planning is a challenging problem with numerous real-life applications.
Running a centralized search such as A* in the combined state space of all units is complete …

One of the field in which models of abstraction have been proposed is Artificial Intelligence
(AI). This chapter has two parts: one presents an overview of the formal models, either …

This volume presents novel computational models for representing digital humans and their
interactions with other virtual characters and meaningful environments. In this context, we …

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 …

Incremental search algorithms, such as Generalized Fringe-Retrieving A* and D* Lite, reuse
search trees from previous searches to speed up the current search and thus often find cost …

The problem of path-finding has to be solved in transportation, city planning, commercial
computer games, navigation and many other fields. How to find the shortest path is the key …

Path planning quickly becomes computationally hard as the dimensionality of the state-
space increases. In this paper, we present a planning algorithm intended to speed up path …

This paper presents a real-time planning framework for multi-character navigation that
enables the use of multiple heterogeneous problem domains of differing complexities for …

Real-time heuristic search algorithms are used for planning by agents in situations where a
constantbounded amount of deliberation time is required for each action regardless of the …

Path planning is a central topic in games and other research areas, such as robotics.
Despite this, very little research addresses problems involving agents with multiple sizes …