{"id":"https://openalex.org/W3138187926","doi":"https://doi.org/10.1007/s42979-021-00523-w","title":"Anytime and Efficient Multi-agent Coordination for Disaster Response","display_name":"Anytime and Efficient Multi-agent Coordination for Disaster Response","publication_year":2021,"publication_date":"2021-03-23","ids":{"openalex":"https://openalex.org/W3138187926","doi":"https://doi.org/10.1007/s42979-021-00523-w","mag":"3138187926"},"language":"en","primary_location":{"id":"doi:10.1007/s42979-021-00523-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s42979-021-00523-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s42979-021-00523-w.pdf","source":{"id":"https://openalex.org/S4210174798","display_name":"SN Computer Science","issn_l":"2661-8907","issn":["2661-8907","2662-995X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SN Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s42979-021-00523-w.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062799933","display_name":"Luca Capezzuto","orcid":"https://orcid.org/0000-0003-4404-0998"},"institutions":[{"id":"https://openalex.org/I43439940","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543","country_code":"GB","type":"education","lineage":["https://openalex.org/I43439940"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Luca Capezzuto","raw_affiliation_strings":["School of Electronics and Computer Science, University of Southampton, Southampton, UK"],"raw_orcid":"https://orcid.org/0000-0003-4404-0998","affiliations":[{"raw_affiliation_string":"School of Electronics and Computer Science, University of Southampton, Southampton, UK","institution_ids":["https://openalex.org/I43439940"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046917969","display_name":"Danesh Tarapore","orcid":"https://orcid.org/0000-0002-3226-6861"},"institutions":[{"id":"https://openalex.org/I43439940","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543","country_code":"GB","type":"education","lineage":["https://openalex.org/I43439940"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Danesh Tarapore","raw_affiliation_strings":["School of Electronics and Computer Science, University of Southampton, Southampton, UK"],"raw_orcid":"https://orcid.org/0000-0002-3226-6861","affiliations":[{"raw_affiliation_string":"School of Electronics and Computer Science, University of Southampton, Southampton, UK","institution_ids":["https://openalex.org/I43439940"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065527041","display_name":"Sarvapali D. Ramchurn","orcid":"https://orcid.org/0000-0001-9686-4302"},"institutions":[{"id":"https://openalex.org/I43439940","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543","country_code":"GB","type":"education","lineage":["https://openalex.org/I43439940"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Sarvapali D. Ramchurn","raw_affiliation_strings":["School of Electronics and Computer Science, University of Southampton, Southampton, UK"],"raw_orcid":"https://orcid.org/0000-0001-9686-4302","affiliations":[{"raw_affiliation_string":"School of Electronics and Computer Science, University of Southampton, Southampton, UK","institution_ids":["https://openalex.org/I43439940"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5046917969","https://openalex.org/A5062799933","https://openalex.org/A5065527041"],"corresponding_institution_ids":["https://openalex.org/I43439940"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":{"value":2890,"currency":"USD","value_usd":2890},"fwci":0.5211,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.6656498,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"2","issue":"3","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"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/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9948999881744385,"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/T11182","display_name":"Auction Theory and Applications","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.764859676361084},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5436061024665833},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5034143328666687},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.476483553647995},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.43503034114837646},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3754546344280243},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.34284865856170654},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2015250027179718},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1368941068649292}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.764859676361084},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5436061024665833},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5034143328666687},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.476483553647995},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.43503034114837646},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3754546344280243},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.34284865856170654},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2015250027179718},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1368941068649292},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s42979-021-00523-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s42979-021-00523-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s42979-021-00523-w.pdf","source":{"id":"https://openalex.org/S4210174798","display_name":"SN Computer Science","issn_l":"2661-8907","issn":["2661-8907","2662-995X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SN Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:eprints.soton.ac.uk:467373","is_oa":true,"landing_page_url":"http://doi.org/10.1007/s42979-021-00523-w>).","pdf_url":"https://eprints.soton.ac.uk/467373/1/Capezzuto2021_Article_AnytimeAndEfficientMulti_agent.pdf","source":{"id":"https://openalex.org/S4306401019","display_name":"ePrints Soton (University of Southampton)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I43439940","host_organization_name":"University of Southampton","host_organization_lineage":["https://openalex.org/I43439940"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"}],"best_oa_location":{"id":"doi:10.1007/s42979-021-00523-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s42979-021-00523-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s42979-021-00523-w.pdf","source":{"id":"https://openalex.org/S4210174798","display_name":"SN Computer Science","issn_l":"2661-8907","issn":["2661-8907","2662-995X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SN Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Climate action","id":"https://metadata.un.org/sdg/13","score":0.7799999713897705}],"awards":[{"id":"https://openalex.org/G3758801431","display_name":null,"funder_award_id":"EP/R030073/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6373853840","display_name":"Rapid fault-recovery strategies for resilient robot swarms","funder_award_id":"EP/R030073/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320320277","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543"},{"id":"https://openalex.org/F4320321048","display_name":"AXA Research Fund","ror":"https://ror.org/02zxqxw53"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3138187926.pdf","grobid_xml":"https://content.openalex.org/works/W3138187926.grobid-xml"},"referenced_works_count":51,"referenced_works":["https://openalex.org/W8822178","https://openalex.org/W42384017","https://openalex.org/W110387391","https://openalex.org/W310113084","https://openalex.org/W1013628759","https://openalex.org/W1019382921","https://openalex.org/W1576380096","https://openalex.org/W1581272738","https://openalex.org/W1600846242","https://openalex.org/W1691433861","https://openalex.org/W1758936897","https://openalex.org/W1950636128","https://openalex.org/W1963938442","https://openalex.org/W1971441460","https://openalex.org/W1972391046","https://openalex.org/W1991237325","https://openalex.org/W1992307689","https://openalex.org/W2002515846","https://openalex.org/W2014979043","https://openalex.org/W2037387582","https://openalex.org/W2039048406","https://openalex.org/W2102152964","https://openalex.org/W2107469507","https://openalex.org/W2114225169","https://openalex.org/W2118826835","https://openalex.org/W2139294243","https://openalex.org/W2146474057","https://openalex.org/W2163316275","https://openalex.org/W2166573642","https://openalex.org/W2201282128","https://openalex.org/W2287429606","https://openalex.org/W2484338577","https://openalex.org/W2528816995","https://openalex.org/W2537545174","https://openalex.org/W2576232503","https://openalex.org/W2615688110","https://openalex.org/W2736978630","https://openalex.org/W2802779358","https://openalex.org/W2885146195","https://openalex.org/W2999446437","https://openalex.org/W3000206786","https://openalex.org/W3036870931","https://openalex.org/W3103899647","https://openalex.org/W3145128584","https://openalex.org/W4211220176","https://openalex.org/W4241021229","https://openalex.org/W4243221775","https://openalex.org/W4246219036","https://openalex.org/W4285719527","https://openalex.org/W6737985389","https://openalex.org/W6990023262"],"related_works":["https://openalex.org/W2961085424","https://openalex.org/W4306674287","https://openalex.org/W4224009465","https://openalex.org/W4286629047","https://openalex.org/W4306321456","https://openalex.org/W4285260836","https://openalex.org/W3046775127","https://openalex.org/W2081647779","https://openalex.org/W3170094116","https://openalex.org/W4205958290"],"abstract_inverted_index":{"Abstract":[0],"The":[1,55],"Coalition":[2,60,119],"Formation":[3,61,120],"with":[4,23,62,76,121,166,225],"Spatial":[5],"and":[6,25,27,114,165,257],"Temporal":[7],"constraints":[8],"Problem":[9],"(CFSTP)":[10],"is":[11,32,74,88,180,242],"a":[12,116,151,218],"multi-agent":[13,97],"task":[14],"allocation":[15],"problem":[16],"where":[17,99,176],"the":[18,28,37,43,48,59,77,138,156,158,177,234,272,278],"tasks":[19,101,196],"are":[20],"spatially":[21],"distributed,":[22],"deadlines":[24],"workloads,":[26],"number":[29,38,44,78],"of":[30,39,45,79,140,211,223,264],"agents":[31,49],"typically":[33],"much":[34],"smaller":[35],"than":[36,197,250],"tasks.":[40],"To":[41],"maximise":[42],"completed":[46],"tasks,":[47],"may":[50],"have":[51],"to":[52,154,160,186,208,261,276],"schedule":[53],"coalitions.":[54],"state-of-the-art":[56,274],"CFSTP":[57],"solver,":[58],"Look-Ahead":[63,123],"(CFLA)":[64],"algorithm,":[65],"has":[66],"two":[67],"main":[68],"limitations.":[69],"First,":[70],"its":[71,85,112],"time":[72,228],"complexity":[73],"exponential":[75],"agents.":[80],"Second,":[81],"as":[82,95,254,271],"we":[83,110,135,148,238],"show,":[84],"look-ahead":[86,178],"technique":[87,179],"not":[89],"effective":[90],"in":[91,142],"real-world":[92],"scenarios,":[93],"such":[94,253],"open":[96],"systems,":[98],"new":[100,273],"can":[102],"appear":[103],"at":[104,243],"any":[105],"time.":[106],"In":[107,174],"this":[108],"work,":[109],"study":[111],"design":[113],"define":[115],"variant,":[117],"called":[118,169],"Improved":[122],"(":[124],"$$\\text":[125,143,200],"{CFLA}2$$":[126,144,201],"<mml:math":[127,145,188,192,202,246],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"><mml:mrow><mml:mtext>CFLA</mml:mtext><mml:mn>2</mml:mn></mml:mrow></mml:math>":[128,146,203],"),":[129],"which":[130],"achieves":[131],"better":[132],"performance.":[133],"Since":[134],"cannot":[136],"eliminate":[137],"limitations":[139],"CFLA":[141,198],",":[147],"also":[149,215],"develop":[150],"novel":[152],"algorithm":[153,275],"solve":[155,277],"CFSTP,":[157],"first":[159],"be":[161],"simultaneously":[162],"anytime,":[163],"efficient":[164],"convergence":[167],"guarantee,":[168],"Cluster-based":[170],"Task":[171],"Scheduling":[172],"(CTS).":[173],"tests":[175],"highly":[181],"effective,":[182],"CTS":[183,224,270],"completes":[184],"up":[185,207,260],"$$30\\%$$":[187],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"><mml:mrow><mml:mn>30</mml:mn><mml:mo>%</mml:mo></mml:mrow></mml:math>":[189],"(resp.":[190,199],"$$10\\%$$":[191,245],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"><mml:mrow><mml:mn>10</mml:mn><mml:mo>%</mml:mo></mml:mrow></mml:math>":[193,247],")":[194,204],"more":[195],"while":[205],"being":[206],"4":[209],"orders":[210,263],"magnitude":[212,265],"faster.":[213,266],"We":[214],"propose":[216],"S-CTS,":[217],"simplified":[219],"but":[220,259],"parallel":[221],"variant":[222],"even":[226],"lower":[227],"complexity.":[229],"Using":[230],"scenarios":[231],"generated":[232],"by":[233],"RoboCup":[235],"Rescue":[236],"Simulation,":[237],"show":[239],"that":[240],"S-CTS":[241],"most":[244],"less":[248],"performing":[249],"high-performance":[251],"algorithms":[252],"Binary":[255],"Max-Sum":[256],"DSA,":[258],"2":[262],"Our":[267],"results":[268],"affirm":[269],"CFSTP.":[279]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2025-10-10T00:00:00"}