运动规划
计算机科学
障碍物
可执行文件
移动机器人
路径(计算)
避障
机器人
弹道
点(几何)
光学(聚焦)
人工智能
实时计算
数学
物理
几何学
光学
天文
程序设计语言
操作系统
政治学
法学
作者
Walid Jebrane,Nabil El Akchioui
标识
DOI:10.1109/niss55057.2022.10085101
摘要
The biggest challenge to autonomous mobile robot navigation is planning an obstacle-free trajectory from an initial point to the target. All environments are prompt to change which arises obstacles that add more complexity to the autonomous navigation systems, especially for tasks such as parcel delivery, law enforcement, and first aid in urban areas. The most of current algorithms for autonomous system path planning are drawn from pre-existing models and focus mostly on Ground Autonomous Vehicles, employing 2D techniques that must be converted to 3D in the case of Aerial Vehicles. The race to solve those challenging tasks, over the past few decades, has led to a promising range of improved and hybrid robot path planning. The main objective of this article is to provide a comprehensive and conclusive review of two of the most successful three-dimensional robotic path planning algorithms developed in recent years. Each algorithm is investigated and evaluated in terms of time efficiency, executable area, and capacity to deal with both static and dynamic obstacles.
科研通智能强力驱动
Strongly Powered by AbleSci AI