Graph Searching with Predictions

by   Siddhartha Banerjee, et al.

Consider an agent exploring an unknown graph in search of some goal state. As it walks around the graph, it learns the nodes and their neighbors. The agent only knows where the goal state is when it reaches it. How do we reach this goal while moving only a small distance? This problem seems hopeless, even on trees of bounded degree, unless we give the agent some help. This setting with ”help” often arises in exploring large search spaces (e.g., huge game trees) where we assume access to some score/quality function for each node, which we use to guide us towards the goal. In our case, we assume the help comes in the form of distance predictions: each node v provides a prediction f(v) of its distance to the goal vertex. Naturally if these predictions are correct, we can reach the goal along a shortest path. What if the predictions are unreliable and some of them are erroneous? Can we get an algorithm whose performance relates to the error of the predictions? In this work, we consider the problem on trees and give deterministic algorithms whose total movement cost is only O(OPT + Δ· ERR), where OPT is the distance from the start to the goal vertex, Δ the maximum degree, and the ERR is the total number of vertices whose predictions are erroneous. We show this guarantee is optimal. We then consider a ”planning” version of the problem where the graph and predictions are known at the beginning, so the agent can use this global information to devise a search strategy of low cost. For this planning version, we go beyond trees and give an algorithms which gets good performance on (weighted) graphs with bounded doubling dimension.


page 1

page 2

page 3

page 4


A New Fast Unweighted All-pairs Shortest Path Search Algorithm Based on Pruning by Shortest Path Trees

We present a new fast all-pairs shortest path algorithm for unweighted g...

Adversarial Stochastic Shortest Path

Stochastic shortest path (SSP) is a well-known problem in planning and c...

Finding the Bandit in a Graph: Sequential Search-and-Stop

We consider the problem where an agent wants to find a hidden object tha...

Online Graph Exploration on Trees, Unicyclic Graphs and Cactus Graphs

We study the problem of exploring all vertices of an undirected weighted...

Treasure Hunt in Graph using Pebbles

In this paper, we study the treasure hunt problem in a graph by a mobile...

Planning under Uncertainty to Goal Distributions

Goal spaces for planning problems are typically conceived of as subsets ...

Broadcasting on Bounded Degree DAGs

We study the following generalization of the well-known model of broadca...

Please sign up or login with your details

Forgot password? Click here to reset