In this work we give a first tractability analysis of Compressed Path Databases, space
efficient oracles used to very quickly identify the first arc on a shortest path. We study the …

Path finding is one of the main challenges in the artificial intelligence system of game. Path
finding is an expensive operation with large memory consumption; hence, it is not efficient in …

The application of graphs in navigation technology has opened the door for the
development of applications capable of providing efficient and optimal route …

In at least one embodiment, a method and a system for determining a set of plans that best
match a set of preferences. The method may include receiving into a goal specification …

Thanks to the ubiquitous access to the Internet, on-demand ride-sharing service has
emerged to provide timely and convenient rides to passengers. Ride-sharing creates a win …

Path planning on gridmap is a hot issue in the field of artificial intelligence. As an important
gridmap path planning algorithm, CPDs (Compressed Path Databases) are widely used in …

In this thesis, we study the journey planning problem in the context of transit networks. Given
the timetable of a schedule-based transportation system (consisting, eg, of trains, buses …