Uploaded May 2018 | Updated September 2026, 2 weeks ago
ICRA 2018 Spotlight Video
Interactive Session Tue PM Pod H.8
Authors: Del Prete, Andrea; Tonneau, Steve; Mansard, Nicolas
Title: Zero Step Capturability for Legged Robots in Multi Contact
Abstract:
The ability to anticipate a fall is fundamental for any robot that has to balance. Currently, fast fall-prediction algorithms only exist for simple models, such as the Linear Inverted Pendulum Model (LIPM), whose validity breaks down in multi-contact scenarios (i.e. when contacts are not limited to a flat ground). This paper presents a fast fall-prediction algorithm based on the point-mass model, which remains valid in multicontact scenarios. The key assumption of our algorithm is that, in order to come to a stop without changing its contacts, a robot only needs to accelerate its center of mass in the direction opposite to its velocity. This assumption allows us to predict the fall by means of a convex optimal control problem, which we solve with a fast custom algorithm (less than 11 ms of computation time). We validated the approach through extensive simulations with the humanoid robot HRP-2 in randomly-sampled scenarios. Comparisons with standard LIPM-based methods demonstrate the superiority of our algorithm in predicting the fall of the robot, when controlled with a state-of-the-art balance controller. This work lays the foundations for the solution of the challenging problem of push recovery in multi-contact scenarios.
ICRA 2018 Spotlight Video
Interactive Session Tue PM Pod H.8
Authors: Del Prete, Andrea; Tonneau, Steve; Mansard, Nicolas
Title: Zero Step Capturability for Legged Robots in Multi Contact
Abstract:
The ability to anticipate a fall is fundamental for any robot that has to balance. Currently, fast fall-prediction algorithms only exist for simple models, such as the Linear Inverted Pendulum Model (LIPM), whose validity breaks down in multi-contact scenarios (i.e. when contacts are not limited to a flat ground). This paper presents a fast fall-prediction algorithm based on the point-mass model, which remains valid in multicontact scenarios. The key assumption of our algorithm is that, in order to come to a stop without changing its contacts, a robot only needs to accelerate its center of mass in the direction opposite to its velocity. This assumption allows us to predict the fall by means of a convex optimal control problem, which we solve with a fast custom algorithm (less than 11 ms of computation time). We validated the approach through extensive simulations with the humanoid robot HRP-2 in randomly-sampled scenarios. Comparisons with standard LIPM-based methods demonstrate the superiority of our algorithm in predicting the fall of the robot, when controlled with a state-of-the-art balance controller. This work lays the foundations for the solution of the challenging problem of push recovery in multi-contact scenarios.






![Learning to Parse Natural Language to Grounded Reward Functions with Weak Supervision
ICRA 2018 Spotlight Video
Interactive Session Wed PM Pod I.1
Authors: Williams, Edward; Gopalan, Nakul; Rhee, Mina; Tellex, Stefanie
Title: Learning to Parse Natural Language to Grounded Reward Functions with Weak Supervision
Abstract:
In order to intuitively and efficiently collaborate with humans, robots must learn to complete tasks specified using natural language. We represent natural language instructions as goal-state reward functions specified using lambda calculus. Using reward functions as language representations allows robots to plan efficiently in stochastic environments. To map sentences to such reward functions, we learn a weighted linear Combinatory Categorial Grammar (CCG) semantic parser. The parser, including both parameters and the CCG lexicon, is learned from a validation procedure that does not require execution of a planner, annotating reward functions, or labeling parse trees, unlike prior approaches. To learn a CCG lexicon and parse weights, we use coarse lexical generation and validation-driven perceptron weight updates using the approach of Artzi and Zettlemoyer [4]. We present results on the Cleanup World domain [19] to demonstrate the potential of our approach. We report an F1 score of 0.82 on a collected corpus of 23 tasks containing combinations of nested referential expressions, comparators and object properties with 2037 corresponding sentences. Our goal-condition learning approach enables an improvement of orders of magnitude in computation time over a baseline that performs planning during learning, while achieving comparable results. Further, we conduct an experiment with just 6 labeled demonstrations to show the ease of teaching a robot behaviors using our method. Learning to Parse Natural Language to Grounded Reward Functions with Weak Supervision](https://i.ytimg.com/vi/c9Up1R_jlew/mqdefault.jpg)



