{"id":"https://openalex.org/W7165145318","doi":"https://doi.org/10.48550/arxiv.2606.18516","title":"Task Allocation and Motion Planning in Dynamic, Cluttered Environments via CBBA and Graphs of Convex Sets","display_name":"Task Allocation and Motion Planning in Dynamic, Cluttered Environments via CBBA and Graphs of Convex Sets","publication_year":2026,"publication_date":"2026-06-16","ids":{"openalex":"https://openalex.org/W7165145318","doi":"https://doi.org/10.48550/arxiv.2606.18516"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.18516","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.18516","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.18516","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5138949130","display_name":"Matthew D. Osburn","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Osburn, Matthew D.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015155264","display_name":"Cameron K. Peterson","orcid":"https://orcid.org/0000-0002-6155-765X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Peterson, Cameron K.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5048089224","display_name":"John L. Salmon","orcid":"https://orcid.org/0000-0002-8073-3655"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Salmon, John L.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.8116999864578247,"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.8116999864578247,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.12150000035762787,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.011300000362098217,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/task","display_name":"Task (project management)","score":0.7583000063896179},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6155999898910522},{"id":"https://openalex.org/keywords/rendezvous","display_name":"Rendezvous","score":0.5536999702453613},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.5507000088691711},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5188000202178955},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4422999918460846},{"id":"https://openalex.org/keywords/task-analysis","display_name":"Task analysis","score":0.3855000138282776}],"concepts":[{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.7583000063896179},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6712999939918518},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6155999898910522},{"id":"https://openalex.org/C2779968344","wikidata":"https://www.wikidata.org/wiki/Q3932925","display_name":"Rendezvous","level":3,"score":0.5536999702453613},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.5507000088691711},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5188000202178955},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4422999918460846},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43860000371932983},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.3855000138282776},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3727000057697296},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.367000013589859},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.3555000126361847},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.3440000116825104},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3312000036239624},{"id":"https://openalex.org/C2778134712","wikidata":"https://www.wikidata.org/wiki/Q1047307","display_name":"Bundle","level":2,"score":0.3199999928474426},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3190000057220459},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.30469998717308044},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.2904999852180481},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.2784000039100647},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.26159998774528503},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2581000030040741}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.18516","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.18516","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.18516","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.18516","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.4418334364891052,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Multi-agent":[0],"task":[1,50,80,104,139],"planning":[2,120],"in":[3,111,128,148],"cluttered,":[4],"dynamic":[5,90,155],"environments":[6,91,151],"requires":[7],"assigning":[8],"tasks":[9,22],"to":[10,59,121,125],"agents":[11,124],"while":[12],"simultaneously":[13],"determining":[14],"safe,":[15],"time-efficient":[16],"trajectories":[17,88],"through":[18,89],"the":[19,73,99,123,129,143],"environment.":[20,114],"When":[21],"are":[23],"dynamic,":[24],"such":[25],"as":[26],"rendezvous":[27],"objectives,":[28],"allocation":[29,118],"decisions":[30],"depend":[31],"not":[32],"only":[33],"on":[34,45],"which":[35,62],"agent":[36],"is":[37],"best":[38],"suited":[39],"for":[40,69,78,138],"a":[41,57,93,112],"task,":[42],"but":[43],"also":[44],"when":[46],"and":[47,119,133,154],"where":[48],"that":[49],"can":[51],"be":[52],"reached.":[53],"This":[54],"paper":[55],"presents":[56],"solution":[58],"this":[60],"problem,":[61],"combines":[63],"Graphs":[64],"of":[65,145],"Convex":[66],"Sets":[67],"(GCS)":[68],"trajectory":[70],"optimization":[71],"with":[72,152],"Consensus-Based":[74],"Bundle":[75],"Algorithm":[76],"(CBBA)":[77],"distributed":[79],"allocation.":[81],"In":[82],"our":[83,146],"approach,":[84],"GCS":[85],"finds":[86],"optimal":[87],"using":[92],"time-extended":[94],"(3D+time)":[95],"configuration":[96,131],"space.":[97],"At":[98],"same":[100],"time,":[101],"CBBA":[102],"coordinates":[103],"assignments":[105],"across":[106],"agents,":[107],"enabling":[108],"informed":[109],"decision-making":[110],"moving":[113],"We":[115,141],"then":[116],"connect":[117],"allow":[122],"avoid":[126],"collisions":[127],"3D+time":[130],"space":[132],"provide":[134],"accurate":[135],"time":[136],"estimates":[137],"completion.":[140],"demonstrate":[142],"effectiveness":[144],"approach":[147],"simulated":[149],"cluttered":[150],"static":[153],"tasks.":[156]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-19T00:00:00"}