{"id":"https://openalex.org/W4402261689","doi":"https://doi.org/10.23919/acc60939.2024.10644796","title":"Analysis of Backtracking A* for Resource Constrained Shortest Path Problems","display_name":"Analysis of Backtracking A* for Resource Constrained Shortest Path Problems","publication_year":2024,"publication_date":"2024-07-10","ids":{"openalex":"https://openalex.org/W4402261689","doi":"https://doi.org/10.23919/acc60939.2024.10644796"},"language":"en","primary_location":{"id":"doi:10.23919/acc60939.2024.10644796","is_oa":false,"landing_page_url":"http://dx.doi.org/10.23919/acc60939.2024.10644796","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 American Control Conference (ACC)","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/A5057906112","display_name":"Bryce T. Ford","orcid":null},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bryce Ford","raw_affiliation_strings":["The Ohio State University,Mechanical and Aerospace Engineering,Columbus,Ohio,United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Ohio State University,Mechanical and Aerospace Engineering,Columbus,Ohio,United States","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073597636","display_name":"Mrinal Kumar","orcid":"https://orcid.org/0000-0001-9747-9449"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mrinal Kumar","raw_affiliation_strings":["The Ohio State University,Mechanical and Aerospace Engineering,Columbus,Ohio,United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Ohio State University,Mechanical and Aerospace Engineering,Columbus,Ohio,United States","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"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.15097233,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"3545","last_page":"3550"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.8853614330291748},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6594357490539551},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.5302155613899231},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5248700976371765},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.521593451499939},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5068698525428772},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26175788044929504},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2540780305862427},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24920502305030823},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07207787036895752},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.05788180232048035}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.8853614330291748},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6594357490539551},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.5302155613899231},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5248700976371765},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.521593451499939},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5068698525428772},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26175788044929504},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2540780305862427},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24920502305030823},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07207787036895752},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.05788180232048035}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/acc60939.2024.10644796","is_oa":false,"landing_page_url":"http://dx.doi.org/10.23919/acc60939.2024.10644796","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 American Control Conference (ACC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W310105368","https://openalex.org/W1964443412","https://openalex.org/W1995415305","https://openalex.org/W2036900823","https://openalex.org/W2058479406","https://openalex.org/W2130679277","https://openalex.org/W2134634502","https://openalex.org/W2140556610","https://openalex.org/W2408262133","https://openalex.org/W2418763937","https://openalex.org/W2898326944","https://openalex.org/W2964246603","https://openalex.org/W4205782353","https://openalex.org/W4372046852","https://openalex.org/W6610823735"],"related_works":["https://openalex.org/W2760348722","https://openalex.org/W2783885583","https://openalex.org/W2120095724","https://openalex.org/W2368326437","https://openalex.org/W2357479099","https://openalex.org/W2364309619","https://openalex.org/W2371864976","https://openalex.org/W1987401977","https://openalex.org/W2391415040","https://openalex.org/W2788111191"],"abstract_inverted_index":{"The":[0],"Resource":[1],"Constrained":[2],"Shortest":[3],"Path":[4],"Problem":[5],"(RCSPP)":[6],"requires":[7],"a":[8,19,59,83,89,101],"minimum-cost":[9],"simple":[10],"path":[11,61],"between":[12],"two":[13],"nodes":[14],"that":[15,79],"is":[16],"subject":[17],"to":[18,39,48,119],"resource":[20],"consumption":[21],"constraint.":[22],"In":[23],"this":[24],"paper,":[25],"we":[26,87,99],"consider":[27,69],"the":[28,40,50,70,104],"Backtracking":[29,43,73,94,108],"<tex":[30,44,65,74,95,109],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[31,45,66,75,96,110],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$A^{\\ast}$</tex>":[32,46,76],"algorithm":[33,62],"presented":[34],"in":[35],"previous":[36],"works":[37],"applied":[38,118],"general":[41],"RCSPP.":[42],"attempts":[47],"solve":[49],"RCSPP":[51],"by":[52,58],"iterative":[53],"modification":[54],"of":[55,72,93,107],"paths":[56],"generated":[57,121],"shortest":[60],"such":[63],"as":[64],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$A^{\\ast}$</tex>.":[67,97],"We":[68],"completeness":[71],"and":[77,112],"demonstrate":[78,113],"it":[80,114],"cannot":[81],"be":[82],"complete":[84],"algorithm.":[85],"Then":[86],"propose":[88],"complete,":[90],"modified":[91],"version":[92],"Finally,":[98],"give":[100],"result":[102],"for":[103],"time":[105],"complexity":[106],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$A^{\\ast}$</tex>,":[111],"under":[115],"worst-case":[116],"conditions":[117],"randomly":[120],"graphs.":[122]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}