Abstract
This paper presents the Target Visitation Problem (TVP) for a single unmanned aerial vehicle (UAV). The ability to effectively plan a path for a UAV to visit multiple targets is an increasingly important capability in a variety of applications, including surveillance, attack, assessment, search and rescue, disaster relief, and environmental cleanup. The TVP is related to both the Traveling Salesman Problem and the Linear Ordering Problem, with an objective function that combines elements of both problems. The TVP considers both total travel distance and the order of targets visited. In this paper, we formulate the target visitation problem for a single vehicle, describe a heuristic solution procedure, and report results for problems of various size.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
