{"id":"https://openalex.org/W2282034761","doi":"https://doi.org/10.1177/0278364916632065","title":"Swarm assignment and trajectory optimization using variable-swarm, distributed auction assignment and sequential convex programming","display_name":"Swarm assignment and trajectory optimization using variable-swarm, distributed auction assignment and sequential convex programming","publication_year":2016,"publication_date":"2016-02-23","ids":{"openalex":"https://openalex.org/W2282034761","doi":"https://doi.org/10.1177/0278364916632065","mag":"2282034761"},"language":"en","primary_location":{"id":"doi:10.1177/0278364916632065","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364916632065","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","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/A5034749689","display_name":"Daniel Morgan","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Morgan","raw_affiliation_strings":["University of Illinois at Urbana-Champaign, USA"],"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031179895","display_name":"Giri P. Subramanian","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Giri P Subramanian","raw_affiliation_strings":["University of Illinois at Urbana-Champaign, USA"],"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031408324","display_name":"Soon\u2010Jo Chung","orcid":"https://orcid.org/0000-0002-6657-3907"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Soon-Jo Chung","raw_affiliation_strings":["University of Illinois at Urbana-Champaign, USA"],"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061239259","display_name":"Fred Y. Hadaegh","orcid":null},"institutions":[{"id":"https://openalex.org/I1334627681","display_name":"Jet Propulsion Laboratory","ror":"https://ror.org/027k65916","country_code":"US","type":"facility","lineage":["https://openalex.org/I122411786","https://openalex.org/I1334627681","https://openalex.org/I4210124779"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Fred Y Hadaegh","raw_affiliation_strings":["Jet Propulsion Laboratory, California Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"Jet Propulsion Laboratory, California Institute of Technology, USA","institution_ids":["https://openalex.org/I1334627681"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5031408324"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":17.0517,"has_fulltext":false,"cited_by_count":186,"citation_normalized_percentile":{"value":0.99271059,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"35","issue":"10","first_page":"1261","last_page":"1285"},"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.9998999834060669,"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.9998999834060669,"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.9976999759674072,"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/T12288","display_name":"Optimization and Search Problems","score":0.996999979019165,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/swarm-behaviour","display_name":"Swarm behaviour","score":0.6985411643981934},{"id":"https://openalex.org/keywords/auction-algorithm","display_name":"Auction algorithm","score":0.6822052001953125},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.640880823135376},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.6057912707328796},{"id":"https://openalex.org/keywords/weapon-target-assignment-problem","display_name":"Weapon target assignment problem","score":0.6003288626670837},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5402498245239258},{"id":"https://openalex.org/keywords/trajectory-optimization","display_name":"Trajectory optimization","score":0.5372476577758789},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.4733046591281891},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4295373260974884},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4127150774002075},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.40557795763015747},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.39248189330101013},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33044567704200745},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3190231919288635},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3039129376411438},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19498875737190247},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14829769730567932}],"concepts":[{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.6985411643981934},{"id":"https://openalex.org/C74979957","wikidata":"https://www.wikidata.org/wiki/Q4819604","display_name":"Auction algorithm","level":5,"score":0.6822052001953125},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.640880823135376},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.6057912707328796},{"id":"https://openalex.org/C30202268","wikidata":"https://www.wikidata.org/wiki/Q7978065","display_name":"Weapon target assignment problem","level":4,"score":0.6003288626670837},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5402498245239258},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.5372476577758789},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.4733046591281891},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4295373260974884},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4127150774002075},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.40557795763015747},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.39248189330101013},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33044567704200745},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3190231919288635},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3039129376411438},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19498875737190247},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14829769730567932},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C143684077","wikidata":"https://www.wikidata.org/wiki/Q431186","display_name":"Revenue equivalence","level":4,"score":0.0},{"id":"https://openalex.org/C163239763","wikidata":"https://www.wikidata.org/wiki/Q5153637","display_name":"Common value auction","level":2,"score":0.0},{"id":"https://openalex.org/C11276805","wikidata":"https://www.wikidata.org/wiki/Q771334","display_name":"Auction theory","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1177/0278364916632065","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364916632065","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","raw_type":"journal-article"},{"id":"pmh:oai:authors.library.caltech.edu:73087","is_oa":false,"landing_page_url":"https://authors.library.caltech.edu/73087/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402161","display_name":"CaltechAUTHORS (California Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122411786","host_organization_name":"California Institute of Technology","host_organization_lineage":["https://openalex.org/I122411786"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W13401232","https://openalex.org/W568316357","https://openalex.org/W1608758704","https://openalex.org/W1964462572","https://openalex.org/W1973443286","https://openalex.org/W1978956894","https://openalex.org/W1993730936","https://openalex.org/W1998971224","https://openalex.org/W2014192044","https://openalex.org/W2017714866","https://openalex.org/W2038828004","https://openalex.org/W2042581906","https://openalex.org/W2057556864","https://openalex.org/W2057869046","https://openalex.org/W2067045754","https://openalex.org/W2084981682","https://openalex.org/W2100099496","https://openalex.org/W2115046037","https://openalex.org/W2117113000","https://openalex.org/W2117371776","https://openalex.org/W2125240595","https://openalex.org/W2130308142","https://openalex.org/W2135132740","https://openalex.org/W2135690572","https://openalex.org/W2138208394","https://openalex.org/W2140628556","https://openalex.org/W2142544818","https://openalex.org/W2144954802","https://openalex.org/W2161711991","https://openalex.org/W2165744313","https://openalex.org/W2167080759","https://openalex.org/W2186500120","https://openalex.org/W2187565700","https://openalex.org/W2222512263","https://openalex.org/W2230249008","https://openalex.org/W2293883387","https://openalex.org/W2296319761","https://openalex.org/W2319732538","https://openalex.org/W2327364822","https://openalex.org/W2330892655","https://openalex.org/W2498516586","https://openalex.org/W2611293703","https://openalex.org/W2799004609","https://openalex.org/W4232469330","https://openalex.org/W4250589301","https://openalex.org/W4299439662"],"related_works":["https://openalex.org/W2937059810","https://openalex.org/W1586515950","https://openalex.org/W2358965113","https://openalex.org/W2379349345","https://openalex.org/W2760584304","https://openalex.org/W2382974548","https://openalex.org/W2113934189","https://openalex.org/W2311097448","https://openalex.org/W2028174200","https://openalex.org/W1514390035"],"abstract_inverted_index":{"This":[0,25],"paper":[1],"presents":[2],"a":[3,62,104,150,157,161,187],"distributed,":[4],"guidance":[5],"and":[6,22,32,77,97,122,131,143,180],"control":[7,90,110,138],"algorithm":[8,26,130,147,174],"for":[9,36,118],"reconfiguring":[10],"swarms":[11],"composed":[12],"of":[13,17,48,71,126,152,192,201],"hundreds":[14],"to":[15,93,116,156,170],"thousands":[16],"agents":[18],"with":[19],"limited":[20],"communication":[21],"computation":[23],"capabilities.":[24],"solves":[27],"both":[28],"the":[29,45,49,69,75,78,95,119,127,140,165,171,173,199,202],"optimal":[30,56,120],"assignment":[31,57,65,96,121,142],"collision-free":[33,79,189],"trajectory":[34,98,144],"generation":[35,99],"robotic":[37],"swarms,":[38],"in":[39,74,100,160,186],"an":[40],"integrated":[41],"manner,":[42],"when":[43],"given":[44],"desired":[46,158,166],"shape":[47,159,167],"swarm":[50,141,151],"(without":[51],"pre-assigned":[52],"terminal":[53],"positions).":[54],"The":[55,107,124],"problem":[58],"is":[59,91,168],"solved":[60],"using":[61,83,103,135,195],"distributed":[63,128,162],"auction":[64,129],"that":[66,148],"can":[67],"vary":[68],"number":[70],"target":[72],"positions":[73],"assignment,":[76],"trajectories":[80],"are":[81],"generated":[82],"sequential":[84,132],"convex":[85,133],"programming.":[86],"Finally,":[87],"model":[88,108,136],"predictive":[89,109,137],"used":[92],"solve":[94],"real":[101],"time":[102],"receding":[105],"horizon.":[106],"formulation":[111],"uses":[112],"current":[113],"state":[114],"measurements":[115],"resolve":[117],"trajectory.":[123],"implementation":[125],"programming":[134],"produces":[139],"optimization":[145],"(SATO)":[146],"transfers":[149],"robots":[153],"or":[154],"vehicles":[155],"fashion.":[163],"Once":[164],"uploaded":[169],"swarm,":[172],"determines":[175],"where":[176],"each":[177],"robot":[178],"goes":[179],"how":[181],"it":[182],"should":[183],"get":[184],"there":[185],"fuel-efficient,":[188],"manner.":[190],"Results":[191],"flight":[193],"experiments":[194],"multiple":[196],"quadcopters":[197],"show":[198],"effectiveness":[200],"proposed":[203],"SATO":[204],"algorithm.":[205]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":24},{"year":2024,"cited_by_count":24},{"year":2023,"cited_by_count":18},{"year":2022,"cited_by_count":19},{"year":2021,"cited_by_count":23},{"year":2020,"cited_by_count":21},{"year":2019,"cited_by_count":26},{"year":2018,"cited_by_count":15},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":4}],"updated_date":"2026-04-02T15:55:50.835912","created_date":"2025-10-10T00:00:00"}