{"id":"https://openalex.org/W2084959384","doi":"https://doi.org/10.1109/humanoids.2012.6651592","title":"Anytime search-based footstep planning with suboptimality bounds","display_name":"Anytime search-based footstep planning with suboptimality bounds","publication_year":2012,"publication_date":"2012-11-01","ids":{"openalex":"https://openalex.org/W2084959384","doi":"https://doi.org/10.1109/humanoids.2012.6651592","mag":"2084959384"},"language":"en","primary_location":{"id":"doi:10.1109/humanoids.2012.6651592","is_oa":false,"landing_page_url":"https://doi.org/10.1109/humanoids.2012.6651592","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 12th IEEE-RAS International Conference on Humanoid Robots (Humanoids 2012)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018550573","display_name":"Armin Hornung","orcid":null},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Armin Hornung","raw_affiliation_strings":["Humanoid Robots Lab, University of Freiburg, Germany","Humanoid Robots Lab., Univ. of Freiburg, Freiburg, Germany"],"affiliations":[{"raw_affiliation_string":"Humanoid Robots Lab, University of Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]},{"raw_affiliation_string":"Humanoid Robots Lab., Univ. of Freiburg, Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060105538","display_name":"Andrew Dornbush","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew Dornbush","raw_affiliation_strings":["Robotics Institute, Carnegie Mellon University, Pittsburgh, USA","[Robot. Inst., Carnegie Mellon Univ., Pittsburgh, PA, USA]"],"affiliations":[{"raw_affiliation_string":"Robotics Institute, Carnegie Mellon University, Pittsburgh, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"[Robot. Inst., Carnegie Mellon Univ., Pittsburgh, PA, USA]","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103257510","display_name":"Maxim Likhachev","orcid":"https://orcid.org/0000-0002-9539-2398"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Maxim Likhachev","raw_affiliation_strings":["Robotics Institute, Carnegie Mellon University, Pittsburgh, USA","[Robot. Inst., Carnegie Mellon Univ., Pittsburgh, PA, USA]"],"affiliations":[{"raw_affiliation_string":"Robotics Institute, Carnegie Mellon University, Pittsburgh, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"[Robot. Inst., Carnegie Mellon Univ., Pittsburgh, PA, USA]","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103231515","display_name":"Maren Bennewitz","orcid":"https://orcid.org/0000-0003-4343-3028"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Maren Bennewitz","raw_affiliation_strings":["Humanoid Robots Lab, University of Freiburg, Germany","Humanoid Robots Lab., Univ. of Freiburg, Freiburg, Germany"],"affiliations":[{"raw_affiliation_string":"Humanoid Robots Lab, University of Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]},{"raw_affiliation_string":"Humanoid Robots Lab., Univ. of Freiburg, Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5018550573"],"corresponding_institution_ids":["https://openalex.org/I161046081"],"apc_list":null,"apc_paid":null,"fwci":4.6673,"has_fulltext":false,"cited_by_count":98,"citation_normalized_percentile":{"value":0.95589696,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"674","last_page":"679"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9968000054359436,"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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9968000054359436,"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/T10879","display_name":"Robotic Locomotion and Control","score":0.989799976348877,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9686999917030334,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/maxima-and-minima","display_name":"Maxima and minima","score":0.800224781036377},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7400371432304382},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7073594927787781},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6589048504829407},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6581531763076782},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.622773289680481},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5246127843856812},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5139205455780029},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.35591742396354675},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3115984797477722},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2259160280227661},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.20087605714797974},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1615680754184723}],"concepts":[{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.800224781036377},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7400371432304382},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7073594927787781},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6589048504829407},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6581531763076782},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.622773289680481},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5246127843856812},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5139205455780029},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.35591742396354675},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3115984797477722},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2259160280227661},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.20087605714797974},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1615680754184723},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/humanoids.2012.6651592","is_oa":false,"landing_page_url":"https://doi.org/10.1109/humanoids.2012.6651592","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 12th IEEE-RAS International Conference on Humanoid Robots (Humanoids 2012)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.7300000190734863,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W2020530538","https://openalex.org/W2052011296","https://openalex.org/W2097167023","https://openalex.org/W2108507649","https://openalex.org/W2112271657","https://openalex.org/W2113029345","https://openalex.org/W2125356896","https://openalex.org/W2134858572","https://openalex.org/W2158070864","https://openalex.org/W2161076907","https://openalex.org/W2164167893","https://openalex.org/W2172037318","https://openalex.org/W2541589810","https://openalex.org/W2544548454","https://openalex.org/W2545385919","https://openalex.org/W2913241063","https://openalex.org/W6674456411","https://openalex.org/W6678466409","https://openalex.org/W6683620479","https://openalex.org/W6758591943"],"related_works":["https://openalex.org/W4388726836","https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W2153809277","https://openalex.org/W2015961810","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013"],"abstract_inverted_index":{"Efficient":[0],"footstep":[1,44],"planning":[2,69,92],"for":[3,157],"humanoid":[4],"navigation":[5],"through":[6],"cluttered":[7],"environments":[8],"is":[9,38,53,173],"still":[10],"a":[11,119,177],"challenging":[12],"problem.":[13],"Many":[14],"obstacles":[15],"create":[16,107],"local":[17,186],"minima":[18,187],"in":[19,132,154],"the":[20,49,71,124,130,140,162,190],"search":[21],"space,":[22],"forcing":[23],"heuristic":[24,143,179],"planners":[25,106,131],"such":[26,99],"as":[27,57,100],"A*":[28,74,78],"to":[29,39,83,95,114,184],"expand":[30],"large":[31],"areas.":[32],"The":[33],"goal":[34],"of":[35,192],"this":[36],"work":[37],"efficiently":[40],"compute":[41],"long,":[42],"feasible":[43],"paths.":[45],"For":[46],"navigation,":[47],"finding":[48],"optimal":[50,125],"path":[51],"initially":[52],"often":[54],"not":[55],"needed":[56],"it":[58,183],"can":[59],"be":[60,115],"improved":[61],"while":[62],"walking.":[63],"Thus,":[64],"we":[65],"propose":[66],"anytime":[67,72],"search-based":[68],"using":[70,135],"repairing":[73],"(ARA*)":[75],"and":[76,112,146,172,188],"randomized":[77,97],"(R*)":[79],"planners.":[80],"This":[81,181],"allows":[82,182],"obtain":[84],"efficient":[85,147],"paths":[86,108,156],"with":[87,139],"provable":[88],"suboptimality":[89],"within":[90],"short":[91],"times.":[93],"Opposed":[94],"completely":[96],"methods":[98],"rapidly-exploring":[101],"random":[102],"trees":[103],"(RRTs),":[104],"these":[105],"that":[109],"are":[110],"goal-directed":[111],"guaranteed":[113],"no":[116],"more":[117],"than":[118,123],"certain":[120],"factor":[121],"longer":[122],"solution.":[126],"We":[127],"thoroughly":[128],"evaluated":[129],"various":[133],"scenarios":[134],"different":[136],"heuristics.":[137],"ARA*":[138],"2D":[141],"Dijkstra":[142],"yields":[144,169],"fast":[145,170],"solutions":[148],"but":[149],"its":[150],"potential":[151],"inadmissibility":[152],"results":[153],"non-optimal":[155],"some":[158],"scenarios.":[159],"R*,":[160],"on":[161,176],"other":[163],"hand":[164],"borrows":[165],"ideas":[166],"from":[167],"RRTs,":[168],"solutions,":[171],"less":[174],"dependent":[175],"well-designed":[178],"function.":[180],"avoid":[185],"reduces":[189],"number":[191],"expanded":[193],"states.":[194]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":15},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}