.png){kind=icon}
Return
Spatial coverage in routing and path planning problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2022.02.031.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Routing and path planning problems that involve spatial coverage have received increasing attention in recent years in different application areas. Spatial coverage refers to the possibility of considering nodes that are not directly served by a vehicle as visited for the purpose of the objective function or constraints. Despite similarities between the underlying problems, solution approaches have been developed in dif-ferent disciplines independently, leading to different terminologies and solution techniques. This paper proposes a unified view of the approaches: Based on a formal introduction of the concept of spatial cov-erage in vehicle routing, it presents a classification scheme for core problem features and summarizes problem variants and solution concepts developed in the domains of operations research and robotics. The connections between these related problem classes offer insights into common underlying structures and open possibilities for developing new applications and algorithms.(c) 2022 The Author(s). Published by Elsevier B.V.This is an open access article under the CC BY-NC-ND license ( http://creativecommons.org/licenses/by-nc-nd/4.0/ )
Keywords:
Vehicle routing problem
Informative path planning
Orienteering problem
Covering tour problem
Close -enough vehicle routing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSave
View more