{"id":"https://openalex.org/W2015149365","doi":"https://doi.org/10.1109/humanoids.2014.7041373","title":"Footstep planning on uneven terrain with mixed-integer convex optimization","display_name":"Footstep planning on uneven terrain with mixed-integer convex optimization","publication_year":2014,"publication_date":"2014-11-01","ids":{"openalex":"https://openalex.org/W2015149365","doi":"https://doi.org/10.1109/humanoids.2014.7041373","mag":"2015149365"},"language":"en","primary_location":{"id":"doi:10.1109/humanoids.2014.7041373","is_oa":false,"landing_page_url":"https://doi.org/10.1109/humanoids.2014.7041373","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE-RAS International Conference on Humanoid Robots","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://orcid.org/0000-0001-9755-3856","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036513591","display_name":"Robin Deits","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robin Deits","raw_affiliation_strings":["MIT, Computer Science and Artificial Intelligence Laboratory, Cambridge, MA, USA","Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, MA, 02139, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT, Computer Science and Artificial Intelligence Laboratory, Cambridge, MA, USA","institution_ids":[]},{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, MA, 02139, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074291890","display_name":"Russ Tedrake","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Russ Tedrake","raw_affiliation_strings":["Faculty of Electrical Engineering and Computer Science, MIT, Cambridge, MA, USA","Faculty of Electrical Engineering and Computer Science, MIT, Cambridge, MA 02139, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering and Computer Science, MIT, Cambridge, MA, USA","institution_ids":[]},{"raw_affiliation_string":"Faculty of Electrical Engineering and Computer Science, MIT, Cambridge, MA 02139, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":283,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"279","last_page":"286"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10879","display_name":"Robotic Locomotion and Control","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10879","display_name":"Robotic Locomotion and Control","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10571","display_name":"Robotic Mechanisms and Dynamics","score":0.9731000065803528,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5893009901046753},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5470871925354004},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5447330474853516},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.5220703482627869},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4796762466430664},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.4438930153846741},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.4311516582965851},{"id":"https://openalex.org/keywords/robot-kinematics","display_name":"Robot kinematics","score":0.42257586121559143},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.4130329489707947},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3948511481285095},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3477819561958313},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.31404417753219604},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2990682125091553},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2669525742530823},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0805315375328064}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5893009901046753},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5470871925354004},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5447330474853516},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.5220703482627869},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4796762466430664},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.4438930153846741},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.4311516582965851},{"id":"https://openalex.org/C74222875","wikidata":"https://www.wikidata.org/wiki/Q16000312","display_name":"Robot kinematics","level":4,"score":0.42257586121559143},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.4130329489707947},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3948511481285095},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3477819561958313},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.31404417753219604},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2990682125091553},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2669525742530823},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0805315375328064}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/humanoids.2014.7041373","is_oa":false,"landing_page_url":"https://doi.org/10.1109/humanoids.2014.7041373","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE-RAS International Conference on Humanoid Robots","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.484.410","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.484.410","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://groups.csail.mit.edu/robotics-center/public_papers/Deits14a.pdf","raw_type":"text"},{"id":"pmh:oai:dspace.mit.edu:1721.1/101076","is_oa":true,"landing_page_url":"https://orcid.org/0000-0001-9755-3856","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/101076","is_oa":true,"landing_page_url":"https://orcid.org/0000-0001-9755-3856","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.7400000095367432}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W33747781","https://openalex.org/W1030513622","https://openalex.org/W1516488188","https://openalex.org/W1962169445","https://openalex.org/W1973546417","https://openalex.org/W1977995507","https://openalex.org/W2042870409","https://openalex.org/W2056223738","https://openalex.org/W2084959384","https://openalex.org/W2096127980","https://openalex.org/W2127895608","https://openalex.org/W2129942075","https://openalex.org/W2296319761","https://openalex.org/W2402652894","https://openalex.org/W2540579400","https://openalex.org/W2541589810","https://openalex.org/W2549082795","https://openalex.org/W4250589301","https://openalex.org/W4285719527","https://openalex.org/W6626973494","https://openalex.org/W6630980417","https://openalex.org/W6678790860"],"related_works":["https://openalex.org/W2136512912","https://openalex.org/W2127267268","https://openalex.org/W2156446763","https://openalex.org/W2067910792","https://openalex.org/W2150194458","https://openalex.org/W2143461633","https://openalex.org/W2889071233","https://openalex.org/W4321471459","https://openalex.org/W4221156924","https://openalex.org/W2380814829"],"abstract_inverted_index":{"We":[0,128,147],"present":[1],"a":[2,10,19,49,66,85,144,164],"new":[3],"method":[4],"for":[5,9,74],"planning":[6,160],"footstep":[7,40,122],"placements":[8],"robot":[11],"walking":[12],"on":[13,183],"uneven":[14],"terrain":[15],"with":[16,139],"obstacles,":[17],"using":[18],"mixed-integer":[20,51],"quadratically-constrained":[21],"quadratic":[22],"program":[23],"(MIQCQP).":[24],"Our":[25,188],"approach":[26],"is":[27,63,82,106,156,190],"unique":[28],"in":[29,48,132,167,177],"that":[30,53,96],"it":[31],"handles":[32],"obstacle":[33],"avoidance,":[34],"kinematic":[35],"reachability,":[36],"and":[37,91,119,135,138],"rotation":[38],"of":[39,70,79,89,115,152,159,163,174,179],"placements,":[41],"which":[42,155],"typically":[43],"have":[44],"required":[45],"non-convex":[46],"constraints,":[47],"single":[50],"optimization":[52],"can":[54],"be":[55],"efficiently":[56],"solved":[57],"to":[58,94,123,181],"its":[59],"global":[60],"optimum.":[61],"Reachability":[62],"enforced":[64],"through":[65],"convex":[67,113],"inner":[68],"approximation":[69,88,98],"the":[71,75,80,97,101,110,153,193],"reachable":[72],"space":[73,118],"robot's":[76,102],"feet.":[77],"Rotation":[78],"footsteps":[81,176],"handled":[83],"by":[84,108,143],"piecewise":[86],"linear":[87],"sine":[90],"cosine,":[92],"designed":[93],"ensure":[95],"never":[99],"overestimates":[100],"reachability.":[103],"Obstacle":[104],"avoidance":[105],"ensured":[107],"decomposing":[109],"environment":[111],"into":[112],"regions":[114],"obstacle-free":[116],"configuration":[117],"assigning":[120],"each":[121],"one":[124,169],"such":[125],"safe":[126],"region.":[127],"demonstrate":[129],"this":[130],"technique":[131],"simple":[133],"2D":[134],"3D":[136],"environments":[137,141],"real":[140],"sensed":[142],"humanoid":[145],"robot.":[146],"also":[148],"discuss":[149],"computational":[150],"performance":[151],"algorithm,":[154],"currently":[157],"capable":[158],"short":[161],"sequences":[162,173],"few":[165],"steps":[166],"under":[168],"second":[170],"or":[171],"longer":[172],"10-30":[175],"tens":[178],"seconds":[180],"minutes":[182],"common":[184],"laptop":[185],"computer":[186],"hardware.":[187],"implementation":[189],"available":[191],"within":[192],"Drake":[194],"MATLAB":[195],"toolbox":[196],"[1].":[197]},"counts_by_year":[{"year":2025,"cited_by_count":16},{"year":2024,"cited_by_count":27},{"year":2023,"cited_by_count":27},{"year":2022,"cited_by_count":14},{"year":2021,"cited_by_count":27},{"year":2020,"cited_by_count":39},{"year":2019,"cited_by_count":26},{"year":2018,"cited_by_count":35},{"year":2017,"cited_by_count":25},{"year":2016,"cited_by_count":33},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}