用进化神经网络让蛇形机器人在复杂障碍中高效避障行进
Towards Obstacle-Avoiding Control of Planar Snake Robots Exploring Neuro-Evolution of Augmenting Topologies
- 用NEAT算法动态生成蛇形机器人的运动参数
- 在密集障碍环境中实现高效避障,计算开销更低
- 适合对实时性要求高的机器人路径规划场景
本文旨在为平面蛇形机器人在密集障碍环境中实现资源高效的避障跟踪控制。采用神经演化增强拓扑(NEAT)算法生成蛇形步态函数的动态参数,通过关节角度控制机器人沿期望轨迹运动。输入层包含关节角、各节位置、头部位置及周边障碍物位置,输出层仅包含控制速度和方向的步态频率与偏移角。结合激光雷达与传感器数据、目标位置及时间信息,构建可优化的奖励函数,通过选择性传播优秀神经网络迭代求解。实验在PyBullet物理引擎中验证,结果表明该方法计算效率高,优于现有主流方法,性能接近最新CBRL方法但计算开销显著降低。
原文摘要 · Abstract (English)
This work aims to develop a resource-efficient solution for obstacle-avoiding tracking control of a planar snake robot in a densely cluttered environment with obstacles. Particularly, Neuro-Evolution of Augmenting Topologies (NEAT) has been employed to generate dynamic gait parameters for the serpenoid gait function, which is implemented on the joint angles of the snake robot, thus controlling the robot on a desired dynamic path. NEAT is a single neural-network based evolutionary algorithm that is known to work extremely well when the input layer is of significantly higher dimension and the output layer is of a smaller size. For the planar snake robot, the input layer consists of the joint angles, link positions, head link position as well as obstacle positions in the vicinity. However, the output layer consists of only the frequency and offset angle of the serpenoid gait that control the speed and heading of the robot, respectively. Obstacle data from a LiDAR and the robot data from various sensors, along with the location of the end goal and time, are employed to parametrize a reward function that is maximized over iterations by selective propagation of superior neural networks. The implementation and experimental results showcase that the proposed approach is computationally efficient, especially for large environments with many obstacles. The proposed framework has been verified through a physics engine simulation study on PyBullet. The approach shows superior results to existing state-of-the-art methodologies and comparable results to the very recent CBRL approach with significantly lower computational overhead. The video of the simulation can be found here: https://sites.google.com/view/neatsnakerobot
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。