Analysis of Path Finding Techniques for Flying Robots through Intelligent Decision-Making Algorithms in Quantum Inspired Computing Environment

Abstract

Path planning is one of the most significant and challenging parts in the development of unmanned aerial vehicles. Over years many path-planning techniques are proposed and are being successfully used in various fields. Intelligent algorithms can be used for building autonomous drones. Though a number of algorithms haven been proposed in past few years but there is lack of research papers which compares different path planning algorithm and to find the optimal one by considering important parameters required for path planning of flying robot. Here we have used five varieties of algorithms ie ABC, ACO, PSO Quantum PSO, and hybrid algorithm which is a combination of ABC and PSO for path planning of our developed fixedwing type flying robot for operating inside a closed room environment. We have used the quantum-inspired computing method as its search performance is better as compared to classical techniques. Then we tried to compare and find the best algorithm for our flying robot out of the above five algorithms using multi-criteria decision making (MCDM) and TOPSIS where the following parameters like minimum cost, the shortest path traveled, and the least time taken were considered to find the most relevant results for autonomous flying robot path planning.