{"id":"https://openalex.org/W4414432967","doi":"https://doi.org/10.1109/case58245.2025.11164027","title":"A MILP-Based Solution to Multi-Agent Motion Planning and Collision Avoidance in Constrained Environments","display_name":"A MILP-Based Solution to Multi-Agent Motion Planning and Collision Avoidance in Constrained Environments","publication_year":2025,"publication_date":"2025-08-17","ids":{"openalex":"https://openalex.org/W4414432967","doi":"https://doi.org/10.1109/case58245.2025.11164027"},"language":"en","primary_location":{"id":"doi:10.1109/case58245.2025.11164027","is_oa":false,"landing_page_url":"https://doi.org/10.1109/case58245.2025.11164027","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2506.21982","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5094207471","display_name":"Akshay Jaitly","orcid":null},"institutions":[{"id":"https://openalex.org/I107077323","display_name":"Worcester Polytechnic Institute","ror":"https://ror.org/05ejpqr48","country_code":"US","type":"education","lineage":["https://openalex.org/I107077323"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Akshay Jaitly","raw_affiliation_strings":["Worcester Polytechnic Institute,Robotics Engineering Department,Worcester,MA,USA,01609"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Worcester Polytechnic Institute,Robotics Engineering Department,Worcester,MA,USA,01609","institution_ids":["https://openalex.org/I107077323"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Jack Cline","orcid":null},"institutions":[{"id":"https://openalex.org/I149919469","display_name":"California Polytechnic State University","ror":"https://ror.org/001gpfp45","country_code":"US","type":"education","lineage":["https://openalex.org/I149919469"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jack Cline","raw_affiliation_strings":["California Polytechnic State University,Electrical Engineering Department,San Luis Obispo,CA,USA,93407"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"California Polytechnic State University,Electrical Engineering Department,San Luis Obispo,CA,USA,93407","institution_ids":["https://openalex.org/I149919469"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084689056","display_name":"Siavash Farzan","orcid":"https://orcid.org/0000-0001-6415-5560"},"institutions":[{"id":"https://openalex.org/I149919469","display_name":"California Polytechnic State University","ror":"https://ror.org/001gpfp45","country_code":"US","type":"education","lineage":["https://openalex.org/I149919469"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Siavash Farzan","raw_affiliation_strings":["California Polytechnic State University,Electrical Engineering Department,San Luis Obispo,CA,USA,93407"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"California Polytechnic State University,Electrical Engineering Department,San Luis Obispo,CA,USA,93407","institution_ids":["https://openalex.org/I149919469"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2200","last_page":"2207"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9991000294685364,"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.9991000294685364,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9717000126838684,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.9708999991416931,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7027000188827515},{"id":"https://openalex.org/keywords/hyperplane","display_name":"Hyperplane","score":0.6592000126838684},{"id":"https://openalex.org/keywords/collision-avoidance","display_name":"Collision avoidance","score":0.6473000049591064},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5921000242233276},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5116999745368958},{"id":"https://openalex.org/keywords/motion","display_name":"Motion (physics)","score":0.510200023651123},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.42419999837875366},{"id":"https://openalex.org/keywords/control-theory","display_name":"Control theory (sociology)","score":0.41110000014305115},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.3662000000476837}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7027000188827515},{"id":"https://openalex.org/C68693459","wikidata":"https://www.wikidata.org/wiki/Q657586","display_name":"Hyperplane","level":2,"score":0.6592000126838684},{"id":"https://openalex.org/C2780864053","wikidata":"https://www.wikidata.org/wiki/Q5147495","display_name":"Collision avoidance","level":3,"score":0.6473000049591064},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5921000242233276},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.578499972820282},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5116999745368958},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.510200023651123},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4499000012874603},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43540000915527344},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.42419999837875366},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.41110000014305115},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.3662000000476837},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.3571000099182129},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.33799999952316284},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.313400000333786},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.31299999356269836},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.3000999987125397},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2867000102996826},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2863999903202057},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.27889999747276306},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.2711000144481659},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.2615000009536743},{"id":"https://openalex.org/C199668693","wikidata":"https://www.wikidata.org/wiki/Q1550329","display_name":"Collision detection","level":3,"score":0.26019999384880066},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.2596000134944916},{"id":"https://openalex.org/C145565327","wikidata":"https://www.wikidata.org/wiki/Q852514","display_name":"Motion control","level":3,"score":0.2556999921798706}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/case58245.2025.11164027","is_oa":false,"landing_page_url":"https://doi.org/10.1109/case58245.2025.11164027","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"},{"id":"pmh:oai:arXiv.org:2506.21982","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2506.21982","pdf_url":"https://arxiv.org/pdf/2506.21982","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2506.21982","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2506.21982","pdf_url":"https://arxiv.org/pdf/2506.21982","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414432967.pdf","grobid_xml":"https://content.openalex.org/works/W4414432967.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1588426517","https://openalex.org/W1989407213","https://openalex.org/W2062731992","https://openalex.org/W2096108718","https://openalex.org/W2128990851","https://openalex.org/W2166316739","https://openalex.org/W2168424616","https://openalex.org/W2505968561","https://openalex.org/W2767578104","https://openalex.org/W2787876816","https://openalex.org/W3123076862","https://openalex.org/W3128894241","https://openalex.org/W4242098452","https://openalex.org/W4297493126","https://openalex.org/W4366493117","https://openalex.org/W4383108947","https://openalex.org/W4386601548","https://openalex.org/W4388692454","https://openalex.org/W4405778909"],"related_works":[],"abstract_inverted_index":{"We":[0,67],"propose":[1],"a":[2,19,32,49],"mixed-integer":[3],"linear":[4],"program":[5],"(MILP)":[6],"for":[7],"multi-agent":[8,75],"motion":[9],"planning":[10],"that":[11,79],"embeds":[12],"Polytopic":[13],"Action-based":[14],"Motion":[15],"Planning":[16],"(PAAMP)":[17],"into":[18],"sequence-then-solve":[20],"pipeline.":[21],"Region":[22],"sequences":[23],"confine":[24],"each":[25],"agent":[26],"to":[27,44],"adjacent":[28],"convex":[29],"polytopes,":[30],"while":[31],"big-M":[33],"hyperplane":[34],"model":[35],"enforces":[36],"inter-agent":[37],"separation.":[38],"Collision":[39],"constraints":[40],"are":[41],"applied":[42],"only":[43],"agents":[45],"sharing":[46],"or":[47],"neighboring":[48],"region,":[50],"which":[51],"reduces":[52],"binary":[53],"variables":[54],"exponentially":[55],"compared":[56],"with":[57,77],"naive":[58],"formulations.":[59],"An":[60],"L1":[61],"path-length-plus-acceleration":[62],"cost":[63],"yields":[64],"smooth":[65],"trajectories.":[66],"prove":[68],"finite-time":[69],"convergence":[70],"and":[71],"demonstrate":[72],"on":[73],"representative":[74],"scenarios":[76],"obstacles":[78],"our":[80],"formulation":[81],"produces":[82],"collision-free":[83],"trajectories":[84],"an":[85,91],"order":[86],"of":[87],"magnitude":[88],"faster":[89],"than":[90],"unstructured":[92],"MILP":[93],"baseline.":[94]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-27T08:26:11.824852","created_date":"2025-10-10T00:00:00"}