{"id":"https://openalex.org/W4414432611","doi":"https://doi.org/10.1109/case58245.2025.11163754","title":"A Mixed-Integer Conic Program for the Multi-Agent Moving-Target Traveling Salesman Problem","display_name":"A Mixed-Integer Conic Program for the Multi-Agent Moving-Target Traveling Salesman Problem","publication_year":2025,"publication_date":"2025-08-17","ids":{"openalex":"https://openalex.org/W4414432611","doi":"https://doi.org/10.1109/case58245.2025.11163754"},"language":"en","primary_location":{"id":"doi:10.1109/case58245.2025.11163754","is_oa":false,"landing_page_url":"https://doi.org/10.1109/case58245.2025.11163754","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 21st International Conference on Automation Science and Engineering (CASE)","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/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,Mechanical Engineering,College Station,TX,77843-3123"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Texas A&M University,Mechanical Engineering,College Station,TX,77843-3123","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/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":"Zhongqiang Ren","raw_affiliation_strings":["Robotics Institute, Carnegie Mellon University,Pittsburgh,PA,USA,15213"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Robotics Institute, Carnegie Mellon University,Pittsburgh,PA,USA,15213","institution_ids":["https://openalex.org/I74973139"]}]},{"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,Mechanical Engineering, and Computer Science and Engineering,College Station,TX,77843-3123"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Texas A&M University,Mechanical Engineering, and Computer Science and Engineering,College Station,TX,77843-3123","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, Carnegie Mellon University,Pittsburgh,PA,USA,15213"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Robotics Institute, Carnegie Mellon University,Pittsburgh,PA,USA,15213","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.2561,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.96021559,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"492","last_page":"498"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9900000095367432,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9900000095367432,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9807999730110168,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T10328","display_name":"Supply Chain and Inventory Management","score":0.9710000157356262,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8671000003814697},{"id":"https://openalex.org/keywords/conic-section","display_name":"Conic section","score":0.79830002784729},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.635200023651123},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5264000296592712},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4927999973297119},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.4896000027656555},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.4650000035762787},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.45500001311302185}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8671000003814697},{"id":"https://openalex.org/C108598597","wikidata":"https://www.wikidata.org/wiki/Q124255","display_name":"Conic section","level":2,"score":0.79830002784729},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6656000018119812},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.635200023651123},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5964999794960022},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5264000296592712},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4927999973297119},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.4896000027656555},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.4650000035762787},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.45500001311302185},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.42320001125335693},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.41620001196861267},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.391400009393692},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34630000591278076},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3379000127315521},{"id":"https://openalex.org/C184879717","wikidata":"https://www.wikidata.org/wiki/Q1374523","display_name":"Nearest neighbour algorithm","level":3,"score":0.3327000141143799},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.2858000099658966},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.2799000144004822},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26510000228881836},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.25270000100135803}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/case58245.2025.11163754","is_oa":false,"landing_page_url":"https://doi.org/10.1109/case58245.2025.11163754","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 21st International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"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":26,"referenced_works":["https://openalex.org/W2006236904","https://openalex.org/W2009945360","https://openalex.org/W2028148936","https://openalex.org/W2073089651","https://openalex.org/W2075852435","https://openalex.org/W2076422387","https://openalex.org/W2090486865","https://openalex.org/W2139011629","https://openalex.org/W2167550287","https://openalex.org/W2291686912","https://openalex.org/W2303363477","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/W3123076862","https://openalex.org/W4236555636","https://openalex.org/W4239409853","https://openalex.org/W4241275976","https://openalex.org/W4303628462","https://openalex.org/W4315490215","https://openalex.org/W4405785365","https://openalex.org/W4412403847"],"related_works":[],"abstract_inverted_index":{"The":[0],"Moving-Target":[1,55],"Traveling":[2,56],"Salesman":[3,57],"Problem":[4,58],"(MT-TSP)":[5],"seeks":[6],"a":[7,16,20,45,60,81,89,93],"shortest":[8],"path":[9],"for":[10,52,78],"an":[11],"agent":[12],"that":[13,101],"starts":[14],"at":[15],"stationary":[17],"depot,":[18],"visits":[19],"set":[21],"of":[22,30,62,112],"moving":[23],"targets":[24],"exactly":[25],"once,":[26],"each":[27],"within":[28],"one":[29],"their":[31],"respective":[32],"time":[33],"windows,":[34],"and":[35,117],"returns":[36],"to":[37,109],"the":[38,53,63,73,105],"depot.":[39],"In":[40],"this":[41],"paper,":[42],"we":[43],"introduce":[44],"new":[46,94],"Mixed-Integer":[47,83],"Conic":[48],"Program":[49,85],"(MICP)":[50],"formulation":[51,77,103],"Multi-Agent":[54],"(MA-MT-TSP),":[59],"generalization":[61],"MT-TSP":[64],"involving":[65],"multiple":[66],"agents.":[67],"Our":[68],"approach":[69],"begins":[70],"by":[71,88],"restating":[72],"current":[74],"state-of-the-art":[75],"MICP":[76],"MA-MT-TSP":[79],"as":[80],"Nonconvex":[82],"Nonlinear":[84],"(MINLP),":[86],"followed":[87],"novel":[90],"reformulation":[91],"into":[92],"MICP.":[95],"We":[96],"present":[97],"computational":[98],"results":[99],"demonstrating":[100],"our":[102],"outperforms":[104],"state-of-the-art,":[106],"achieving":[107],"up":[108],"two":[110],"orders":[111],"magnitude":[113],"reduction":[114],"in":[115,121],"runtime,":[116],"over":[118],"90%":[119],"improvement":[120],"optimality":[122],"gap.":[123]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}