Robots in the Huddle: Upfront Computation to Reduce Global Communication at Run Time in Multirobot Task Allocation
In this article, we study multirobot task allocation problems where task costs vary. The variation may be, for example, due to the revelation of new information or other dynamic circumstances. As robots update their cost estimates, typically they will update task assignments to reflect the new infor...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on robotics 2020-02, Vol.36 (1), p.125-141 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 141 |
---|---|
container_issue | 1 |
container_start_page | 125 |
container_title | IEEE transactions on robotics |
container_volume | 36 |
creator | Nam, Changjoo Shell, Dylan A. |
description | In this article, we study multirobot task allocation problems where task costs vary. The variation may be, for example, due to the revelation of new information or other dynamic circumstances. As robots update their cost estimates, typically they will update task assignments to reflect the new information using additional communication and computation. In dynamic settings, the robots are continually repairing the optimality of the system's task assignments, which can incur substantial communication and computation. We investigate how one can reduce communication and centralized computation expense during execution by using a prior model of how costs may change and performing upfront computation of possible robot-task assignments. First, we develop an algorithm that partitions a team of robots into several independent subteams that are able to maintain global optimality by communicating entirely amongst themselves. Second, we propose a method for computing the worst-case cost suboptimality if robots persist with the initial assignment and perform no further communication and computation. Finally, we introduce an algorithm to assess whether cost changes affect the optimality of the current assignment through a succession of local communication exchanges. Experimental results show that the proposed methods are helpful in reducing the degree of centralization needed by a multirobot system (e.g., the third method gave at least 45% reduction of global communication across all scenarios studied). The methods are valuable in transitioning multirobot techniques, which have met with success in structured applications (such as factories and warehouses) to the broader, wilder world. |
doi_str_mv | 10.1109/TRO.2019.2937468 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_8844303</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8844303</ieee_id><sourcerecordid>2352199160</sourcerecordid><originalsourceid>FETCH-LOGICAL-c333t-99ce04748ab86d219601adc4b4f18e824b1188fcbfc53c8d8c0c206be036b4ba3</originalsourceid><addsrcrecordid>eNo9kMFLwzAYxYsoOKd3wUvAc-eXJu0Sb2PoJkwGpTuXJE2xs21qkh78703p8PQ9eL_3PnhR9IhhhTHwlyI_rhLAfJVwsqYZu4oWmFMcQ9DXQadpEhPg7Da6c-4MkFAOZBHZ3EjjHWp65L802o9V1epXdBpqa3qPtqYbRi98Y4JvUK6rUWm0a40U7WR2Y9-o2RYe5WOPiqbTU9vn2PrGTuWoEO4bbdrWzOR9dFOL1umHy11Gp_e3YruPD8fdx3ZziBUhxMecKw10TZmQLKsSzDPAolJU0hozzRIqMWasVrJWKVGsYgpUApnUQDJJpSDL6HnuHaz5GbXz5dmMtg8vy4SkoZDjDAIFM6Wscc7quhxs0wn7W2Iop2XLsGw5LVtelg2RpznSaK3_ccYoJUDIH1Q4dV0</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2352199160</pqid></control><display><type>article</type><title>Robots in the Huddle: Upfront Computation to Reduce Global Communication at Run Time in Multirobot Task Allocation</title><source>IEEE Electronic Library (IEL)</source><creator>Nam, Changjoo ; Shell, Dylan A.</creator><creatorcontrib>Nam, Changjoo ; Shell, Dylan A.</creatorcontrib><description>In this article, we study multirobot task allocation problems where task costs vary. The variation may be, for example, due to the revelation of new information or other dynamic circumstances. As robots update their cost estimates, typically they will update task assignments to reflect the new information using additional communication and computation. In dynamic settings, the robots are continually repairing the optimality of the system's task assignments, which can incur substantial communication and computation. We investigate how one can reduce communication and centralized computation expense during execution by using a prior model of how costs may change and performing upfront computation of possible robot-task assignments. First, we develop an algorithm that partitions a team of robots into several independent subteams that are able to maintain global optimality by communicating entirely amongst themselves. Second, we propose a method for computing the worst-case cost suboptimality if robots persist with the initial assignment and perform no further communication and computation. Finally, we introduce an algorithm to assess whether cost changes affect the optimality of the current assignment through a succession of local communication exchanges. Experimental results show that the proposed methods are helpful in reducing the degree of centralization needed by a multirobot system (e.g., the third method gave at least 45% reduction of global communication across all scenarios studied). The methods are valuable in transitioning multirobot techniques, which have met with success in structured applications (such as factories and warehouses) to the broader, wilder world.</description><identifier>ISSN: 1552-3098</identifier><identifier>EISSN: 1941-0468</identifier><identifier>DOI: 10.1109/TRO.2019.2937468</identifier><identifier>CODEN: ITREAE</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; and scheduling ; Communication ; Computational modeling ; Cost estimates ; Global communication ; Heuristic algorithms ; Industrial plants ; Multiple robots ; Multirobot coordination ; networked robots ; Robot kinematics ; Robots ; Task analysis ; task planning ; Uncertainty ; Warehouses</subject><ispartof>IEEE transactions on robotics, 2020-02, Vol.36 (1), p.125-141</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c333t-99ce04748ab86d219601adc4b4f18e824b1188fcbfc53c8d8c0c206be036b4ba3</citedby><cites>FETCH-LOGICAL-c333t-99ce04748ab86d219601adc4b4f18e824b1188fcbfc53c8d8c0c206be036b4ba3</cites><orcidid>0000-0002-9169-0785 ; 0000-0002-9310-7231</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8844303$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8844303$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Nam, Changjoo</creatorcontrib><creatorcontrib>Shell, Dylan A.</creatorcontrib><title>Robots in the Huddle: Upfront Computation to Reduce Global Communication at Run Time in Multirobot Task Allocation</title><title>IEEE transactions on robotics</title><addtitle>TRO</addtitle><description>In this article, we study multirobot task allocation problems where task costs vary. The variation may be, for example, due to the revelation of new information or other dynamic circumstances. As robots update their cost estimates, typically they will update task assignments to reflect the new information using additional communication and computation. In dynamic settings, the robots are continually repairing the optimality of the system's task assignments, which can incur substantial communication and computation. We investigate how one can reduce communication and centralized computation expense during execution by using a prior model of how costs may change and performing upfront computation of possible robot-task assignments. First, we develop an algorithm that partitions a team of robots into several independent subteams that are able to maintain global optimality by communicating entirely amongst themselves. Second, we propose a method for computing the worst-case cost suboptimality if robots persist with the initial assignment and perform no further communication and computation. Finally, we introduce an algorithm to assess whether cost changes affect the optimality of the current assignment through a succession of local communication exchanges. Experimental results show that the proposed methods are helpful in reducing the degree of centralization needed by a multirobot system (e.g., the third method gave at least 45% reduction of global communication across all scenarios studied). The methods are valuable in transitioning multirobot techniques, which have met with success in structured applications (such as factories and warehouses) to the broader, wilder world.</description><subject>Algorithms</subject><subject>and scheduling</subject><subject>Communication</subject><subject>Computational modeling</subject><subject>Cost estimates</subject><subject>Global communication</subject><subject>Heuristic algorithms</subject><subject>Industrial plants</subject><subject>Multiple robots</subject><subject>Multirobot coordination</subject><subject>networked robots</subject><subject>Robot kinematics</subject><subject>Robots</subject><subject>Task analysis</subject><subject>task planning</subject><subject>Uncertainty</subject><subject>Warehouses</subject><issn>1552-3098</issn><issn>1941-0468</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kMFLwzAYxYsoOKd3wUvAc-eXJu0Sb2PoJkwGpTuXJE2xs21qkh78703p8PQ9eL_3PnhR9IhhhTHwlyI_rhLAfJVwsqYZu4oWmFMcQ9DXQadpEhPg7Da6c-4MkFAOZBHZ3EjjHWp65L802o9V1epXdBpqa3qPtqYbRi98Y4JvUK6rUWm0a40U7WR2Y9-o2RYe5WOPiqbTU9vn2PrGTuWoEO4bbdrWzOR9dFOL1umHy11Gp_e3YruPD8fdx3ZziBUhxMecKw10TZmQLKsSzDPAolJU0hozzRIqMWasVrJWKVGsYgpUApnUQDJJpSDL6HnuHaz5GbXz5dmMtg8vy4SkoZDjDAIFM6Wscc7quhxs0wn7W2Iop2XLsGw5LVtelg2RpznSaK3_ccYoJUDIH1Q4dV0</recordid><startdate>202002</startdate><enddate>202002</enddate><creator>Nam, Changjoo</creator><creator>Shell, Dylan A.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0002-9169-0785</orcidid><orcidid>https://orcid.org/0000-0002-9310-7231</orcidid></search><sort><creationdate>202002</creationdate><title>Robots in the Huddle: Upfront Computation to Reduce Global Communication at Run Time in Multirobot Task Allocation</title><author>Nam, Changjoo ; Shell, Dylan A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c333t-99ce04748ab86d219601adc4b4f18e824b1188fcbfc53c8d8c0c206be036b4ba3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Algorithms</topic><topic>and scheduling</topic><topic>Communication</topic><topic>Computational modeling</topic><topic>Cost estimates</topic><topic>Global communication</topic><topic>Heuristic algorithms</topic><topic>Industrial plants</topic><topic>Multiple robots</topic><topic>Multirobot coordination</topic><topic>networked robots</topic><topic>Robot kinematics</topic><topic>Robots</topic><topic>Task analysis</topic><topic>task planning</topic><topic>Uncertainty</topic><topic>Warehouses</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Nam, Changjoo</creatorcontrib><creatorcontrib>Shell, Dylan A.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on robotics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Nam, Changjoo</au><au>Shell, Dylan A.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Robots in the Huddle: Upfront Computation to Reduce Global Communication at Run Time in Multirobot Task Allocation</atitle><jtitle>IEEE transactions on robotics</jtitle><stitle>TRO</stitle><date>2020-02</date><risdate>2020</risdate><volume>36</volume><issue>1</issue><spage>125</spage><epage>141</epage><pages>125-141</pages><issn>1552-3098</issn><eissn>1941-0468</eissn><coden>ITREAE</coden><abstract>In this article, we study multirobot task allocation problems where task costs vary. The variation may be, for example, due to the revelation of new information or other dynamic circumstances. As robots update their cost estimates, typically they will update task assignments to reflect the new information using additional communication and computation. In dynamic settings, the robots are continually repairing the optimality of the system's task assignments, which can incur substantial communication and computation. We investigate how one can reduce communication and centralized computation expense during execution by using a prior model of how costs may change and performing upfront computation of possible robot-task assignments. First, we develop an algorithm that partitions a team of robots into several independent subteams that are able to maintain global optimality by communicating entirely amongst themselves. Second, we propose a method for computing the worst-case cost suboptimality if robots persist with the initial assignment and perform no further communication and computation. Finally, we introduce an algorithm to assess whether cost changes affect the optimality of the current assignment through a succession of local communication exchanges. Experimental results show that the proposed methods are helpful in reducing the degree of centralization needed by a multirobot system (e.g., the third method gave at least 45% reduction of global communication across all scenarios studied). The methods are valuable in transitioning multirobot techniques, which have met with success in structured applications (such as factories and warehouses) to the broader, wilder world.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TRO.2019.2937468</doi><tpages>17</tpages><orcidid>https://orcid.org/0000-0002-9169-0785</orcidid><orcidid>https://orcid.org/0000-0002-9310-7231</orcidid><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1552-3098 |
ispartof | IEEE transactions on robotics, 2020-02, Vol.36 (1), p.125-141 |
issn | 1552-3098 1941-0468 |
language | eng |
recordid | cdi_ieee_primary_8844303 |
source | IEEE Electronic Library (IEL) |
subjects | Algorithms and scheduling Communication Computational modeling Cost estimates Global communication Heuristic algorithms Industrial plants Multiple robots Multirobot coordination networked robots Robot kinematics Robots Task analysis task planning Uncertainty Warehouses |
title | Robots in the Huddle: Upfront Computation to Reduce Global Communication at Run Time in Multirobot Task Allocation |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T20%3A27%3A00IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Robots%20in%20the%20Huddle:%20Upfront%20Computation%20to%20Reduce%20Global%20Communication%20at%20Run%20Time%20in%20Multirobot%20Task%20Allocation&rft.jtitle=IEEE%20transactions%20on%20robotics&rft.au=Nam,%20Changjoo&rft.date=2020-02&rft.volume=36&rft.issue=1&rft.spage=125&rft.epage=141&rft.pages=125-141&rft.issn=1552-3098&rft.eissn=1941-0468&rft.coden=ITREAE&rft_id=info:doi/10.1109/TRO.2019.2937468&rft_dat=%3Cproquest_RIE%3E2352199160%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2352199160&rft_id=info:pmid/&rft_ieee_id=8844303&rfr_iscdi=true |