TransPath: Learning Heuristics For Grid-Based Pathfinding via Transformers

by   Daniil Kirilenko, et al.

Heuristic search algorithms, e.g. A*, are the commonly used tools for pathfinding on grids, i.e. graphs of regular structure that are widely employed to represent environments in robotics, video games etc. Instance-independent heuristics for grid graphs, e.g. Manhattan distance, do not take the obstacles into account and, thus, the search led by such heuristics performs poorly in the obstacle-rich environments. To this end, we suggest learning the instance-dependent heuristic proxies that are supposed to notably increase the efficiency of the search. The first heuristic proxy we suggest to learn is the correction factor, i.e. the ratio between the instance independent cost-to-go estimate and the perfect one (computed offline at the training phase). Unlike learning the absolute values of the cost-to-go heuristic function, which was known before, when learning the correction factor the knowledge of the instance-independent heuristic is utilized. The second heuristic proxy is the path probability, which indicates how likely the grid cell is lying on the shortest path. This heuristic can be utilized in the Focal Search framework as the secondary heuristic, allowing us to preserve the guarantees on the bounded sub-optimality of the solution. We learn both suggested heuristics in a supervised fashion with the state-of-the-art neural networks containing attention blocks (transformers). We conduct a thorough empirical evaluation on a comprehensive dataset of planning tasks, showing that the suggested techniques i) reduce the computational effort of the A* up to a factor of 4x while producing the solutions, which costs exceed the costs of the optimal solutions by less than 0.3 include the conventional techniques from the heuristic search, i.e. weighted A*, as well as the state-of-the-art learnable planners.


page 1

page 5

page 6

page 10

page 11

page 13


Fully Convolutional Search Heuristic Learning for Rapid Path Planners

Path-planning algorithms are an important part of a wide variety of robo...

The FastMap Algorithm for Shortest Path Computations

We present a new preprocessing algorithm for embedding the nodes of a gi...

Learning Graph Search Heuristics

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

Adaptively Informed Trees (AIT*): Fast Asymptotically Optimal Path Planning through Adaptive Heuristics

Informed sampling-based planning algorithms exploit problem knowledge fo...

Accelerating Multi-Agent Planning Using Graph Transformers with Bounded Suboptimality

Conflict-Based Search is one of the most popular methods for multi-agent...

Learning Heuristic Selection with Dynamic Algorithm Configuration

A key challenge in satisfying planning is to use multiple heuristics wit...

Approximation and Heuristic Algorithms for Probabilistic Physical Search on General Graphs

We consider an agent seeking to obtain an item, potentially available at...

Please sign up or login with your details

Forgot password? Click here to reset