Fast algorithms to test robust static equilibrium for legged robots

Maintaining equilibrium is of primary importance for legged systems. It is not surprising then that static equilibrium is at the core of most control/planning algorithms for legged robots. Being able to check whether a system is in static equilibrium is thus important, and doing it efficiently is crucial. While this is straightforward for a system in contact with a flat ground only, it is not the case for arbitrary contact geometries. In this paper we propose two new techniques to test static equilibrium and we show that they are computationally faster than all other existing methods. Moreover, we address the issue of robustness to errors in the contact-force tracking, which could lead to slippage or rotation at the contacts. We extend all the discussed techniques to test for robust static equilibrium, that is the ability to maintain equilibrium while avoiding to lose contacts despite bounded force-tracking errors. Accounting for robustness does not affect the computation time of the equilibrium tests, while it qualitatively improves the contact postures generated by our reachability-based multicontact planner.

Authors

• Andrea Del Prete
• Steve Tonneau
• Nicolas Mansard

Keywords

• Robustness
• Robots
• Friction
• IP networks
• Force
• Approximation algorithms
• Face
• Static Equilibrium
• Legged Robots
• Computation Time
• Tracking Error
• Equilibrium Test
• Gravity
• Number Of Tests
• Iterative Algorithm
• Contact Point
• Linear Programming
• Friction Coefficient
• Asteraceae
• Path Planning
• Convex Hull
• Original Algorithm
• Contact Force
• Linear Inequalities
• Robot Control
• Planning Algorithm
• Contact Configuration
• Outer Approximation
• Polytope
• Set Of Linear Inequalities
• Equilibrium Problem
• Set Of Inequalities