Aerial path planning for multi-vehiclesShow others and affiliations
2019 (English)In: Proceedings - IEEE 2nd International Conference on Artificial Intelligence and Knowledge Engineering, AIKE 2019, Institute of Electrical and Electronics Engineers (IEEE), 2019, p. 267-272, article id 8791733Conference paper, Published paper (Refereed)
Abstract [en]
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.
Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2019. p. 267-272, article id 8791733
Keywords [en]
Facility Location Problem, Local Search, Path Planning, Search Algorithm, Simulated Annealing, Tabu Search
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:kth:diva-262642DOI: 10.1109/AIKE.2019.00052Scopus ID: 2-s2.0-85071489282ISBN: 9781728114880 (print)OAI: oai:DiVA.org:kth-262642DiVA, id: diva2:1361825
Conference
2nd IEEE International Conference on Artificial Intelligence and Knowledge Engineering, AIKE 2019; Cagliari, Sardinia; Italy; 3 June 2019 through 5 June 2019
Note
QC 20191017
2019-10-172019-10-172019-10-17Bibliographically approved