Shortest path for K goals

Roni Stern, Meir Goldenberg, Ariel Felner

Research output: Contribution to conferencePaperpeer-review

1 Scopus citations


The k-goal problem is a generalization of the Shortest Path Problem (SPP) in which the task is to solve k SPP problems, such that all the problems share the same start vertex. kGP was introduced to the heuristic search community for building an Incremental Roadmap Spanner technique (Dobson and Bekris 2014), which is a useful construct in motion plannin for robotics. But kGP has many other applications, e.g., when path planning for multiple drones flying from a central dispatcher location to k target locations.

Original languageEnglish
Number of pages2
StatePublished - 2017
Externally publishedYes
Event10th Annual Symposium on Combinatorial Search, SoCS 2017 - Pittsburgh, United States
Duration: 16 Jun 201717 Jun 2017


Conference10th Annual Symposium on Combinatorial Search, SoCS 2017
Country/TerritoryUnited States

Bibliographical note

Publisher Copyright:
Copyright © 2017, Association for the Advancement of Artificial Intelligence ( All rights reserved.


Dive into the research topics of 'Shortest path for K goals'. Together they form a unique fingerprint.

Cite this