{"id":"https://openalex.org/W4391020566","doi":"https://doi.org/10.1109/cdc49753.2023.10383980","title":"Value Iteration Algorithm for Solving Shortest Path Problems with Homology Class Constraints","display_name":"Value Iteration Algorithm for Solving Shortest Path Problems with Homology Class Constraints","publication_year":2023,"publication_date":"2023-12-13","ids":{"openalex":"https://openalex.org/W4391020566","doi":"https://doi.org/10.1109/cdc49753.2023.10383980"},"language":"en","primary_location":{"id":"doi:10.1109/cdc49753.2023.10383980","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/cdc49753.2023.10383980","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 62nd IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5056098170","display_name":"Wenbo He","orcid":"https://orcid.org/0000-0001-9982-3856"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wenbo He","raw_affiliation_strings":["Washington University,Department of Electrical and System Engineering,St. Louis,MO,USA,63130"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Washington University,Department of Electrical and System Engineering,St. Louis,MO,USA,63130","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063394910","display_name":"Yunshen Huang","orcid":"https://orcid.org/0000-0002-0043-6440"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yunshen Huang","raw_affiliation_strings":["Washington University,Department of Electrical and System Engineering,St. Louis,MO,USA,63130"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Washington University,Department of Electrical and System Engineering,St. Louis,MO,USA,63130","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5093745201","display_name":"Jinran Qie","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jinran Qie","raw_affiliation_strings":["Washington University,Department of Electrical and System Engineering,St. Louis,MO,USA,63130"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Washington University,Department of Electrical and System Engineering,St. Louis,MO,USA,63130","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081900408","display_name":"Shen Zeng","orcid":"https://orcid.org/0000-0001-5450-8975"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shen Zeng","raw_affiliation_strings":["Washington University,Department of Electrical and System Engineering,St. Louis,MO,USA,63130"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Washington University,Department of Electrical and System Engineering,St. Louis,MO,USA,63130","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.23440264,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"8400","last_page":"8405"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9941999912261963,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9926000237464905,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.8568477630615234},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.6944728493690491},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.5913545489311218},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5883076190948486},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5681731700897217},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.553134024143219},{"id":"https://openalex.org/keywords/visibility-graph","display_name":"Visibility graph","score":0.5354433655738831},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.5257880687713623},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5226616263389587},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5034613013267517},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.49213308095932007},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.4783691465854645},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.439082533121109},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39985719323158264},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.33064109086990356},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3209206461906433},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.29650864005088806},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2858338952064514},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.20259502530097961}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8568477630615234},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6944728493690491},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.5913545489311218},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5883076190948486},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5681731700897217},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.553134024143219},{"id":"https://openalex.org/C173362246","wikidata":"https://www.wikidata.org/wiki/Q8216024","display_name":"Visibility graph","level":3,"score":0.5354433655738831},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.5257880687713623},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5226616263389587},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5034613013267517},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.49213308095932007},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.4783691465854645},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.439082533121109},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39985719323158264},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33064109086990356},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3209206461906433},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29650864005088806},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2858338952064514},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.20259502530097961},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc49753.2023.10383980","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/cdc49753.2023.10383980","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 62nd IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.7099999785423279,"display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G334285618","display_name":null,"funder_award_id":"CMMI-1933976","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1926428750","https://openalex.org/W1977219675","https://openalex.org/W1992787855","https://openalex.org/W2054585537","https://openalex.org/W2120633474","https://openalex.org/W2128990851","https://openalex.org/W2141664020","https://openalex.org/W2295417718","https://openalex.org/W2603265656","https://openalex.org/W2924607344","https://openalex.org/W4294692020","https://openalex.org/W4313482702"],"related_works":["https://openalex.org/W2018146256","https://openalex.org/W2156431668","https://openalex.org/W2375775343","https://openalex.org/W2776102956","https://openalex.org/W2365712669","https://openalex.org/W2388410942","https://openalex.org/W2600678155","https://openalex.org/W2198982833","https://openalex.org/W2040572217","https://openalex.org/W4200172719"],"abstract_inverted_index":{"Path":[0],"planning":[1],"is":[2,41],"a":[3,16,28,62,102],"fundamental":[4],"problem":[5,70],"in":[6,24,45,75],"robotics":[7],"that":[8],"aims":[9],"to":[10,18,65,92,101],"find":[11],"an":[12,109],"optimal":[13],"path":[14,30,69,89],"for":[15],"system":[17],"move":[19],"on":[20],"while":[21],"avoiding":[22],"obstacles":[23,94,106],"the":[25,32,38,67,84,88,98,114,119,123,131],"environment.":[26],"Often,":[27],"feasible":[29],"connecting":[31],"start":[33],"and":[34,78,95,122],"target":[35],"point":[36],"with":[37,71,90,136],"shortest":[39,68,115],"length":[40],"highly":[42],"desirable.":[43],"Additionally,":[44],"scenarios":[46],"such":[47],"as":[48],"drone":[49],"racing":[50],"or":[51],"surveillance,":[52],"topology":[53],"constraints":[54,74],"may":[55],"arise.":[56],"In":[57],"this":[58],"paper,":[59],"we":[60,117,129],"propose":[61],"novel":[63],"method":[64],"address":[66],"homology":[72],"class":[73,103],"both":[76],"2D":[77,93],"3D":[79],"environments.":[80],"We":[81],"first":[82],"define":[83],"phase":[85],"change":[86],"of":[87,104,133],"respect":[91],"then":[96],"apply":[97],"same":[99],"technique":[100],"super-toroid":[105],"compressed":[107],"by":[108],"embedding":[110],"map.":[111],"To":[112],"synthesize":[113],"path,":[116],"leverage":[118],"visibility":[120],"graph":[121],"Value":[124],"Iteration":[125],"Algorithm":[126],"(VIA).":[127],"Finally,":[128],"demonstrate":[130],"effectiveness":[132],"our":[134],"approach":[135],"various":[137],"simulation":[138],"examples.":[139]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}