Facility Location Problem Approach for Distributed Drones

Currently, industry and academia are undergoing an evolution in developing the next generation of drone applications. Including the development of autonomous drones that can carry out tasks without the assistance of a human operator. In spite of this, there are still problems left unanswered related to the placement of drone take-off, landing and charging areas. Future policies by governments and aviation agencies are inevitably going to restrict the operational area where drones can take-off and land. Hence, there is a need to develop a system to manage landing and take-off areas for drones. Additionally, we proposed this approach due to the lack of justification for the initial location of drones in current research. Therefore, to provide a foundation for future research, we give a justified reason that allows predetermined location of drones with the use of drone ports. Furthermore, we propose an algorithm to optimally place these drone ports to minimize the average distance drones must travel based on a set of potential drone port locations and tasks generated in a given area. Our approach is derived from the Facility Location problem which produces an efficient near optimal solution to place drone ports that reduces the overall drone energy consumption. Secondly, we apply various traveling salesman algorithms to determine the shortest route the drone must travel to visit all the tasks.

[1]  Cheng Tang,et al.  Convergence Rate of Stochastic k-means , 2016, AISTATS.

[2]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[3]  Emanuele Frontoni,et al.  A Vision-Based Guidance System for UAV Navigation and Safe Landing using Natural Landmarks , 2010, J. Intell. Robotic Syst..

[4]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[5]  Robert J. Wood,et al.  Science, technology and the future of small autonomous drones , 2015, Nature.

[6]  Chaitanya Swamy,et al.  Improved Approximation Guarantees for Lower-Bounded Facility Location , 2011, WAOA.

[7]  Sergei Vassilvitskii,et al.  k-means++: the advantages of careful seeding , 2007, SODA '07.

[8]  Qingbo Geng,et al.  A kind of route planning method for UAV based on improved PSO algorithm , 2013, 2013 25th Chinese Control and Decision Conference (CCDC).

[9]  D.M. Mount,et al.  An Efficient k-Means Clustering Algorithm: Analysis and Implementation , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Sanaa Sharafeddine,et al.  On-Demand Deployment of Multiple Aerial Base Stations for Traffic Offloading and Network Recovery , 2018, Comput. Networks.

[11]  Janne J. Lehtomäki,et al.  Placement of 5G Drone Base Stations by Data Field Clustering , 2017, 2017 IEEE 85th Vehicular Technology Conference (VTC Spring).

[12]  Trio Adiono,et al.  Prototyping design of a low-cost bike sharing system for smart city application , 2017, 2017 International Conference on ICT For Smart Society (ICISS).

[13]  Walid Saad,et al.  Caching in the Sky: Proactive Deployment of Cache-Enabled Unmanned Aerial Vehicles for Optimized Quality-of-Experience , 2016, IEEE Journal on Selected Areas in Communications.

[14]  M. Desrochers,et al.  The congested facility location problem , 1995 .

[15]  Christoforos Kanellakis,et al.  Survey on Computer Vision for UAVs: Current Developments and Trends , 2017, Journal of Intelligent & Robotic Systems.