TY - GEN
T1 - ContactNet
T2 - 21st International Conference on Ubiquitous Robots, UR 2024
AU - Bratta, Angelo
AU - Meduri, Avadesh
AU - Focchi, Michele
AU - Righetti, Ludovic
AU - Semini, Claudio
N1 - Publisher Copyright:
© 2024 IEEE.
PY - 2024
Y1 - 2024
N2 - The field of legged robots has seen tremendous progress in the last few years. Locomotion trajectories are commonly generated by optimization algorithms in a Model Predictive Control (MPC) loop. To achieve online trajectory optimization, the locomotion community generally makes use of heuristic-based contact planners due to their low computation times and high replanning frequencies. In this work, we propose ContactNet, a fast acyclic contact planner based on a multi-output regression neural network. ContactNet ranks discretized stepping locations, allowing to quickly choose the best feasible solution, even in complex environments. The low computation time, in the order of 1 ms, enables the execution of the contact planner concurrently with a trajectory optimizer in a MPC fashion. In addition, the computational time does not scale up with the configuration of the terrain. We demonstrate the effectiveness of the approach in simulation in different scenarios with the quadruped robot Solo12. To the best knowledge of the authors, this is the first time a contact planner is presented that does not exhibit an increasing computational time on irregular terrains with an increasing number of gaps.
AB - The field of legged robots has seen tremendous progress in the last few years. Locomotion trajectories are commonly generated by optimization algorithms in a Model Predictive Control (MPC) loop. To achieve online trajectory optimization, the locomotion community generally makes use of heuristic-based contact planners due to their low computation times and high replanning frequencies. In this work, we propose ContactNet, a fast acyclic contact planner based on a multi-output regression neural network. ContactNet ranks discretized stepping locations, allowing to quickly choose the best feasible solution, even in complex environments. The low computation time, in the order of 1 ms, enables the execution of the contact planner concurrently with a trajectory optimizer in a MPC fashion. In addition, the computational time does not scale up with the configuration of the terrain. We demonstrate the effectiveness of the approach in simulation in different scenarios with the quadruped robot Solo12. To the best knowledge of the authors, this is the first time a contact planner is presented that does not exhibit an increasing computational time on irregular terrains with an increasing number of gaps.
UR - http://www.scopus.com/inward/record.url?scp=85200709046&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85200709046&partnerID=8YFLogxK
U2 - 10.1109/UR61395.2024.10597477
DO - 10.1109/UR61395.2024.10597477
M3 - Conference contribution
AN - SCOPUS:85200709046
T3 - 2024 21st International Conference on Ubiquitous Robots, UR 2024
SP - 747
EP - 754
BT - 2024 21st International Conference on Ubiquitous Robots, UR 2024
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 24 June 2024 through 27 June 2024
ER -