Abstract
A Team Orienteering Problem (TOP) that seeks the most profitable routes for multiple players given limited travel time or length is one of the most relevant routing problems for service delivery by Unmanned Aerial Vehicles (UAVs) with limited battery or energy capacity. In this study, we propose a variant of the TOP, where an operational area for multiple UAVs is divided into non-overlapping zones and routes for UAVs are derived within the zones. Importantly, by allocating designated zones to each UAV, any update on a UAV’s route within its zone does not interfere with other UAVs’ routes. This aspect is critical for a service or a mission to be executed under a highly dynamic environment especially with limited communication between UAVs. The operational and practical benefits of applying the proposed solution approach are demonstrated by comparing it to a classic TOP solution in a simulation environment where a profit of visiting a location is uncertain.
Original language | English |
---|---|
Article number | 61 |
Journal | Journal of Intelligent and Robotic Systems: Theory and Applications |
Volume | 111 |
Issue number | 2 |
ISSN | 0921-0296 |
DOIs | |
Publication status | Published - Jun 2025 |
Bibliographical note
Publisher Copyright:© The Author(s) 2025.
Keywords
- Area decomposition
- Clustering
- Team orienteering problem
- UAV
- Unmanned aerial vehicle
- Zoning