Standard vehicle routing problems have been studied for decades in fields such as transportation, manufacturing, and commodity distribution. In this work, we proposed a variation of these problems that arise in routing Unmanned Aerial Vehicles (UAV's) in the presence of terrain obscuration. Specifically, the UAV must visit a location from which the object on the ground in mountainous regions can be viewed without actually flying over the object. Numerical results are presented for near optimal and real time algorithms which have been developed using Lagrangian relaxation techniques. Directions for future work that include priorities, time windows, and routing multiple UAV's with periodic and dynamic changes in the object locations are discussed.
Visibility-constrained routing of unmanned aerial vehicles
Signal Processing, Sensor Fusion, and Target Recognition VIII ; 1999 ; Orlando,FL,USA
Proc. SPIE ; 3720
27.07.1999
Aufsatz (Konferenz)
Elektronische Ressource
Englisch