{"id":"https://openalex.org/W7165798738","doi":"https://doi.org/10.48550/arxiv.2606.24462","title":"Varying Bundle Size Reactive Multi-Task Assignment using Selective Cost Estimation for Multi-Agent Systems","display_name":"Varying Bundle Size Reactive Multi-Task Assignment using Selective Cost Estimation for Multi-Agent Systems","publication_year":2026,"publication_date":"2026-06-23","ids":{"openalex":"https://openalex.org/W7165798738","doi":"https://doi.org/10.48550/arxiv.2606.24462"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.24462","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.24462","pdf_url":null,"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":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.24462","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049008098","display_name":"Niklas Dahlquist","orcid":"https://orcid.org/0000-0003-3498-3765"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dahlquist, Niklas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050545342","display_name":"Shridhar Velhal","orcid":"https://orcid.org/0000-0002-6906-653X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Velhal, Shridhar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5139284541","display_name":"George Nikolakopoulos","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nikolakopoulos, George","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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.2402999997138977,"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"}},"topics":[{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.2402999997138977,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.2159000039100647,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.09960000216960907,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/bundle","display_name":"Bundle","score":0.8044999837875366},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6248999834060669},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5748000144958496},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5202999711036682},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4950000047683716},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48899999260902405},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.47600001096725464},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.3569999933242798}],"concepts":[{"id":"https://openalex.org/C2778134712","wikidata":"https://www.wikidata.org/wiki/Q1047307","display_name":"Bundle","level":2,"score":0.8044999837875366},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6492000222206116},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6272000074386597},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6248999834060669},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5748000144958496},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5202999711036682},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4950000047683716},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48899999260902405},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.47600001096725464},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.3569999933242798},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3483999967575073},{"id":"https://openalex.org/C179458375","wikidata":"https://www.wikidata.org/wiki/Q1020763","display_name":"Bundle adjustment","level":3,"score":0.32280001044273376},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3043000102043152},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30309998989105225},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.2973000109195709},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.29490000009536743},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.29170000553131104},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.2736999988555908},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2635999917984009},{"id":"https://openalex.org/C93983250","wikidata":"https://www.wikidata.org/wiki/Q795053","display_name":"Cost estimate","level":2,"score":0.25929999351501465}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.24462","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.24462","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.24462","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.24462","pdf_url":null,"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,56,65,71,95,105,110],"scalable":[4],"framework":[5,131,146],"for":[6,38,49],"multi-robot":[7],"task":[8,15,141,152],"allocation":[9,153],"in":[10,94,125,158],"complex":[11],"environments":[12,127],"where":[13],"estimating":[14],"execution":[16],"costs":[17],"is":[18,47,132,147],"computationally":[19],"expensive.":[20],"While":[21],"combinatorial":[22],"auction-based":[23,140],"approaches":[24],"offer":[25],"reliable":[26],"solutions,":[27],"the":[28,81,90,120,130,136,144,163],"exponential":[29],"complexity":[30],"of":[31,138],"bundle":[32,60,82,156],"generation":[33,61],"typically":[34],"renders":[35],"them":[36],"intractable":[37],"real-time":[39],"reactive":[40,139,151],"applications,":[41],"particularly":[42],"when":[43],"accurate":[44],"path":[45,86],"planning":[46,87],"required":[48],"cost":[50,168],"validation.":[51],"We":[52],"address":[53],"this":[54],"through":[55],"distributed,":[57],"two-stage":[58],"multi-fidelity":[59],"approach.":[62],"Agents":[63],"utilize":[64],"local":[66],"search":[67],"tree":[68],"guided":[69],"by":[70],"low-fidelity":[72],"heuristic":[73],"(such":[74],"as":[75],"euclidean":[76],"distance)":[77],"to":[78,89,104,114,134,149],"rapidly":[79],"explore":[80],"space,":[83],"applying":[84],"high-fidelity":[85],"only":[88],"most":[91],"promising":[92],"candidates":[93],"best-first":[96],"manner.":[97],"These":[98],"refined":[99],"bids":[100],"are":[101],"then":[102],"submitted":[103],"central":[106],"coordinator":[107],"that":[108,129],"solves":[109],"set":[111],"packing":[112],"problem":[113],"ensure":[115],"global":[116],"feasibility":[117],"and":[118,166],"maximize":[119],"overall":[121],"utility.":[122],"Simulation":[123],"results":[124],"multiple":[126,159],"demonstrate":[128],"able":[133],"improve":[135],"performance":[137],"allocation.":[142],"Overall,":[143],"presented":[145],"shown":[148],"enable":[150],"with":[154],"dynamic":[155],"sizes":[157],"settings":[160],"without":[161],"exposing":[162],"agents'":[164],"state":[165],"internal":[167],"estimation":[169],"models.":[170]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-25T00:00:00"}