TY - GEN
T1 - A convex model of humanoid momentum dynamics for multi-contact motion generation
AU - Ponton, Brahayam
AU - Herzog, Alexander
AU - Schaal, Stefan
AU - Righetti, Ludovic
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/12/30
Y1 - 2016/12/30
N2 - Linear models for control and motion generation of humanoid robots have received significant attention in the past years, not only due to their well known theoretical guarantees, but also because of practical computational advantages. However, to tackle more challenging tasks and scenarios such as locomotion on uneven terrain, a more expressive model is required. In this paper, we are interested in contact interaction-centered motion optimization based on the momentum dynamics model. This model is non-linear and non-convex; however, we find a relaxation of the problem that allows us to formulate it as a single convex quadratically-constrained quadratic program (QCQP) that can be very efficiently optimized and is useful for multi-contact planning. This convex model is then coupled to the optimization of end-effector contact locations using a mixed integer program, which can also be efficiently solved. This becomes relevant e.g. to recover from external pushes, where a predefined stepping plan is likely to fail and an online adaptation of the contact location is needed. The performance of our algorithm is demonstrated in several multi-contact scenarios for a humanoid robot.
AB - Linear models for control and motion generation of humanoid robots have received significant attention in the past years, not only due to their well known theoretical guarantees, but also because of practical computational advantages. However, to tackle more challenging tasks and scenarios such as locomotion on uneven terrain, a more expressive model is required. In this paper, we are interested in contact interaction-centered motion optimization based on the momentum dynamics model. This model is non-linear and non-convex; however, we find a relaxation of the problem that allows us to formulate it as a single convex quadratically-constrained quadratic program (QCQP) that can be very efficiently optimized and is useful for multi-contact planning. This convex model is then coupled to the optimization of end-effector contact locations using a mixed integer program, which can also be efficiently solved. This becomes relevant e.g. to recover from external pushes, where a predefined stepping plan is likely to fail and an online adaptation of the contact location is needed. The performance of our algorithm is demonstrated in several multi-contact scenarios for a humanoid robot.
UR - http://www.scopus.com/inward/record.url?scp=85010205093&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85010205093&partnerID=8YFLogxK
U2 - 10.1109/HUMANOIDS.2016.7803371
DO - 10.1109/HUMANOIDS.2016.7803371
M3 - Conference contribution
AN - SCOPUS:85010205093
T3 - IEEE-RAS International Conference on Humanoid Robots
SP - 842
EP - 849
BT - Humanoids 2016 - IEEE-RAS International Conference on Humanoid Robots
PB - IEEE Computer Society
T2 - 16th IEEE-RAS International Conference on Humanoid Robots, Humanoids 2016
Y2 - 15 November 2016 through 17 November 2016
ER -