Path Planning for Drone Delivery in Dense Building Environments.

2023 IEEE 26th International Conference on Intelligent Transportation Systems (ITSC)(2023)

引用 0|浏览0
暂无评分
摘要
Drones have been introduced into urban environments to facilitate our life such as cargo delivery services. However, the densely located buildings in urban areas pose challenges for safe drone operations due to the collision risk with buildings. To address this challenge, we propose a path planning method that leverages an improved ant colony optimization (IACO) algorithm. The algorithm improves the standard setting of ACO with an adaptive parameter mechanism and an update mechanism of pheromone intensity. A further improvement is made by introducing a rapidly exploring random tree (RRT) based mechanism to improve the search efficiency. Simulation results demonstrate that our proposed method significantly increases the convergence rate and the quality of solutions for path planning in complex city environments. It can consistently produce satisfactory solutions with a more rapid convergence rate in both two-dimensional and three-dimensional environments.
更多
查看译文
关键词
Path Planning,Dense Environments,Drone Delivery,Optimization Algorithm,Convergence Rate,Urban Environments,Solution Quality,Ant Colony,Ant Colony Optimization,Ant Colony Optimization Algorithm,Rapidly-exploring Random Tree,End Point,Random Number,Search Algorithm,Fitness Function,Local Optimum,Random Points,Pathfinding,Intelligence Algorithms,Obstacle Avoidance,Global Search Capability,Flight Path,Planning Algorithm,Path Search,Roulette Wheel Selection,Convergence Speed Of The Algorithm,Eristalis,Faster Convergence Speed,Heuristic Value,High-quality Solutions
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要