TL;DR
This paper introduces a novel two-step optimization framework for planning the motion of multi-limbed robots climbing vertical walls. By decoupling the problem into posture planning and force planning, the authors enable more robust and interpretable motion generation, validated on a hexapod robot.
What Problem Does This Paper Address?
Climbing vertical surfaces presents a significant challenge for robots. Unlike ground locomotion, wall climbing requires robots to maintain stable contact and generate sufficient forces against gravity, often relying solely on friction. This demands a complex interplay of joint torques, contact forces, and body posture, all while navigating potential obstacles and uneven terrain. Existing methods often struggle with the high dimensionality and complex constraints of this problem, leading to brittle solutions or requiring computationally expensive, monolithic optimization approaches that can be difficult to debug. This paper aims to address this by developing a more structured and efficient motion planning strategy for multi-limbed wall-climbing robots.
Methods
The core contribution of this paper is a two-step optimization-based motion planning algorithm.
- Posture Planning (MICP/NLP): The first step focuses on determining the sequence of robot postures (body position, orientation, and limb end-effector positions) required to reach a goal configuration. This is formulated as a Mixed-Integer Convex Programming (MICP) or Nonlinear Programming (NLP) problem. This part is similar to standard legged locomotion planning and handles constraints like step size, kinematics, and ensuring end-effectors remain within feasible contact regions. A key aspect here is the use of a linearized rotation matrix for body orientation, which is valid for small rotations and simplifies the problem to MICP. For larger rotations, a full NLP formulation is suggested.
- Force Planning (Convex Optimization): Once a sequence of postures is determined, the second step focuses on calculating the necessary contact forces and actuator torques to achieve these postures while satisfying safety constraints. This is formulated as a series of standard convex optimization problems. This step incorporates novel "safety factors" for both friction and motor torque. These factors ensure that the robot has a margin of safety against slipping or over-torquing, even with uncertainties in friction coefficients or external loads. The algorithm iteratively plans forces for discrete time steps between postures.
This decoupling offers advantages in interpretability and computational efficiency, as the second stage, which deals with forces and safety, can be solved using efficient convex optimization techniques.
Datasets
Not discussed in the paper. The paper focuses on a simulation environment (V-rep) and hardware experiments with a custom-built hexapod robot.
Key Insights and Ideas
- Decoupling for Interpretability and Efficiency: Separating posture planning from force planning significantly improves the interpretability of the motion planning process. If the planner fails, it's easier to pinpoint whether the issue lies in the planned path or the force execution. This also allows for leveraging efficient convex optimization for the force planning stage.
- Safety Factors for Robustness: Introducing explicit safety factors for friction and motor torque is crucial for wall-climbing tasks, which are inherently high-risk. These factors provide a quantifiable margin against failure due to environmental uncertainties or actuator limitations.
- Bridging Legged Locomotion and Wall Climbing: The posture planning stage is directly analogous to legged walking, allowing the reuse of established algorithms and insights from that field. The novelty lies in the subsequent force planning stage, which is specific to the climbing domain.
- Handling Statically Indeterminate Systems: The paper acknowledges the challenge of statically indeterminate systems in multi-limbed robots and utilizes a Virtual Joint Method (VJM) to model limb compliance and derive whole-body stiffness matrices, which are then used in the force planning.
Key Results
The paper demonstrates the effectiveness of their approach through simulations and hardware experiments on a hexapod robot.
- Successful Climbing Scenarios: The planner successfully generated motion plans for a hexapod robot to:
- Climb over steps on vertical walls.
- Navigate around obstacles between walls.
- Climb on non-parallel walls (demonstrating adaptability to different wall geometries).
- Hardware Validation: All demonstrated scenarios were validated on actual hardware, showing good correspondence between planned and executed motions.
- Computational Efficiency: The two-step approach, particularly the convex optimization for force planning, leads to a "decently fast" solution speed, making it potentially suitable for real-time replanning. The paper provides statistics showing that the force planner can solve 96 times per round with a total solve time of 960 ms.
Limitations and Future Work
- Small Rotations Assumption: The MICP formulation for posture planning relies on a linearized rotation matrix, which is only accurate for small body rotations. For tasks requiring large rotations (e.g., climbing inside a tube), a full NLP solver is necessary, which can be more prone to local minima.
- No Vision Sensor: The current system relies on pre-defined wall geometry and does not incorporate a vision sensor for real-time perception and adaptation.
- Future Work:
- Integrating a perception system to map wall geometry and automate the planning process.
- Extending the safety factor design principle to other types of grippers (e.g., gecko-type, microspine).
- Comparing and combining MICP and NLP approaches more thoroughly.
- Incorporating dynamic climbing capabilities by adding dynamic constraints to the planner.
- Extending the planner to more general two-wall climbing scenarios and potentially to climbing poles or trees.
Summary updated