{"id":"https://openalex.org/W2965865771","doi":"https://doi.org/10.1177/0278364919855422","title":"Towards optimal path computation in a simplicial complex","display_name":"Towards optimal path computation in a simplicial complex","publication_year":2019,"publication_date":"2019-06-06","ids":{"openalex":"https://openalex.org/W2965865771","doi":"https://doi.org/10.1177/0278364919855422","mag":"2965865771"},"language":"en","primary_location":{"id":"doi:10.1177/0278364919855422","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364919855422","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","raw_type":"journal-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/A5101463763","display_name":"Subhrajit Bhattacharya","orcid":"https://orcid.org/0000-0001-9139-054X"},"institutions":[{"id":"https://openalex.org/I186143895","display_name":"Lehigh University","ror":"https://ror.org/012afjb06","country_code":"US","type":"education","lineage":["https://openalex.org/I186143895"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Subhrajit Bhattacharya","raw_affiliation_strings":["Department of Mechanical Engineering and Mechanics, Lehigh University, Bethlehem, PA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering and Mechanics, Lehigh University, Bethlehem, PA, USA","institution_ids":["https://openalex.org/I186143895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101463763"],"corresponding_institution_ids":["https://openalex.org/I186143895"],"apc_list":null,"apc_paid":null,"fwci":0.5109,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.69325241,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"38","issue":"8","first_page":"981","last_page":"1009"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994999766349792,"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.9994999766349792,"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.9782999753952026,"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/T10879","display_name":"Robotic Locomotion and Control","score":0.9776999950408936,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6084811687469482},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5483019948005676},{"id":"https://openalex.org/keywords/simplicial-complex","display_name":"Simplicial complex","score":0.5361105799674988},{"id":"https://openalex.org/keywords/geodesic","display_name":"Geodesic","score":0.4722570478916168},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4581966996192932},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.43516722321510315},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38260406255722046},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37977680563926697},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37275469303131104},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3604389429092407},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3179701566696167},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.21940791606903076},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.18880873918533325}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6084811687469482},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5483019948005676},{"id":"https://openalex.org/C187929450","wikidata":"https://www.wikidata.org/wiki/Q994399","display_name":"Simplicial complex","level":2,"score":0.5361105799674988},{"id":"https://openalex.org/C165818556","wikidata":"https://www.wikidata.org/wiki/Q213488","display_name":"Geodesic","level":2,"score":0.4722570478916168},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4581966996192932},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.43516722321510315},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38260406255722046},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37977680563926697},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37275469303131104},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3604389429092407},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3179701566696167},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.21940791606903076},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.18880873918533325},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1177/0278364919855422","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364919855422","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.699999988079071}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W1522365498","https://openalex.org/W1584534477","https://openalex.org/W1585104299","https://openalex.org/W1622225657","https://openalex.org/W1935926926","https://openalex.org/W1957318557","https://openalex.org/W1969483458","https://openalex.org/W1974489012","https://openalex.org/W1992787855","https://openalex.org/W1999071165","https://openalex.org/W2000359213","https://openalex.org/W2021702776","https://openalex.org/W2037034267","https://openalex.org/W2052715377","https://openalex.org/W2066769138","https://openalex.org/W2067544887","https://openalex.org/W2069965629","https://openalex.org/W2078765782","https://openalex.org/W2102323131","https://openalex.org/W2103345739","https://openalex.org/W2104314621","https://openalex.org/W2108567935","https://openalex.org/W2115558907","https://openalex.org/W2128990851","https://openalex.org/W2129785440","https://openalex.org/W2135125135","https://openalex.org/W2136207702","https://openalex.org/W2160728037","https://openalex.org/W2163178194","https://openalex.org/W2163318972","https://openalex.org/W2165744968","https://openalex.org/W2169528473","https://openalex.org/W2171496510","https://openalex.org/W2614653677","https://openalex.org/W2615497679","https://openalex.org/W2741438308","https://openalex.org/W3103759471","https://openalex.org/W4246219036","https://openalex.org/W4247582681","https://openalex.org/W4256490523","https://openalex.org/W4292023735","https://openalex.org/W4293682399"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W4293054712","https://openalex.org/W2767202586","https://openalex.org/W2375775343","https://openalex.org/W2388654557","https://openalex.org/W2360981904","https://openalex.org/W2365712669","https://openalex.org/W1990043277","https://openalex.org/W2349797546","https://openalex.org/W2161960576"],"abstract_inverted_index":{"Computing":[0],"optimal":[1],"path":[2,41,197],"in":[3,14,110,228,244],"a":[4,43,53,74,104,128,140,156,196],"configuration":[5,60,80,173],"space":[6,85,116,248],"is":[7,71,160,216],"fundamental":[8],"to":[9,25,51],"solving":[10],"motion":[11],"planning":[12],"problems":[13],"robotics":[15],"and":[16,106,139,179],"autonomy.":[17],"Graph-based":[18],"search":[19,186],"algorithms":[20],"have":[21],"been":[22],"widely":[23],"used":[24,50],"that":[26,47,219],"end,":[27],"but":[28,192],"they":[29],"suffer":[30],"from":[31],"drawbacks.":[32],"We":[33,181],"present":[34,195],"an":[35,65,78,133,153],"algorithm":[36,125,168,187,199,215,239],"for":[37,172,188,200],"computing":[38,189,202],"the":[39,59,94,113,121,166,185,203,207,213,225,232,237,241,245],"shortest":[40,108,190,204,233],"through":[42,206],"metric":[44,67,115,247],"simplicial":[45,208],"complex":[46],"can":[48],"be":[49],"construct":[52],"piece-wise":[54],"linear":[55],"discrete":[56,75],"model":[57],"of":[58,77,87,132,165,175,212,220],"manifold.":[61],"In":[62],"particular,":[63],"given":[64],"undirected":[66],"graph,":[68,135],"G,":[69],"which":[70],"constructed":[72],"as":[73,146,152,224],"representation":[76],"underlying":[79,114],"manifold":[81],"(a":[82],"larger":[83],"\u201ccontinuous\u201d":[84],"typically":[86],"dimension":[88],"greater":[89],"than":[90,119],"one),":[91],"we":[92,193],"consider":[93],"Rips":[95],"complex,":[96,105],"[Formula:":[97,136,143],"see":[98,137,144],"text],":[99,138,145],"associated":[100],"with":[101,218],"it.":[102],"Such":[103],"hence":[107],"paths":[109,205,234,243],"it,":[111],"represent":[112,240],"more":[117,250],"closely":[118],"what":[120],"graph":[122],"does.":[123],"Our":[124],"requires":[126],"only":[127,183],"local":[129,163],"connectivity-based":[130],"description":[131],"abstract":[134],"cost/length":[141],"function,":[142],"inputs.":[147],"No":[148],"global":[149,157],"information":[150],"such":[151],"embedding":[154],"or":[155],"coordinate":[158],"chart":[159],"required.":[161],"The":[162,210],"nature":[164],"proposed":[167,238],"makes":[169],"it":[170],"suitable":[171],"spaces":[174],"arbitrary":[176],"topology,":[177],"geometry,":[178],"dimension.":[180],"not":[182],"develop":[184],"distances,":[191],"also":[194],"reconstruction":[198],"explicitly":[201],"complex.":[209],"complexity":[211],"presented":[214,227],"comparable":[217],"Dijkstra\u2019s":[221],"search,":[222],"but,":[223],"results":[226],"this":[229],"paper":[230],"demonstrate,":[231],"obtained":[235],"using":[236],"geodesic":[242],"original":[246],"significantly":[249],"closely.":[251]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}