{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T08:43:24Z","timestamp":1775551404503,"version":"3.50.1"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"ITRC\/IITP program","award":["IITP-2021-0-01460"],"award-info":[{"award-number":["IITP-2021-0-01460"]}]},{"name":"NRF","award":["2017R1A2B3012701"],"award-info":[{"award-number":["2017R1A2B3012701"]}]},{"name":"Pierre Fernbach, Thomas Flayols, Andrea Del Prete"},{"name":"Nicolas Mansard and Steve Tonneau"},{"name":"H2020 project Memmo","award":["ICT-780l684"],"award-info":[{"award-number":["ICT-780l684"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1109\/lra.2021.3088797","type":"journal-article","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T18:42:28Z","timestamp":1634841748000},"page":"5961-5968","source":"Crossref","is-referenced-by-count":20,"title":["Solving Footstep Planning as a Feasibility Problem Using L1-Norm Minimization"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8009-2149","authenticated-orcid":false,"given":"Daeun","family":"Song","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Ewha Womans University, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6850-7110","authenticated-orcid":false,"given":"Pierre","family":"Fernbach","sequence":"additional","affiliation":[{"name":"CNRS, LAAS, Université de Toulouse, Toulouse, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Flayols","sequence":"additional","affiliation":[{"name":"CNRS, LAAS, Université de Toulouse, Toulouse, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1275-2851","authenticated-orcid":false,"given":"Andrea Del","family":"Prete","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering, University of Trento, Via Sommarive 9, Trento, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8090-0601","authenticated-orcid":false,"given":"Nicolas","family":"Mansard","sequence":"additional","affiliation":[{"name":"CNRS, LAAS, Université de Toulouse, Toulouse, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3001-8693","authenticated-orcid":false,"given":"Steve","family":"Tonneau","sequence":"additional","affiliation":[{"name":"IPAB, University of Edinburgh, Edinburgh, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2159-4832","authenticated-orcid":false,"given":"Young J.","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Ewha Womans University, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","author":"turlach","year":"2011","journal-title":"Quadprog Functions to Solve Quadratic Programming Problems"},{"key":"ref38","article-title":"Gurobi Optimizer Reference Manual","author":"gurobi","year":"2019"},{"key":"ref33","article-title":"Semidefinite Relaxations and Lagrangian Duality With Application to Combinatorial Optimization","author":"lemar\u00e9chal","year":"1999"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/1038003"},{"key":"ref31","article-title":"Big-M and Convex Hulls","author":"lofberg","year":"2012"},{"key":"ref30","article-title":"Solving footstep planning as a feasibility problem using l1-norm minimization","author":"song","year":"2020","journal-title":"Extended Version"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2016.7758092"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/HUMANOIDS.2017.8246947"},{"key":"ref35","article-title":"Cardinality optimization problems","author":"abdi","year":"2013"},{"key":"ref34","first-page":"p. 11","article-title":"l1-norm methods for convex-cardinality problems","author":"boyd","year":"0","journal-title":"Lecture notes"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/rob.21546"},{"key":"ref40","author":"makhorin","year":"0"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2018.2862902"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1177\/0278364906063979"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1177\/0278364908098447"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3072959.3073602"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2020.2979660"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2185520.2185539","article-title":"Discovery of complex behaviors through contact-invariant optimization","volume":"31","author":"mordatch","year":"2012","journal-title":"ACM Trans Graph"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/AMC.2006.1631739"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913506757"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.21236\/ADA609276"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2017.8206217"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/HUMANOIDS.2015.7363423"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2018.2819658"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2019.2923971"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3213773","article-title":"2pac: Two-point attractors for center of mass trajectories in multi-contact scenarios","volume":"37","author":"tonneau","year":"2018","journal-title":"ACM Trans Graph"},{"key":"ref29","first-page":"1601","article-title":"Fast algorithms to test robust static equilibrium for legged robots","author":"prete","year":"0","journal-title":"Proc IEEE Int Conf Robot Automat"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2017.XIII.031"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2020.2964787"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2013.01.008"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2013.6697099"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2018.2798285"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2003.1241826"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1177\/0278364919846512"},{"key":"ref22","article-title":"Efficient multi-contact pattern generation with sequential convex approximations of the centroidal dynamics","author":"ponton","year":"2020","journal-title":"IEEE Trans Robot"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9197291"},{"key":"ref42","article-title":"Implementing torque control with high-ratio gear boxes and without joint-torque sensors","volume":"13","author":"prete","year":"0","journal-title":"Int J Humanoid Robot"},{"key":"ref24","article-title":"Mixed-Integer Programming (mip) - a Primer on the Basics","author":"gurobi","year":"0"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2016.7759083"},{"key":"ref23","first-page":"2531","article-title":"Simultaneous contact, gait, and motion planning for robust multilegged locomotion via mixed-integer convex optimization","volume":"3","author":"aceituno-cabezas","year":"2018","journal-title":"IEEE Robot Autom Lett"},{"key":"ref26","first-page":"6604","article-title":"Sl1m: Sparse l1-norm minimization for contact planning on uneven terrain","author":"tonneau","year":"0","journal-title":"Proc IEEE Int Conf Robot Automat"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9045-x"},{"key":"ref25","first-page":"3990","article-title":"Automatic gait pattern selection for legged robots","author":"wang","year":"0","journal-title":"Proc IEEE\/RSJ Int Conf Intell Robots Syst"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/9399748\/09454381.pdf?arnumber=9454381","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T06:03:55Z","timestamp":1769493835000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9454381\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7]]},"references-count":43,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/lra.2021.3088797","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7]]}}}