Using fastmap to solve graph problems in a euclidean space

Jiaoyang Li, Ariel Felner, Sven Koenig, T. K. Satish Kumar

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

Abstract

It is well known that many graph problems, like the Traveling Salesman Problem, are easier to solve in a Euclidean space. This motivates the idea of quickly preprocessing a given graph by embedding it in a Euclidean space to solve graph problems efficiently. In this paper, we study 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. The Euclidean space can then be used either for heuristic guidance of A∗ (as suggested previously) or for geometric interpretations that facilitate the application of techniques from analytical geometry. We present a new variant of FastMap and compare it with the original variant theoretically and empirically. We demonstrate its usefulness for solving a path-finding and a multi-agent meeting problem.

Original languageEnglish
Title of host publicationProceedings of the 29th International Conference on Automated Planning and Scheduling, ICAPS 2019
EditorsJ. Benton, Nir Lipovetzky, Eva Onaindia, David E. Smith, Siddharth Srivastava
PublisherAAAI press
Pages273-278
Number of pages6
ISBN (Electronic)9781577358077
StatePublished - 1 Jan 2019
Event29th International Conference on Automated Planning and Scheduling, ICAPS 2019 - Berkeley, United States
Duration: 11 Jul 201915 Jul 2019

Publication series

NameProceedings International Conference on Automated Planning and Scheduling, ICAPS
ISSN (Print)2334-0835
ISSN (Electronic)2334-0843

Conference

Conference29th International Conference on Automated Planning and Scheduling, ICAPS 2019
Country/TerritoryUnited States
CityBerkeley
Period11/07/1915/07/19

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Science Applications
  • Information Systems and Management

Fingerprint

Dive into the research topics of 'Using fastmap to solve graph problems in a euclidean space'. Together they form a unique fingerprint.

Cite this