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 |
| 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.
ASJC Scopus subject areas
- Computer Networks and Communications