Unmanned Aerial Vehicles (UAV) are a potential solution to fast and cost efficient package delivery services. There are two types of UAVs, namely fixed wing (UAV-FW) and rotor wing (UAV-RW), which have their own advantages and drawbacks. In this paper we aim at providing different solutions to a collaborating multi-agent scenario combining both UAVs types. We show the problem can be reduced to the facility location problem (FLP) and propose two local search algorithms to solve it: Tabu search and simulated annealing.
Aerial Path Planning for Multi-Vehicles
01.06.2019
1263653 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Cooperative path planning of unmanned aerial vehicles
TIBKAT | 2011
|Cooperative path planning of unmanned aerial vehicles
TIBKAT | 2011
|Cooperative path planning of unmanned aerial vehicles
SLUB | 2011
|Cooperative Path Planning of Unmanned Aerial Vehicles
AIAA | 2011
|PATH PLANNING DECISION METHOD FOR UNMANNED AERIAL VEHICLES
Europäisches Patentamt | 2019