Shortest path for K goals

Roni Stern; Meir Goldenberg; Ariel Felner

doi:10.1609/socs.v8i1.18413

Shortest path for K goals

Roni Stern
, Meir Goldenberg
, Ariel Felner

Ben-Gurion University of the Negev
Jerusalem College of Technology

Research output: Contribution to conference › Paper › peer-review

1 Scopus citations

Abstract

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 language	English
Pages	167-168
Number of pages	2
DOIs	https://doi.org/10.1609/socs.v8i1.18413
State	Published - 2017
Externally published	Yes
Event	10th Annual Symposium on Combinatorial Search, SoCS 2017 - Pittsburgh, United States Duration: 16 Jun 2017 → 17 Jun 2017

Conference

Conference	10th Annual Symposium on Combinatorial Search, SoCS 2017
Country/Territory	United States
City	Pittsburgh
Period	16/06/17 → 17/06/17

Bibliographical note

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

Funding

Acknowledgments. Financial support for this research was in part provided by Israel Science Foundation (ISF) grant #417/13 and by the Cyber Security Research Center at Ben-Gurion University.

Funders	Funder number
Israel Science Foundation	417/13

Access to Document

10.1609/socs.v8i1.18413

Cite this

@conference{afde1949cbd5455dab1c3aac09ab48ef,

title = "Shortest path for K goals",

abstract = "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.",

author = "Roni Stern and Meir Goldenberg and Ariel Felner",

note = "Publisher Copyright: Copyright {\textcopyright} 2017, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 10th Annual Symposium on Combinatorial Search, SoCS 2017 ; Conference date: 16-06-2017 Through 17-06-2017",

year = "2017",

doi = "10.1609/socs.v8i1.18413",

language = "אנגלית",

pages = "167--168",

}

TY - CONF

T1 - Shortest path for K goals

AU - Stern, Roni

AU - Goldenberg, Meir

AU - Felner, Ariel

PY - 2017

Y1 - 2017

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

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

UR - https://www.scopus.com/pages/publications/85050555791

U2 - 10.1609/socs.v8i1.18413

DO - 10.1609/socs.v8i1.18413

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:85050555791

SP - 167

EP - 168

T2 - 10th Annual Symposium on Combinatorial Search, SoCS 2017

Y2 - 16 June 2017 through 17 June 2017

ER -

Shortest path for K goals

Abstract

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this