Embeddings and labeling schemes for A*

11/19/2021
by   Talya Eden, et al.
1

A* is a classic and popular method for graphs search and path finding. It assumes the existence of a heuristic function h(u,t) that estimates the shortest distance from any input node u to the destination t. Traditionally, heuristics have been handcrafted by domain experts. However, over the last few years, there has been a growing interest in learning heuristic functions. Such learned heuristics estimate the distance between given nodes based on "features" of those nodes. In this paper we formalize and initiate the study of such feature-based heuristics. In particular, we consider heuristics induced by norm embeddings and distance labeling schemes, and provide lower bounds for the tradeoffs between the number of dimensions or bits used to represent each graph node, and the running time of the A* algorithm. We also show that, under natural assumptions, our lower bounds are almost optimal.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/27/2018

Distance and routing labeling schemes for cube-free median graphs

Distance labeling schemes are schemes that label the vertices of a graph...
research
04/11/2022

Learning heuristics for A*

Path finding in graphs is one of the most studied classes of problems in...
research
06/08/2017

The FastMap Algorithm for Shortest Path Computations

We present a new preprocessing algorithm for embedding the nodes of a gi...
research
02/19/2019

Hardness of exact distance queries in sparse graphs through hub labeling

A distance labeling scheme is an assignment of bit-labels to the vertice...
research
09/29/2011

Multiple-Goal Heuristic Search

This paper presents a new framework for anytime heuristic search where t...
research
01/21/2020

Closed form distance formula for the balanced multiple travelling salesmen

As a first contribution the mTSP is solved using an exact method and two...
research
12/07/2022

Learning Graph Search Heuristics

Searching for a path between two nodes in a graph is one of the most wel...

Please sign up or login with your details

Forgot password? Click here to reset