{"id":"https://openalex.org/W4413925734","doi":"https://doi.org/10.1109/icra55743.2025.11128828","title":"A Complete and Bounded-Suboptimal Algorithm for a Moving Target Traveling Salesman Problem with Obstacles in 3D*","display_name":"A Complete and Bounded-Suboptimal Algorithm for a Moving Target Traveling Salesman Problem with Obstacles in 3D*","publication_year":2025,"publication_date":"2025-05-19","ids":{"openalex":"https://openalex.org/W4413925734","doi":"https://doi.org/10.1109/icra55743.2025.11128828"},"language":"en","primary_location":{"id":"doi:10.1109/icra55743.2025.11128828","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra55743.2025.11128828","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Robotics and Automation (ICRA)","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":null,"display_name":"Anoop Bhat","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anoop Bhat","raw_affiliation_strings":["Robotics Institute at Carnegie Mellon University,Pittsburgh,PA,USA,15213"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Robotics Institute at Carnegie Mellon University,Pittsburgh,PA,USA,15213","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039249097","display_name":"Geordan Gutow","orcid":"https://orcid.org/0000-0002-2137-6280"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Geordan Gutow","raw_affiliation_strings":["Robotics Institute at Carnegie Mellon University,Pittsburgh,PA,USA,15213"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Robotics Institute at Carnegie Mellon University,Pittsburgh,PA,USA,15213","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049203481","display_name":"Bhaskar Vundurthy","orcid":"https://orcid.org/0000-0002-6876-4424"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bhaskar Vundurthy","raw_affiliation_strings":["Robotics Institute at Carnegie Mellon University,Pittsburgh,PA,USA,15213"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Robotics Institute at Carnegie Mellon University,Pittsburgh,PA,USA,15213","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018561143","display_name":"Zhongqiang Ren","orcid":"https://orcid.org/0000-0003-2880-8653"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhongqiang Ren","raw_affiliation_strings":["UM-SJTU Joint Institute and,Department of Automation at Shanghai Jiao Tong University,Shanghai,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UM-SJTU Joint Institute and,Department of Automation at Shanghai Jiao Tong University,Shanghai,China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033570895","display_name":"Sivakumar Rathinam","orcid":"https://orcid.org/0000-0002-9223-7456"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sivakumar Rathinam","raw_affiliation_strings":["Texas A&#x0026;M University,Department of Mechanical Engineering and Department of Computer Science and Engineering,College Station,TX,77843"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Texas A&#x0026;M University,Department of Mechanical Engineering and Department of Computer Science and Engineering,College Station,TX,77843","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048906141","display_name":"Howie Choset","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Howie Choset","raw_affiliation_strings":["Robotics Institute at Carnegie Mellon University,Pittsburgh,PA,USA,15213"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Robotics Institute at Carnegie Mellon University,Pittsburgh,PA,USA,15213","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9226,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.78398224,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"6132","last_page":"6138"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9897000193595886,"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.9897000193595886,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9869999885559082,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9674999713897705,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8990497589111328},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6497828364372253},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.5776845216751099},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.538478672504425},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.528738260269165},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.48585769534111023},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38615429401397705},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31972140073776245}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8990497589111328},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6497828364372253},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5776845216751099},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.538478672504425},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.528738260269165},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.48585769534111023},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38615429401397705},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31972140073776245},{"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.1109/icra55743.2025.11128828","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra55743.2025.11128828","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1928089741","display_name":null,"funder_award_id":"2120219,2120529","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1030513622","https://openalex.org/W2035601288","https://openalex.org/W2039766013","https://openalex.org/W2042872950","https://openalex.org/W2050965489","https://openalex.org/W2073089651","https://openalex.org/W2075852435","https://openalex.org/W2083974195","https://openalex.org/W2109405343","https://openalex.org/W2139011629","https://openalex.org/W2303363477","https://openalex.org/W2790839280","https://openalex.org/W2913711517","https://openalex.org/W2930154544","https://openalex.org/W2939063477","https://openalex.org/W3092744298","https://openalex.org/W3123076862","https://openalex.org/W4242361212","https://openalex.org/W4303628462","https://openalex.org/W4388692454","https://openalex.org/W4402354021","https://openalex.org/W4405785365","https://openalex.org/W4412403847"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2171568915","https://openalex.org/W1595757466","https://openalex.org/W2361554335","https://openalex.org/W4200179302","https://openalex.org/W8433631","https://openalex.org/W4220987199","https://openalex.org/W2495211334"],"abstract_inverted_index":{"The":[0],"moving":[1,22,172],"target":[2,37],"traveling":[3,101],"salesman":[4,102],"problem":[5,103,179],"with":[6,39,104,171,181],"obstacles":[7],"(MT-TSP-O)":[8],"seeks":[9],"an":[10,14,75,132],"obstacle-free":[11],"trajectory":[12],"for":[13,69,74,118,169],"agent":[15,49,76,120,134],"that":[16],"intercepts":[17],"a":[18,40,51,87,91,99,110,125,144,151,155,193],"given":[19],"set":[20],"of":[21,112,157],"targets,":[23],"each":[24],"within":[25,43],"specified":[26],"time":[27,45,105,116],"windows,":[28,46],"and":[29,47,66,72,90,114,165,186],"returns":[30],"to":[31,108,121,183],"the":[32,48,63,70,95,119,127,138],"agent's":[33],"starting":[34],"position.":[35],"Each":[36],"moves":[38],"constant":[41],"velocity":[42],"its":[44,188],"has":[50],"speed":[52],"limit":[53],"no":[54],"smaller":[55,189],"than":[56,192],"any":[57],"target's":[58],"speed.":[59],"We":[60,174],"present":[61],"FMC*-TSP,":[62],"first":[64],"complete":[65],"bounded-suboptimal":[67],"algorithm":[68,85,146],"MT-TSP-O,":[71],"results":[73],"whose":[77],"configuration":[78],"space":[79],"is":[80],"<tex":[81],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[82],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\mathbb{R}^{3}$</tex>.":[83],"Our":[84],"interleaves":[86],"high-level":[88,96],"search":[89,97,129,164],"lowlevel":[92],"search,":[93],"where":[94],"solves":[98],"generalized":[100],"windows":[106,117],"(GTSP-TW)":[107],"find":[109],"sequence":[111],"targets":[113,185],"corresponding":[115],"visit.":[122],"Given":[123],"such":[124],"sequence,":[126],"low-level":[128,139],"then":[130],"finds":[131,150],"associated":[133],"trajectory.":[135],"To":[136],"solve":[137],"planning":[140],"problem,":[141],"we":[142],"develop":[143],"new":[145],"called":[147],"FMC*,":[148],"which":[149],"shortest":[152],"path":[153],"on":[154,177,196],"graph":[156,163],"convex":[158],"sets":[159],"(GCS)":[160],"via":[161],"implicit":[162],"pruning":[166],"techniques":[167],"specialized":[168],"problems":[170],"targets.":[173],"test":[175],"FMC*-TSP":[176],"280":[178],"instances":[180],"up":[182],"40":[184],"demonstrate":[187],"median":[190],"runtime":[191],"baseline":[194],"based":[195],"prior":[197],"work.":[198]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-06-13T07:54:00.901334","created_date":"2025-10-10T00:00:00"}