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

abstract

• 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.

authors

• Rathinam, Sivakumar

published proceedings

• Proceedings of the International Conference on Automated Planning and Scheduling

author list (cited authors)

• Chour, K., Rathinam, S., & Ravi, R.

citation count

• 1

complete list of authors

• Chour, Kenny||Rathinam, Sivakumar||Ravi, Ramamoorthi

publication date

• May 2021

publisher

• Association for the Advancement of Artificial Intelligence (AAAI)  Publisher

published in

• Proceedings International Conference on Automated Planning and Scheduling, ICAPS  Journal

Digital Object Identifier (DOI)

• 10.1609/icaps.v31i1.15950

start page

• 85

end page

• 93

volume

• 31

URL

• http://dx.doi.org/10.1609/icaps.v31i1.15950