{"id":"https://openalex.org/W4412403847","doi":"https://doi.org/10.1109/tro.2025.3588754","title":"C$^{*}$: A New Bounding Approach for the Moving-Target Traveling Salesman Problem","display_name":"C$^{*}$: A New Bounding Approach for the Moving-Target Traveling Salesman Problem","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4412403847","doi":"https://doi.org/10.1109/tro.2025.3588754"},"language":"en","primary_location":{"id":"doi:10.1109/tro.2025.3588754","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tro.2025.3588754","pdf_url":null,"source":{"id":"https://openalex.org/S144620930","display_name":"IEEE Transactions on Robotics","issn_l":"1552-3098","issn":["1552-3098","1546-1904","1941-0468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Robotics","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/A5104212956","display_name":"Allen George Philip","orcid":null},"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":"Allen George Philip","raw_affiliation_strings":["Texas A&M University, College Station, TX, USA"],"raw_orcid":"https://orcid.org/0009-0004-4509-9232","affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"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":["Shanghai Jiao Tong University, Shanghai, China","Shanghai Jiao Tong University, 800 Dongchuan Road, Shanghai, China"],"raw_orcid":"https://orcid.org/0000-0003-2880-8653","affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]},{"raw_affiliation_string":"Shanghai Jiao Tong University, 800 Dongchuan Road, 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&M University, College Station, TX, USA"],"raw_orcid":"https://orcid.org/0000-0002-9223-7456","affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX, USA","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":["Carnegie Mellon University, Pittsburgh, PA, USA","Carnegie Mellon University, 5000 Forbes Ave., Pittsburgh, PA, USA"],"raw_orcid":"https://orcid.org/0000-0002-5434-7945","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University, 5000 Forbes Ave., Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.8507,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.94529783,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"41","issue":null,"first_page":"4663","last_page":"4678"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9300000071525574,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9300000071525574,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9086999893188477,"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.884230375289917},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.740038275718689},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5632550120353699},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.5400780439376831},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.5257835388183594},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.46906256675720215},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.45663005113601685},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43768078088760376},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3605602979660034},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.31710195541381836},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26934099197387695},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19333767890930176}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.884230375289917},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.740038275718689},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5632550120353699},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.5400780439376831},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5257835388183594},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.46906256675720215},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.45663005113601685},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43768078088760376},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3605602979660034},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.31710195541381836},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26934099197387695},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19333767890930176}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tro.2025.3588754","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tro.2025.3588754","pdf_url":null,"source":{"id":"https://openalex.org/S144620930","display_name":"IEEE Transactions on Robotics","issn_l":"1552-3098","issn":["1552-3098","1546-1904","1941-0468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Robotics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.49000000953674316,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[{"id":"https://openalex.org/G6210591215","display_name":"Collaborative Research: A Comprehensive Dynamic Search Framework for Asynchronous Multi-Objective Multi-Agent Planning","funder_award_id":"2120529","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7481737389","display_name":"Collaborative Research: A Comprehensive Dynamic Search Framework for Asynchronous Multi-Objective Multi-Agent Planning","funder_award_id":"2120219","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":35,"referenced_works":["https://openalex.org/W1517470327","https://openalex.org/W2006236904","https://openalex.org/W2009945360","https://openalex.org/W2017708378","https://openalex.org/W2028148936","https://openalex.org/W2039766013","https://openalex.org/W2073089651","https://openalex.org/W2075852435","https://openalex.org/W2076422387","https://openalex.org/W2083974195","https://openalex.org/W2090486865","https://openalex.org/W2139011629","https://openalex.org/W2163557644","https://openalex.org/W2167550287","https://openalex.org/W2291686912","https://openalex.org/W2303363477","https://openalex.org/W2313274380","https://openalex.org/W2614564353","https://openalex.org/W2763301477","https://openalex.org/W2796035444","https://openalex.org/W2894127305","https://openalex.org/W2939063477","https://openalex.org/W2980307580","https://openalex.org/W2998904702","https://openalex.org/W3092744298","https://openalex.org/W4236555636","https://openalex.org/W4239409853","https://openalex.org/W4241275976","https://openalex.org/W4303628462","https://openalex.org/W4315490215","https://openalex.org/W4367043294","https://openalex.org/W4383873528","https://openalex.org/W4405785365","https://openalex.org/W6744655802","https://openalex.org/W6772385949"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2361554335","https://openalex.org/W4220987199","https://openalex.org/W2171568915","https://openalex.org/W2362402143","https://openalex.org/W2265604726","https://openalex.org/W2033053473","https://openalex.org/W8433631"],"abstract_inverted_index":{"We":[0,101,118],"introduce":[1],"a":[2,48,73,80,92,165],"new":[3,93],"bounding":[4,70],"approach":[5,21],"called":[6,95],"Continuity*":[7],"(C$^{*}$),":[8],"which":[9],"provides":[10],"optimality":[11],"guarantees":[12],"for":[13,105,108,128,178,217],"the":[14,23,27,32,40,56,69,83,96,109,122,129,138,151,174,179,182,202,215,218],"Moving-Target":[15],"Traveling":[16,75],"Salesman":[17,76],"Problem":[18,77],"(MT-TSP).":[19],"Our":[20],"relaxes":[22],"continuity":[24],"constraints":[25],"on":[26,79,143,187,196,205],"agent's":[28],"tour":[29],"by":[30],"partitioning":[31],"targets'":[33],"trajectories":[34],"into":[35],"smaller":[36],"segments.":[37],"This":[38,63],"allows":[39],"agent":[41],"to":[42,67,113,136,147],"arrive":[43],"at":[44],"any":[45,53],"point":[46,54],"within":[47,212],"segment":[49,58],"and":[50,191],"depart":[51],"from":[52],"in":[55],"same":[57],"when":[59],"visiting":[60],"each":[61],"target.":[62],"formulation":[64],"enables":[65],"us":[66],"pose":[68],"problem":[71,94],"as":[72],"Generalized":[74],"(GTSP)":[78],"graph,":[81],"where":[82,154],"cost":[84],"of":[85,116,140],"traveling":[86],"along":[87,157],"an":[88],"edge":[89],"requires":[90],"solving":[91],"Shortest":[97],"Feasible":[98],"Travel":[99],"(SFT).":[100],"present":[102],"various":[103],"methods":[104],"computing":[106],"bounds":[107],"SFT":[110],"problem,":[111],"leading":[112],"several":[114],"variants":[115],"C$^{*}$.":[117],"first":[119],"prove":[120],"that":[121],"proposed":[123],"algorithms":[124],"provide":[125,133],"valid":[126],"lower-bounds":[127,216],"MT-TSP.":[130,180],"Additionally,":[131],"we":[132,160],"computational":[134],"results":[135],"validate":[137],"performance":[139],"all":[141],"C$^{*}$variants":[142,163],"instances":[144,188,197],"with":[145,164,189,198],"up":[146],"15":[148,199],"targets.":[149,200],"For":[150,201],"special":[152],"case":[153],"targets":[155],"move":[156],"straight":[158],"lines,":[159],"compare":[161],"our":[162,207],"mixed-integer":[166],"Second":[167],"Order":[168],"Conic":[169],"Program":[170],"(SOCP)":[171],"based":[172],"method,":[173],"current":[175],"state-of-the-art":[176],"solver":[177],"While":[181],"SOCP-based":[183],"method":[184],"performs":[185],"well":[186],"5":[190],"10":[192],"targets,":[193],"C$^{*}$outperforms":[194],"it":[195],"general":[203],"case,":[204],"average,":[206],"approaches":[208],"find":[209],"feasible":[210],"solutions":[211],"approximately":[213],"4.5$\\%$of":[214],"tested":[219],"instances.":[220]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}