{"id":"https://openalex.org/W4415443978","doi":"https://doi.org/10.1109/lra.2025.3623912","title":"CP-MILP: Mixed Integer Linear Programming for Multi-Agent Motion Planning With Linear Dynamics","display_name":"CP-MILP: Mixed Integer Linear Programming for Multi-Agent Motion Planning With Linear Dynamics","publication_year":2025,"publication_date":"2025-10-22","ids":{"openalex":"https://openalex.org/W4415443978","doi":"https://doi.org/10.1109/lra.2025.3623912"},"language":null,"primary_location":{"id":"doi:10.1109/lra.2025.3623912","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2025.3623912","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766","2377-3774"],"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 Robotics and Automation Letters","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/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":["Global College, Shanghai Jiao Tong University, Shanghai, China","Global College, Shanghai Jiao Tong University, China"],"raw_orcid":"https://orcid.org/0000-0003-2880-8653","affiliations":[{"raw_affiliation_string":"Global College, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]},{"raw_affiliation_string":"Global College, Shanghai Jiao Tong University, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","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/A5011120967","display_name":"Shizhe Zhao","orcid":null},"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":"Shizhe Zhao","raw_affiliation_strings":["Global College, Shanghai Jiao Tong University, Shanghai, China","Global College, Shanghai Jiao Tong University, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Global College, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]},{"raw_affiliation_string":"Global College, 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, 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"],"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"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0916,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.79437245,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":98},"biblio":{"volume":"10","issue":"12","first_page":"12573","last_page":"12579"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9955999851226807,"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.9955999851226807,"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.9830999970436096,"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.9765999913215637,"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/integer-programming","display_name":"Integer programming","score":0.671500027179718},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6589000225067139},{"id":"https://openalex.org/keywords/perspective","display_name":"Perspective (graphical)","score":0.5835999846458435},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5328999757766724},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5020999908447266},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.4260999858379364},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.40049999952316284},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.3862999975681305}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.671500027179718},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6589000225067139},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6338000297546387},{"id":"https://openalex.org/C12713177","wikidata":"https://www.wikidata.org/wiki/Q1900281","display_name":"Perspective (graphical)","level":2,"score":0.5835999846458435},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5328999757766724},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5080000162124634},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5020999908447266},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4260999858379364},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.40049999952316284},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3862999975681305},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.36980000138282776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3578999936580658},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.32030001282691956},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.3183000087738037},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.3100999891757965},{"id":"https://openalex.org/C145565327","wikidata":"https://www.wikidata.org/wiki/Q852514","display_name":"Motion control","level":3,"score":0.28459998965263367},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.26759999990463257},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.2669000029563904},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.26510000228881836},{"id":"https://openalex.org/C2777909354","wikidata":"https://www.wikidata.org/wiki/Q1386523","display_name":"Production planning","level":3,"score":0.25600001215934753}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2025.3623912","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2025.3623912","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766","2377-3774"],"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 Robotics and Automation Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1325809076","display_name":null,"funder_award_id":"24ZR1435900","funder_id":"https://openalex.org/F4320309612","funder_display_name":"Natural Science Foundation of Shanghai"},{"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"},{"id":"https://openalex.org/F4320309612","display_name":"Natural Science Foundation of Shanghai","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1601512022","https://openalex.org/W1964462572","https://openalex.org/W1989407213","https://openalex.org/W1995356523","https://openalex.org/W2002440441","https://openalex.org/W2097867042","https://openalex.org/W2142943472","https://openalex.org/W2801990756","https://openalex.org/W2912551019","https://openalex.org/W2912668883","https://openalex.org/W2963095472","https://openalex.org/W2964997335","https://openalex.org/W2965230525","https://openalex.org/W2972941110","https://openalex.org/W3021841679","https://openalex.org/W3040228407","https://openalex.org/W3105161877","https://openalex.org/W3123076862","https://openalex.org/W3134901932","https://openalex.org/W3183413118","https://openalex.org/W4200398046","https://openalex.org/W4229007520","https://openalex.org/W4312697252","https://openalex.org/W4313005818","https://openalex.org/W4381573173","https://openalex.org/W4381785454","https://openalex.org/W4405785365","https://openalex.org/W4405785613","https://openalex.org/W4409364570","https://openalex.org/W4414432611","https://openalex.org/W7084147964"],"related_works":[],"abstract_inverted_index":{"This":[0,110],"paper":[1,111],"considers":[2],"a":[3,73,85,114,119],"Multi-Agent":[4],"Motion":[5],"Planning":[6],"(MAMP)":[7],"problem":[8],"that":[9,96],"seeks":[10],"collision-free":[11],"paths":[12],"for":[13,78],"multiple":[14],"agents":[15,33],"from":[16],"their":[17],"respective":[18],"start":[19],"to":[20,88,123,127,157,165,167],"goal":[21],"locations":[22],"among":[23],"static":[24],"obstacles,":[25],"while":[26],"minimizing":[27],"the":[28,32,94,108,124,131,136,144],"arrival":[29],"times":[30],"of":[31,69,130,146,161],"with":[34,58],"linear":[35,75],"dynamics.":[36],"Among":[37],"existing":[38],"approaches":[39,62],"such":[40],"as":[41],"graph":[42],"search,":[43],"sampling,":[44],"and":[45,67,103,134,149],"trajectory":[46],"optimization,":[47],"mixed":[48],"integer":[49],"programming":[50],"(MIP)":[51],"can":[52],"often":[53],"find":[54],"high":[55],"quality":[56],"solutions":[57],"optimality":[59],"guarantees.":[60],"MIP":[61],"have":[63],"been":[64],"investigated":[65],"extensively":[66],"many":[68],"them":[70],"build":[71],"upon":[72],"mixed-integer":[74],"program":[76],"(MILP)":[77],"single-agent,":[79],"which":[80],"depends":[81],"on":[82],"big-M":[83,98,132],"constraints,":[84,133],"popular":[86],"technique":[87,121],"formulate":[89],"conditional":[90],"constraints.":[91],"We":[92,142],"take":[93],"view":[95],"some":[97,129],"constraints":[99],"there":[100],"are":[101],"unnecessary,":[102],"may":[104],"potentially":[105],"slow":[106],"down":[107],"computation.":[109],"thus":[112],"proposes":[113],"new":[115],"MILP":[116,140],"formulation":[117],"using":[118],"perspective":[120],"related":[122],"control":[125],"terms":[126],"bypass":[128],"hence":[135],"name":[137],"Control":[138],"Perspective":[139],"(CP-MILP).":[141],"analyze":[143],"property":[145],"our":[147],"CP-MILP":[148,153],"experimental":[150],"results":[151],"show":[152],"sometimes":[154],"requires":[155],"up":[156],"near":[158],"an":[159],"order":[160],"magnitude":[162],"less":[163],"runtime":[164],"solve":[166],"optimality.":[168]},"counts_by_year":[{"year":2026,"cited_by_count":2}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-24T00:00:00"}