{"id":"https://openalex.org/W4405785365","doi":"https://doi.org/10.1109/iros58592.2024.10802374","title":"A Mixed-Integer Conic Program for the Moving-Target Traveling Salesman Problem based on a Graph of Convex Sets","display_name":"A Mixed-Integer Conic Program for the Moving-Target Traveling Salesman Problem based on a Graph of Convex Sets","publication_year":2024,"publication_date":"2024-10-14","ids":{"openalex":"https://openalex.org/W4405785365","doi":"https://doi.org/10.1109/iros58592.2024.10802374"},"language":"en","primary_location":{"id":"doi:10.1109/iros58592.2024.10802374","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros58592.2024.10802374","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","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,Department of Mechanical Engineering,College Station,TX,77843-3123"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Texas A&M University,Department of 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/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,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University,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,Department of Mechanical Engineering,College Station,TX,77843-3123"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Texas A&M University,Department of Mechanical 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":["Carnegie Mellon University,Pittsburgh,PA,USA,15213"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University,Pittsburgh,PA,USA,15213","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":7.496,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.97425074,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"8847","last_page":"8853"},"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.9894000291824341,"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.9894000291824341,"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.9786999821662903,"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.8010462522506714},{"id":"https://openalex.org/keywords/conic-section","display_name":"Conic section","score":0.6856644153594971},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5537355542182922},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5414398312568665},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4999971389770508},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47521573305130005},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4673227369785309},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46577876806259155},{"id":"https://openalex.org/keywords/conic-optimization","display_name":"Conic optimization","score":0.4302467107772827},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37368452548980713},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.31916534900665283},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.25347989797592163}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8010462522506714},{"id":"https://openalex.org/C108598597","wikidata":"https://www.wikidata.org/wiki/Q124255","display_name":"Conic section","level":2,"score":0.6856644153594971},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5537355542182922},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5414398312568665},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4999971389770508},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47521573305130005},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4673227369785309},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46577876806259155},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.4302467107772827},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37368452548980713},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.31916534900665283},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.25347989797592163},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros58592.2024.10802374","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros58592.2024.10802374","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.4099999964237213,"id":"https://metadata.un.org/sdg/8"}],"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/W6744655802","https://openalex.org/W6772385949"],"related_works":["https://openalex.org/W4323321439","https://openalex.org/W3124564720","https://openalex.org/W2952330476","https://openalex.org/W2180827833","https://openalex.org/W4293777484","https://openalex.org/W2588229150","https://openalex.org/W2031269429","https://openalex.org/W2047688435","https://openalex.org/W1984447777","https://openalex.org/W2488107756"],"abstract_inverted_index":{"This":[0],"paper":[1],"introduces":[2],"a":[3,21,30,33,83,140],"new":[4],"formulation":[5,50,96,106,116,158],"that":[6,27,56,114,148],"finds":[7],"the":[8,11,47,53,58,69,79,98,108,118,149,153,164,167,170],"optimum":[9],"for":[10,24,107,120,163],"Moving-Target":[12],"Traveling":[13],"Salesman":[14],"Problem":[15],"(MT-TSP),":[16],"which":[17],"seeks":[18],"to":[19,46,77,89,124,129,139],"find":[20],"shortest":[22,80],"path":[23,81],"an":[25],"agent,":[26],"starts":[28],"at":[29],"depot,":[31],"visits":[32],"set":[34],"of":[35,85,132,156],"moving":[36],"targets":[37,59],"exactly":[38],"once":[39],"within":[40,68,82],"their":[41,63],"assigned":[42],"time-windows,":[43],"and":[44,137],"returns":[45],"depot.":[48],"The":[49,73,110],"relies":[51],"on":[52],"key":[54],"idea":[55],"when":[57],"move":[60],"along":[61],"lines,":[62],"trajectories":[64],"become":[65],"convex":[66,86,154],"sets":[67],"space-time":[70],"coordinate":[71],"system.":[72],"problem":[74],"then":[75],"reduces":[76],"finding":[78],"graph":[84],"sets,":[87],"subject":[88],"some":[90],"speed":[91],"constraints.":[92],"We":[93,145],"compare":[94],"our":[95,115,157],"with":[97,122,127],"current":[99],"state-of-the-art":[100],"Mixed":[101],"Integer":[102],"Conic":[103],"Program":[104],"(MICP)":[105],"MT-TSP.":[109],"experimental":[111],"results":[112],"show":[113,147],"outperforms":[117],"MICP":[119],"instances":[121],"up":[123,128,138],"20":[125],"targets,":[126],"two":[130],"orders":[131],"magnitude":[133],"reduction":[134],"in":[135],"runtime,":[136],"60%":[141],"tighter":[142,161],"optimality":[143],"gap.":[144],"also":[146],"solution":[150],"cost":[151],"from":[152,169],"relaxation":[155],"provides":[159],"significantly":[160],"lower-bounds":[162],"MT-TSP":[165],"than":[166],"ones":[168],"MICP.":[171]},"counts_by_year":[{"year":2025,"cited_by_count":6}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}