势场
最大值和最小值
叠加原理
障碍物
路径(计算)
运动规划
算法
领域(数学)
计算机科学
避障
数学优化
人工智能
数学
物理
机器人
移动机器人
数学分析
地球物理学
纯数学
政治学
法学
程序设计语言
标识
DOI:10.1109/lra.2023.3290819
摘要
This letter proposes a novel local path planning algorithm called Safe Artificial Potential Field (SAPF). The algorithm uses the attractive potential for goal reaching as the original one. However, the repulsive potential is replaced by a general obstacle potential, equal to repulsive potential, vortex potential, or their superposition. Moreover, the analytical tuning procedure of SAPF is described in this letter. The proposed algorithm has been compared to the original Artificial Potential Field (APF), Vortex APF (VAPF), and Dynamic Window Approach (DWA). The comparison has been provided using both, simulational and experimental validation. The SAPF allows to avoid simple local minima, keep safety distance from obstacles and move through narrow corridors. The obtained results in the form of videos are attached as supplementary files.
科研通智能强力驱动
Strongly Powered by AbleSci AI