arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.06339cs.RO
收藏

基于优化的多肢垂直攀爬机器人运动规划

Optimization Based Motion Planning for Multi-Limbed Vertical Climbing Robots

University of California Los Angeles(加州大学洛杉矶分校)

Xuan Lin, Jingwen Zhang, Junjie Shen, Gabriel Fernandez, Dennis W Hong

AI总结:

针对六足机器人在两墙间仅靠摩擦垂直攀爬的问题,提出将躯干姿态与接触力解耦的优化规划框架,并通过多类场景仿真与实验验证。

摘要:

为多肢机器人规划沿墙壁向上攀爬的运动轨迹,需要独特地结合力矩、接触力和姿态方面的约束。本文聚焦于一种特定构型的运动规划:一台六足机器人支撑在两堵垂直墙壁之间,并依靠仅利用摩擦力的末端执行器垂直攀爬。我们没有使用单一的非线性规划(NLP)求解器进行运动规划,而是将该问题解耦为两个具有不同物理意义的部分:躯干姿态与接触力。第一部分可表述为混合整数凸规划(MICP)或NLP问题,而第二部分则被表述为一系列标准凸优化问题。双墙攀爬问题的多种变体,例如避障、不平坦表面和倾斜墙壁,有助于在仿真和实验中验证所提出的方法。

英文摘要:

Motion planning trajectories for a multi-limbed robot to climb up walls requires a unique combination of constraints on torque, contact force, and posture. This paper focuses on motion planning for one particular setup wherein a six-legged robot braces itself between two vertical walls and climbs vertically with end effectors that only use friction. Instead of motion planning with a single nonlinear programming (NLP) solver, we decoupled the problem into two parts with distinct physical meaning: torso postures and contact forces. The first part can be formulated as either a mixed-integer convex programming (MICP) or NLP problem, while the second part is formulated as a series of standard convex optimization problems. Variants of the two wall climbing problem e.g., obstacle avoidance, uneven surfaces, and angled walls, help verify the proposed method in simulation and experimentation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑