{"id":"https://openalex.org/W2103345739","doi":"https://doi.org/10.1109/iros.2011.6095032","title":"Simplicial dijkstra and A* algorithms for optimal feedback planning","display_name":"Simplicial dijkstra and A* algorithms for optimal feedback planning","publication_year":2011,"publication_date":"2011-09-01","ids":{"openalex":"https://openalex.org/W2103345739","doi":"https://doi.org/10.1109/iros.2011.6095032","mag":"2103345739"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2011.6095032","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2011.6095032","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/A5048111092","display_name":"Dmitry Yershov","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dmitry S. Yershov","raw_affiliation_strings":["Department of Computer Science, University of Illinois, Urbana-Champaign, Urbana, IL, USA","Department of Computer Science at University of Illinois at Urbana-Champaign, 61801, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois, Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Department of Computer Science at University of Illinois at Urbana-Champaign, 61801, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065104734","display_name":"Steven M. LaValle","orcid":"https://orcid.org/0000-0003-4841-2584"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Steven M. LaValle","raw_affiliation_strings":["Department of Computer Science, University of Illinois, Urbana-Champaign, Urbana, IL, USA","Department of Computer Science at University of Illinois at Urbana-Champaign, 61801, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois, Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Department of Computer Science at University of Illinois at Urbana-Champaign, 61801, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5048111092"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":4.8226,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.95526614,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"3862","last_page":"3867"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11500","display_name":"Evacuation and Crowd Dynamics","score":0.989300012588501,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8830063343048096},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.600084662437439},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5234900712966919},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.5186592936515808},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5109699964523315},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4986083507537842},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.48645517230033875},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4822302758693695},{"id":"https://openalex.org/keywords/simplicial-complex","display_name":"Simplicial complex","score":0.4776543378829956},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.42528143525123596},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.4157021939754486},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4144403040409088},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39336273074150085},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.25874173641204834},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.23485228419303894},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.2292521893978119},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2153688371181488},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1672513782978058},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1069650948047638}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8830063343048096},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.600084662437439},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5234900712966919},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.5186592936515808},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5109699964523315},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4986083507537842},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.48645517230033875},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4822302758693695},{"id":"https://openalex.org/C187929450","wikidata":"https://www.wikidata.org/wiki/Q994399","display_name":"Simplicial complex","level":2,"score":0.4776543378829956},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.42528143525123596},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.4157021939754486},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4144403040409088},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39336273074150085},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25874173641204834},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.23485228419303894},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.2292521893978119},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2153688371181488},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1672513782978058},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1069650948047638},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/iros.2011.6095032","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2011.6095032","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.220.7597","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.220.7597","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://msl.cs.uiuc.edu/%7Elavalle/papers/YerLav11.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.700.2386","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.700.2386","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ares.lids.mit.edu/%7Eyershov/documents/iros11_paper.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1585104299","https://openalex.org/W1592648094","https://openalex.org/W1906607213","https://openalex.org/W1935926926","https://openalex.org/W1969483458","https://openalex.org/W1988044952","https://openalex.org/W1999690352","https://openalex.org/W2018347014","https://openalex.org/W2024693023","https://openalex.org/W2029668981","https://openalex.org/W2049534753","https://openalex.org/W2055341194","https://openalex.org/W2108567935","https://openalex.org/W2110144538","https://openalex.org/W2112311198","https://openalex.org/W2158137377","https://openalex.org/W2169528473","https://openalex.org/W2170220350","https://openalex.org/W2341171179","https://openalex.org/W2561843528","https://openalex.org/W3103759471","https://openalex.org/W4293078920"],"related_works":["https://openalex.org/W78690942","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2886722595","https://openalex.org/W4402599120","https://openalex.org/W2363342665","https://openalex.org/W2383519316","https://openalex.org/W2578319993","https://openalex.org/W2734981231"],"abstract_inverted_index":{"This":[0],"paper":[1],"considers":[2],"the":[3,26,36,55,60,62,82,90],"Euclidean":[4],"shortest":[5],"path":[6],"problem":[7],"among":[8],"obstacles":[9],"in":[10,35],"\u211d":[11],"<sup":[12],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[13],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</sup>":[14],".":[15],"Adaptations":[16],"of":[17],"Dijkstra's":[18,92],"and":[19,44,73,77],"A*":[20,84],"algorithms":[21],"are":[22,41,49,71],"introduced":[23],"that":[24,47],"compute":[25],"approximate":[27],"cost-to-go":[28,57],"function":[29,64],"over":[30,89],"a":[31],"simplicial":[32,83,91],"complex":[33],"embedded":[34],"free":[37],"space.":[38],"Interpolation":[39],"methods":[40,70],"carefully":[42],"designed":[43],"analyzed":[45],"so":[46],"they":[48],"proven":[50],"to":[51,54],"converge":[52],"numerically":[53],"optimal":[56,67],"function.":[58],"As":[59,80],"result,":[61],"computed":[63],"produces":[65],"approximately":[66],"trajectories.":[68],"The":[69],"implemented":[72],"demonstrated":[74],"on":[75],"2D":[76],"3D":[78],"examples.":[79],"expected,":[81],"algorithm":[85],"significantly":[86],"improves":[87],"performance":[88],"algorithm.":[93]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}