Incremental heuristic search methods use heuristics to focus their search and reuse
information from previous searches to find solutions to series of similar search tasks much …

Heuristic search methods promise to find shortest paths for path-planning problems faster
than uninformed search methods. Incremental search methods, on the other hand, promise …

Mobile robots often operate in domains that are only incompletely known, for example, when
they have to move from given start coordinates to given goal coordinates in unknown terrain …

Algorithms for route planning in transportation networks have recently undergone a rapid
development, leading to methods that are up to three million times faster than Dijkstra's …

We study novel combinatorial properties of graphs that allow us to devise a completely new
approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynamic …

Mobile robots often operate in domains that are only incompletely known, for example, when
they have to move from given start coordinates to given goal coordinates in unknown terrain …

We present lower bound tree-RRT (LBT-RRT), a single-query sampling-based motion-
planning algorithm that is asymptotically near-optimal. Namely, the solution extracted from …

Asymptotically-optimal sampling-based motion planners, like RRT*, perform vast amounts of
collision checking, and are hence rather slow to converge in complex problems where …

Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …

In this paper, we study the feasibility of sending drones to deliver goods from a depot to a
customer by solving what we call the Mission-Feasibility Problem (MFP). Due to payload …