2019
Fast Heuristics for the 3-D Multi-Goal Path Planning Based on the Generalized Traveling Salesman Problem With Neighborhoods
RA-L 2019
In this letter, we address the multi-goal path planning problem to determine a cost-efficient path to visit a set of three-dimensional regions. The problem is a variant of the traveling salesman problem with neighborhoods (TSPN) where an individual neighborhood consists of multiple regions, and the