S^*: A Heuristic Information-Based Approximation Framework for Multi-Goal Path Finding

03/15/2021
by   Kenny Chour, et al.
0

We combine ideas from uni-directional and bi-directional heuristic search, and approximation algorithms for the Traveling Salesman Problem, to develop a novel framework for a Multi-Goal Path Finding (MGPF) problem that provides a 2-approximation guarantee. MGPF aims to find a least-cost path from an origin to a destination such that each node in a given set of goals is visited at least once along the path. We present numerical results to illustrate the advantages of our framework over conventional alternates in terms of the number of expanded nodes and run time.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 7

page 10

12/18/2019

Busca de melhor caminho entre múltiplas origens e múltiplos destinos em redes complexas que representam cidades

Was investigated in this paper the use of a search strategy in the probl...
04/09/2015

An Optimized Hybrid Approach for Path Finding

Path finding algorithm addresses problem of finding shortest path from s...
07/27/2021

Bi-Directional Grid Constrained Stochastic Processes' Link to Multi-Skew Brownian Motion

Bi-Directional Grid Constrained (BGC) stochastic processes (BGCSPs) cons...
01/10/2019

On the Distance Between the Rumor Source and Its Optimal Estimate on a Regular Tree

This paper addresses the rumor source identification problem, where the ...
01/10/2019

On the Distance Between the Rumor Source and Its Optimal Estimate in a Regular Tree

This paper addresses the rumor source identification problem, where the ...
11/02/2021

The supersingular isogeny path and endomorphism ring problems are equivalent

We prove that the path-finding problem in ℓ-isogeny graphs and the endom...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.