Balasubramanian E, Elangovan E, Tamilarasan P, Kanagachidambaresan G R, Chutia Dibyajyoti
Department of Mechanical Engineering, Head-Centre for Autonomous System Research, Vel Tech Rangarajan Dr Sagunthala R & D Institute of Science and Technology, Avadi, Chennai, Tamilnadu 600062 India.
Department of Electronics and Communication Engineering, Centre for Autonomous System Research, Vel Tech Rangarajan Dr Sagunthala R & D Institute of Science and Technology, Avadi, Chennai, Tamilnadu 600062 India.
J Ambient Intell Humaniz Comput. 2022 Jun 25:1-21. doi: 10.1007/s12652-022-04098-z.
Autonomous mission capabilities with optimal path are stringent requirements for Unmanned Aerial Vehicle (UAV) navigation in diverse applications. The proposed research framework is to identify an energy-efficient optimal path to achieve the designated missions for the navigation of UAVs in various constrained and denser obstacle prone regions. Hence, the present work is aimed to develop an optimal energy-efficient path planning algorithm through combining well known modified ant colony optimization algorithm (MACO) and a variant of A*, namely the memory-efficient A* algorithm (MEA*) for avoiding the obstacles in three dimensional (3D) environment and arrive at an optimal path with minimal energy consumption. The novelty of the proposed method relies on integrating the above two efficient algorithms to optimize the UAV path planning task. The basic design of this study is, that by utilizing an improved version of the pheromone strategy in MACO, the local trap and premature convergence are minimized, and also an optimal path is found by means of reward and penalty mechanism. The sole notion of integrating the MEA* algorithm arises from the fact that it is essential to overcome the stringent memory requirement of conventional A* algorithm and to resolve the issue of tracking only the edges of the grids. Combining the competencies of MACO and MEA*, a hybrid algorithm is proposed to avoid obstacles and find an efficient path. Simulation studies are performed by varying the number of obstacles in a 3D domain. The real-time flight trials are conducted experimentally using a UAV by implementing the attained optimal path. A comparison of the total energy consumption of UAV with theoretical analysis is accomplished. The significant finding of this study is that, the MACO-MEA* algorithm achieved 21% less energy consumption and 55% shorter execution time than the MACO-A*. moreover, the path traversed in both simulation and experimental methods is 99% coherent with each other. it confirms that the developed hybrid MACO-MEA* energy-efficient algorithm is a viable solution for UAV navigation in 3D obstacles prone regions.
在各种应用中,具备最优路径的自主任务能力是无人机导航的严格要求。所提出的研究框架旨在识别一条节能的最优路径,以实现无人机在各种受限且障碍物密集区域的指定导航任务。因此,当前工作旨在通过结合著名的改进蚁群优化算法(MACO)和A算法的一个变体,即内存高效A算法(MEA*),来开发一种最优节能路径规划算法,以在三维(3D)环境中避开障碍物,并以最小能耗获得最优路径。所提方法的新颖之处在于整合上述两种高效算法来优化无人机路径规划任务。本研究的基本设计是,通过在MACO中利用改进版的信息素策略,将局部陷阱和早熟收敛降至最低,并通过奖惩机制找到最优路径。整合MEA算法的唯一理念源于这样一个事实,即克服传统A算法对内存的严格要求以及解决仅跟踪网格边缘的问题至关重要。结合MACO和MEA的能力,提出了一种混合算法来避开障碍物并找到一条高效路径。通过改变3D域中的障碍物数量进行仿真研究。通过实施获得的最优路径,使用无人机进行了实时飞行试验。完成了无人机总能耗与理论分析的比较。本研究的重要发现是,MACO-MEA算法比MACO-A算法能耗降低了21%,执行时间缩短了55%。此外,仿真和实验方法中遍历的路径彼此一致性达到99%。这证实了所开发的混合MACO-MEA节能算法是无人机在3D障碍物密集区域导航的可行解决方案。