贝塞尔曲线
运动规划
路径(计算)
计算机科学
遗传算法
适应度函数
数学优化
算法
过程(计算)
更安全的
惩罚法
路径长度
机器人
数学
人工智能
几何学
操作系统
计算机安全
程序设计语言
计算机网络
作者
Jianwei Ma,Yang Liu,Shaofei Zang,Lin Wang
摘要
In this study, a new method of smooth path planning is proposed based on Bezier curves and is applied to solve the problem of redundant nodes and peak inflection points in the path planning process of traditional algorithms. First, genetic operations are used to obtain the control points of the Bezier curve. Second, a shorter path is selected by an optimization criterion that the length of the Bezier curve is determined by the control points. Finally, a safe distance and adaptive penalty factor are introduced into the fitness function to ensure the safety of the walking process of the robot. Numerous experiments are implemented in two different environments and compared with the existing methods. It is proved that the proposed method is more effective to generate a shorter, smoother, and safer path compared with traditional approaches.
科研通智能强力驱动
Strongly Powered by AbleSci AI