With the advance of the geo-positioning technology, the terrain surface data has become
increasingly popular and has drawn much research attention from both academia and …

Finding shortest paths in a Euclidean plane containing polygonal obstacles is a well-studied
problem motivated by a variety of real-world applications. The state-of-the-art algorithms …

We consider optimal and suboptimal algorithms for the Euclidean Shortest Path Problem
(ESPP) in two dimensions. For optimal path planning, Our approach leverages ideas from …

Alternative pathfinding requires finding a set of k alternative paths (including the shortest
path) between a given source s and a target t. Intuitively, these paths should be significantly …

Abstract Compressed Path Databases (CPD) are powerful database-driven methods for
shortest path extraction in grids and in spatial networks. Yet CPDs have two main …

Abstract Mobility as a Service (MaaS) is a term coined for the development and
implementation of multi-modal trip planner recommendation systems. Multi-modal journeys …

Video games feature a dynamic environment where locations of objects (eg, characters,
equipment, weapons, vehicles etc.) frequently change within the game world. Although …

Computing time-optimal shortest paths, in road networks, is one of the most popular
applications of Artificial Intelligence. This problem is tricky to solve because road congestion …

Safety on the roads has become a major concern in recent days. Travellers prefer to avoid
road inconveniences that may occur from crime incidents, street harassment, protests or riots …

Grid-based path planning is one of the classic problems in AI, and a popular topic in
application areas such as computer games and robotics. Compressed Path Databases …