The FastMap Algorithm for Shortest Path Computations

  title={The FastMap Algorithm for Shortest Path Computations},
  author={Liron Cohen and Tansel Uras and Shiva Jahangiri and Aliyah Arunasalam and Sven Koenig and T. K. Satish Kumar},
We present a new preprocessing algorithm for embedding the nodes of a given edge-weighted undirected graph into a Euclidean space. The Euclidean distance between any two nodes in this space approximates the length of the shortest path between them in the given graph. Later, at runtime, a shortest path between any two nodes can be computed with an A* search using the Euclidean distances as heuristic. Our preprocessing algorithm, called FastMap, is inspired by the data-mining algorithm of the… 

Figures and Tables from this paper

Using FastMap to Solve Graph Problems in a Euclidean Space
A nearlinear time algorithm, called FastMap, that embeds a given non-negative edge-weighted undirected graph in a Euclidean space and approximately preserves the pairwise shortest path distances between vertices is studied.
Efficient Fastest-Path Computations in Road Maps
A simple, but very effective, heuristic function based on a small number of values assigned to each graph vertex which can reduce the number of vertices traversed by an order of magnitude when used in the A* algorithm.
Speeding up FastMap for Pathfinding on Grid Maps
A new variant of FastMap called FastMap with SPFA (FMS) is presented, which can be implemented in an easy way and its preprocessing time is less than the original version.
Online Landmark-Based Batch Processing of Shortest Path Queries
It is shown how preprocessing can be avoided entirely by integrating the computation of landmark distances into query processing and the techniques outperform the state of the art on both spatial and non-spatial graphs.
Embedding Directed Graphs in Potential Fields Using FastMap-D
This paper presents FastMap-D, an efficient generalization of FastMap to directed graphs that embeds vertices using a potential field to capture the asymmetry between the pairwise distances in directed graphs.
A Fast and Tight Heuristic for A* in Road Networks
An algorithm to efficiently extract distance estimates for A* from Contraction Hierarchies (CH), a hierarchical technique called CH-Potentials, which allows decoupling the supported extensions from the hierarchical speedup technique.
Hierarchical Graph Traversal for Aggregate k Nearest Neighbors Search in Road Networks
A natural extension of the kNN query for multiple agents, namely, the Aggregate k Nearest Neighbors (AkNN) query, is studied and a novel data structure COLT (Compacted Object-Landmark Tree) is proposed which enables efficient hierarchical graph traversal and utilization of AkNN queries.
Evolving Initial Heuristic Functions for Agent-Centered Heuristic Search
  • V. Bulitko
  • Computer Science, Business
    2020 IEEE Conference on Games (CoG)
  • 2020
This paper proposes and proposes and evaluates automatically searching the space of heuristic functions, and develops an insight on how formula-based heuristics are able to exploit characteristics of certain pathfinding maps.
Fast Synthesis of Algebraic Heuristic Functions for Video-game Pathfinding
This work attempts to combine the best of both approaches by automatically synthesizing well performing pathfinding-specific yet compact and human-readable heuristics by defining a space of algebraic formulae expressing heuristic functions and then conducting an automated search of the space.
The Closed List is an Obstacle Too
This paper introduces an enhancement to A* (called BOXA*) on grids which does not need any preprocessing and only needs negligible additional memory to treat the closedlist as a dynamic obstacle.


Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
CHs can be combined with many other route planning techniques, leading to improved performance for many-to-many routing, transit-node routing, goal-directed routing or mobile and dynamic scenarios, and a hierarchical query algorithm using bidirectional shortest-path search is obtained.
Near Optimal Hierarchical Path-Finding
HPA* (Hierarchical Path-Finding A*), a hierarchical approach for reducing problem complexity in path-finding on grid-based maps, which abstracts a map into linked local clusters and works very well in domains with a dynamically changing environment.
Compressing Optimal Paths with Run Length Encoding
A novel approach to Compressed Path Databases, space efficient oracles used to very quickly identify the first edge on a shortest path, being significantly faster than state-of-the-art first-move oracles from the literature is introduced.
Identifying Hierarchies for Fast Optimal Search
This paper generalizes the partitioning process to any undirected graph and shows that it can be recursively applied to generate more than two levels, which reduces the size of the graph being searched even further.
A note on two problems in connexion with graphs
  • E. Dijkstra
  • Mathematics, Computer Science
    Numerische Mathematik
  • 1959
A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets
A fast algorithm to map objects into points in some k-dimensional space (k is user-defined), such that the dis-similarities are preserved, and this method is introduced from pattern recognition, namely, Multi-Dimensional Scaling (MDS).
Optimizations of data structures, heuristics and algorithms for path-finding on maps
  • T. Cazenave
  • Computer Science
    2006 IEEE Symposium on Computational Intelligence and Games
  • 2006
The best optimal pathfinder can be up to seven times faster than the commonly used pathfinders as shown by experimental results and some optimizations of A and IDA* for pathfinding on maps are presented.
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
How heuristic information from the problem domain can be incorporated into a formal mathematical theory of graph searching is described and an optimality property of a class of search strategies is demonstrated.
Contraction Hierarchies on Grid Graphs
This paper shows that contraction hierarchies can be applied to grid graphs as well, and points out interesting connections to speed-up techniques shaped for routing on grids, like swamp hierarchies and jump points, and provides experimental results for game maps, mazes, random grids and rooms.
Path Planning with Compressed All-Pairs Shortest Paths Data
Part of the ideas have been integrated in the Copa CPD system, one of the two best optimal participants in the grid-based path planning competition GPPC.