{"id":"https://openalex.org/W2125338973","doi":"https://doi.org/10.1109/iros.2011.6094881","title":"Iterative path optimization for practical robot planning","display_name":"Iterative path optimization for practical robot planning","publication_year":2011,"publication_date":"2011-09-01","ids":{"openalex":"https://openalex.org/W2125338973","doi":"https://doi.org/10.1109/iros.2011.6094881","mag":"2125338973"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2011.6094881","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2011.6094881","pdf_url":null,"source":{"id":"https://openalex.org/S4363608614","display_name":"2011 IEEE/RSJ International Conference on Intelligent Robots and Systems","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE/RSJ International Conference on Intelligent Robots and Systems","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/A5101169988","display_name":"Andrew Richardson","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew Richardson","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Michigan, Ann Arbor, USA","[Department of Computer Science and Engineering, University of Michigan, Ann Arbor, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Michigan, Ann Arbor, USA","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"[Department of Computer Science and Engineering, University of Michigan, Ann Arbor, USA]","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103139078","display_name":"Edwin Olson","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Edwin Olson","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Michigan, Ann Arbor, USA","[Department of Computer Science and Engineering, University of Michigan, Ann Arbor, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Michigan, Ann Arbor, USA","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"[Department of Computer Science and Engineering, University of Michigan, Ann Arbor, USA]","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4113,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.89071348,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"54","issue":null,"first_page":"3881","last_page":"3886"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9921000003814697,"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"}},{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9876999855041504,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.8030377626419067},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.7359512448310852},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.662950336933136},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6217828989028931},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5387151837348938},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.5327221155166626},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5227023363113403},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.500798225402832},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5002231597900391},{"id":"https://openalex.org/keywords/configuration-space","display_name":"Configuration space","score":0.4938109815120697},{"id":"https://openalex.org/keywords/compass","display_name":"Compass","score":0.45328524708747864},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.4449656009674072},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.43923425674438477},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.424871027469635},{"id":"https://openalex.org/keywords/occupancy-grid-mapping","display_name":"Occupancy grid mapping","score":0.4109218120574951},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4022100567817688},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3558719754219055},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.3553396165370941},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2278575599193573},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2017640769481659},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16865813732147217}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8030377626419067},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.7359512448310852},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.662950336933136},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6217828989028931},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5387151837348938},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.5327221155166626},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5227023363113403},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.500798225402832},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5002231597900391},{"id":"https://openalex.org/C90738871","wikidata":"https://www.wikidata.org/wiki/Q41642869","display_name":"Configuration space","level":2,"score":0.4938109815120697},{"id":"https://openalex.org/C2778361833","wikidata":"https://www.wikidata.org/wiki/Q34735","display_name":"Compass","level":2,"score":0.45328524708747864},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.4449656009674072},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.43923425674438477},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.424871027469635},{"id":"https://openalex.org/C57077369","wikidata":"https://www.wikidata.org/wiki/Q7075747","display_name":"Occupancy grid mapping","level":4,"score":0.4109218120574951},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4022100567817688},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3558719754219055},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.3553396165370941},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2278575599193573},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2017640769481659},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16865813732147217},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iros.2011.6094881","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2011.6094881","pdf_url":null,"source":{"id":"https://openalex.org/S4363608614","display_name":"2011 IEEE/RSJ International Conference on Intelligent Robots and Systems","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE/RSJ International Conference on Intelligent Robots and Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.385.8247","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.385.8247","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://april.eecs.umich.edu/pdfs/richardson2011.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1518641734","https://openalex.org/W1821149804","https://openalex.org/W1935926926","https://openalex.org/W1969483458","https://openalex.org/W2000359213","https://openalex.org/W2003708116","https://openalex.org/W2082761088","https://openalex.org/W2085512211","https://openalex.org/W2099144379","https://openalex.org/W2113256452","https://openalex.org/W2143102370","https://openalex.org/W2150500908","https://openalex.org/W2167348159","https://openalex.org/W2169528473","https://openalex.org/W4236251699","https://openalex.org/W7009134754"],"related_works":["https://openalex.org/W2092513144","https://openalex.org/W2112352633","https://openalex.org/W2126380264","https://openalex.org/W2322979532","https://openalex.org/W2356789814","https://openalex.org/W2908094156","https://openalex.org/W3122122033","https://openalex.org/W2362018502","https://openalex.org/W3214697798","https://openalex.org/W2358313569"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,14,60,92,109,122],"hybrid":[3],"path":[4,22,53,80,147],"planner":[5,148],"that":[6,95],"combines":[7],"two":[8],"common":[9],"methods":[10,73],"for":[11,18,82,149],"robotic":[12],"planning:":[13],"Dijkstra":[15],"graph":[16],"search":[17],"the":[19,24,45,52,56,101,144,162],"minimum":[20,46],"distance":[21,47],"through":[23],"configuration":[25],"space":[26],"and":[27,107,159],"an":[28],"optimization":[29],"scheme":[30],"to":[31,44,54,59,76,116,130,161],"iteratively":[32],"improve":[33],"grid-based":[34],"paths.":[35],"Our":[36,134],"formulation":[37,65],"is":[38,104,143],"novel":[39],"because":[40],"we":[41],"first":[42],"commit":[43],"path,":[48],"then":[49],"explicitly":[50],"relax":[51],"maximize":[55],"clearance":[57,84],"up":[58],"user-specified":[61],"bound.":[62],"Notably,":[63],"this":[64],"yields":[66],"more":[67],"predictable":[68],"paths":[69,99],"than":[70],"potential":[71,88],"field":[72,89,138],"which":[74],"try":[75],"trade":[77,93],"increases":[78],"in":[79],"length":[81],"greater":[83],"around":[85],"obstacles.":[86],"These":[87],"costs":[90],"infer":[91],"off":[94],"can":[96],"yield":[97],"poor":[98],"when":[100],"obstacle":[102],"map":[103],"partially":[105],"observable":[106],"has":[108,136],"finite":[110],"history.":[111],"Some":[112],"approximations":[113],"are":[114],"used":[115],"ensure":[117,131],"efficient":[118],"planning,":[119],"but":[120],"only":[121],"small":[123],"set":[124],"of":[125,153],"additional":[126],"behaviors":[127],"were":[128],"required":[129],"safe":[132],"operation.":[133],"method":[135],"been":[137],"tested":[139],"extensively,":[140],"as":[141],"it":[142],"main":[145],"on-robot":[146],"our":[150],"large":[151],"team":[152],"14":[154],"medium-scale":[155],"autonomous":[156],"ground":[157],"robots":[158],"entry":[160],"2010":[163],"Multi":[164],"Autonomous":[165],"Ground-robotic":[166],"International":[167],"Challenge,":[168],"MAGIC":[169],"2010.":[170]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}