Skip to content
naulon

Not checkedNot checked for notices yet.

EFFICIENT TOUR PLANNING FOR A MEASUREMENT VEHICLE BY COMBINING NEXT BEST VIEW AND TRAVELING SALESMAN

J. Gehrung, J. Gehrung, M. Hebel and 2 more

The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences · 2021

doi:10.5194/isprs-archives-xliii-b2-2021-729-2021 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Path planning for a measuring vehicle requires solving two popular problems from computer science, namely the search for the optimal tour and the search for the optimal viewpoint. Combining both problems results in a new variation of the Traveling Salesman Problem, which we refer to as the <i>Explorational Traveling Salesman Problem</i>. The solution to this problem is the optimal tour with a minimum of observations. In this paper, we formulate the basic problem, discuss it in context of the existing literature and present an iterative solution algorithm. We demonstrate how the method can be applied directly to LiDAR data using an occupancy grid. The ability of our algorithm to generate suitably efficient tours is verified based on two synthetic benchmark datasets, utilizing a ground truth determined by an exhaustive search.

Abstract licence: CC BY

References23

    23 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.