{"id":"https://openalex.org/W2494341103","doi":"https://doi.org/10.1109/acc.2016.7526563","title":"Spatial load balancing in non-convex environments using sampling-based motion planners","display_name":"Spatial load balancing in non-convex environments using sampling-based motion planners","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2494341103","doi":"https://doi.org/10.1109/acc.2016.7526563","mag":"2494341103"},"language":"en","primary_location":{"id":"doi:10.1109/acc.2016.7526563","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2016.7526563","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 American Control Conference (ACC)","raw_type":"proceedings-article"},"type":"conference-paper","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":null,"display_name":"Beth Boardman","orcid":null},"institutions":[{"id":"https://openalex.org/I1343871089","display_name":"Los Alamos National Laboratory","ror":"https://ror.org/01e41cf67","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1343871089","https://openalex.org/I198811213","https://openalex.org/I4210120050"]},{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Beth Boardman","raw_affiliation_strings":["Los Alamos National Laboratory, Los Alamos, NM","Mechanical and Aerospace Engineering, University of California, San Diego, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Los Alamos National Laboratory, Los Alamos, NM","institution_ids":["https://openalex.org/I1343871089"]},{"raw_affiliation_string":"Mechanical and Aerospace Engineering, University of California, San Diego, CA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028953580","display_name":"Troy Harden","orcid":"https://orcid.org/0000-0002-7458-7794"},"institutions":[{"id":"https://openalex.org/I1343871089","display_name":"Los Alamos National Laboratory","ror":"https://ror.org/01e41cf67","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1343871089","https://openalex.org/I198811213","https://openalex.org/I4210120050"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Troy Harden","raw_affiliation_strings":["Los Alamos National Laboratory, Los Alamos, NM"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Los Alamos National Laboratory, Los Alamos, NM","institution_ids":["https://openalex.org/I1343871089"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024022921","display_name":"Sonia Mart\u0131\u0301nez","orcid":"https://orcid.org/0000-0001-6756-1484"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sonia Martinez","raw_affiliation_strings":["Mechanical and Aerospace Engineering, University of California, San Diego, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mechanical and Aerospace Engineering, University of California, San Diego, CA","institution_ids":["https://openalex.org/I36258959"]}]}],"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":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"5703","last_page":"5708"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9993000030517578,"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.9993000030517578,"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.9979000091552734,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9973999857902527,"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/computer-science","display_name":"Computer science","score":0.5190642476081848},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4863003194332123},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4540194272994995},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.4252544045448303},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.41558313369750977},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4068422019481659},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4001222252845764},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3880462944507599},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3679110109806061},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3603743016719818},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2797772288322449},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.10360366106033325}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5190642476081848},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4863003194332123},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4540194272994995},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.4252544045448303},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.41558313369750977},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4068422019481659},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4001222252845764},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3880462944507599},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3679110109806061},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3603743016719818},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2797772288322449},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.10360366106033325},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/acc.2016.7526563","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2016.7526563","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 American Control Conference (ACC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6600000262260437,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320338304","display_name":"Los Alamos National Laboratory","ror":"https://ror.org/01e41cf67"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1513096573","https://openalex.org/W1603765807","https://openalex.org/W1788292158","https://openalex.org/W1971086298","https://openalex.org/W1971911905","https://openalex.org/W1996047903","https://openalex.org/W2023376652","https://openalex.org/W2032443917","https://openalex.org/W2039915459","https://openalex.org/W2041547034","https://openalex.org/W2042398697","https://openalex.org/W2097002253","https://openalex.org/W2112727836","https://openalex.org/W2122061813","https://openalex.org/W2138610673","https://openalex.org/W2142474603","https://openalex.org/W2150593711","https://openalex.org/W2153463305","https://openalex.org/W2167485994","https://openalex.org/W2169528473","https://openalex.org/W2171346623","https://openalex.org/W2171977020","https://openalex.org/W2186443504","https://openalex.org/W2313274380","https://openalex.org/W2324074576","https://openalex.org/W2951276827","https://openalex.org/W4239270100","https://openalex.org/W6630401119"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1517908938","https://openalex.org/W2904977663","https://openalex.org/W2281834912","https://openalex.org/W1489941249","https://openalex.org/W3123492739","https://openalex.org/W4320486059","https://openalex.org/W2494168571","https://openalex.org/W2033096984","https://openalex.org/W3121191496"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"an":[3],"algorithm":[4,143],"to":[5,15,27,55,75,100,122,130,137],"approximately":[6],"solve":[7],"a":[8,89,123,163],"spatial-load":[9],"balancing":[10],"problem":[11],"for":[12,113,120,162],"agents,":[13],"subject":[14],"differential":[16],"constraints,":[17],"deployed":[18],"in":[19,160],"non-convex":[20],"environments.":[21],"A":[22],"probabilistic":[23],"roadmap":[24],"is":[25,88],"used":[26],"approximate":[28],"regions":[29],"via":[30],"connected":[31],"sets":[32],"of":[33,96,107,125,141],"vertices,":[34],"which":[35],"describe":[36],"agents'":[37,47],"configurations":[38],"and":[39,49,103,129,149,156,167],"optimal":[40],"paths":[41],"joining":[42],"them.":[43],"At":[44],"each":[45],"iteration,":[46],"positions":[48],"assigned":[50],"graph":[51,71,98],"nodes":[52],"are":[53,63,73,158],"updated":[54],"minimize":[56],"the":[57,66,97,101,105,126,142],"cost":[58],"function.":[59],"Two":[60],"graph-node":[61],"partitions":[62],"considered.":[64],"In":[65],"first":[67],"one,":[68,82],"\u03bd\u0303,":[69],"all":[70],"vertices":[72,99],"allocated":[74],"one":[76],"agent":[77],"or":[78],"another.":[79],"The":[80,139],"second":[81],"\u03bd\u0303":[83,121,145,152,157],"<sup":[84,146,153],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[85,147,154],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">lower</sup>":[86,148,155],",":[87],"lower":[90],"approximation":[91],"that":[92],"only":[93],"allocates":[94],"some":[95],"agents":[102],"has":[104],"advantage":[106],"requiring":[108],"less":[109],"communication":[110],"than":[111],"required":[112],"\u03bd\u0303.":[114],"Algorithm":[115],"convergence":[116,140],"can":[117],"be":[118],"guaranteed":[119],"neighborhood":[124],"continuous-space":[127],"counterpart,":[128],"its":[131],"solution":[132],"as":[133],"sampling":[134],"dispersion":[135],"tends":[136],"zero.":[138],"using":[144],"trade-offs":[150],"between":[151],"established":[159],"simulation":[161],"Euclidean":[164],"metric":[165],"case":[166],"Dubins'":[168],"vehicle":[169],"dynamics.":[170]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}