Discrete Partitioning and Coverage Control for Gossiping Robots
We propose distributed algorithms to automatically deploy a team of mobile robots to partition and provide coverage of a nonconvex environment. To handle arbitrary nonconvex environments, we represent them as graphs. Our partitioning and coverage algorithm requires only short-range, unreliable pairw...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on robotics 2012-04, Vol.28 (2), p.364-378 |
|---|---|
| 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 | 378 |
|---|---|
| container_issue | 2 |
| container_start_page | 364 |
| container_title | IEEE transactions on robotics |
| container_volume | 28 |
| creator | Durham, J. W. Carli, R. Frasca, P. Bullo, F. |
| description | We propose distributed algorithms to automatically deploy a team of mobile robots to partition and provide coverage of a nonconvex environment. To handle arbitrary nonconvex environments, we represent them as graphs. Our partitioning and coverage algorithm requires only short-range, unreliable pairwise "gossip" communication. The algorithm has two components: 1) a motion protocol to ensure that neighboring robots communicate at least sporadically and 2) a pairwise partitioning rule to update territory ownership when two robots communicate. By studying an appropriate dynamical system on the space of partitions of the graph vertices, we prove that territory ownership converges to a pairwise-optimal partition in finite time. This new equilibrium set represents improved performance over common Lloyd-type algorithms. Additionally, our algorithm is an "anytime algorithm'' that also scales well for large teams and can be run by on-board computers with limited resources. Finally, we report on large-scale simulations in complex environments and hardware experiments using the Player/Stage robot control system. |
| doi_str_mv | 10.1109/TRO.2011.2170753 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_pascalfrancis_primary_25845432</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6060922</ieee_id><sourcerecordid>2630947651</sourcerecordid><originalsourceid>FETCH-LOGICAL-c362t-46869e9d54b4ce8621b54f8cd4cf9a2c62590892db8788fdd7fecf00f81591fb3</originalsourceid><addsrcrecordid>eNo9kM1LAzEQxYMoWKt3wcsieNx18rWbnESqVqFQKfUcstmkpNRNTbaC_70pLT3Ng_m9mcdD6BZDhTHIx-ViXhHAuCK4gYbTMzTCkuESWC3Os-aclBSkuERXKa0BCJNAR-jpxScT7WCLTx0HP_jQ-35V6L4rJuHXRr2yWfRDDJvChVhMQ0p-u0cWoQ1DukYXTm-SvTnOMfp6e11O3svZfPoxeZ6VhtZkKHOIWlrZcdYyY0VNcMuZE6ZjxklNTE24BCFJ14pGCNd1jbPGATiBucSupWN0f7i7jeFnZ9Og1mEX-_xSSUkxEVzQDMEBMjHHjNapbfTfOv4pDGrfksotqX1L6thStjwc7-pk9MZF3RufTj7CBeOMkszdHThvrT2ta6hBEkL_Acv1b5Q</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>993128583</pqid></control><display><type>article</type><title>Discrete Partitioning and Coverage Control for Gossiping Robots</title><source>IEEE Electronic Library (IEL)</source><creator>Durham, J. W. ; Carli, R. ; Frasca, P. ; Bullo, F.</creator><creatorcontrib>Durham, J. W. ; Carli, R. ; Frasca, P. ; Bullo, F.</creatorcontrib><description>We propose distributed algorithms to automatically deploy a team of mobile robots to partition and provide coverage of a nonconvex environment. To handle arbitrary nonconvex environments, we represent them as graphs. Our partitioning and coverage algorithm requires only short-range, unreliable pairwise "gossip" communication. The algorithm has two components: 1) a motion protocol to ensure that neighboring robots communicate at least sporadically and 2) a pairwise partitioning rule to update territory ownership when two robots communicate. By studying an appropriate dynamical system on the space of partitions of the graph vertices, we prove that territory ownership converges to a pairwise-optimal partition in finite time. This new equilibrium set represents improved performance over common Lloyd-type algorithms. Additionally, our algorithm is an "anytime algorithm'' that also scales well for large teams and can be run by on-board computers with limited resources. Finally, we report on large-scale simulations in complex environments and hardware experiments using the Player/Stage robot control system.</description><identifier>ISSN: 1552-3098</identifier><identifier>EISSN: 1941-0468</identifier><identifier>DOI: 10.1109/TRO.2011.2170753</identifier><identifier>CODEN: ITREAE</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Algorithm design and analysis ; Algorithms ; Applied sciences ; Artificial intelligence ; Communication ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Control systems ; Control theory. Systems ; Convergence ; Cost function ; Distributed control ; Exact sciences and technology ; Heuristic algorithms ; intelligent robots ; multirobot systems ; optimization ; Partitioning algorithms ; Protocols ; Robotics ; Robots ; Software</subject><ispartof>IEEE transactions on robotics, 2012-04, Vol.28 (2), p.364-378</ispartof><rights>2015 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Apr 2012</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c362t-46869e9d54b4ce8621b54f8cd4cf9a2c62590892db8788fdd7fecf00f81591fb3</citedby><cites>FETCH-LOGICAL-c362t-46869e9d54b4ce8621b54f8cd4cf9a2c62590892db8788fdd7fecf00f81591fb3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6060922$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6060922$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=25845432$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Durham, J. W.</creatorcontrib><creatorcontrib>Carli, R.</creatorcontrib><creatorcontrib>Frasca, P.</creatorcontrib><creatorcontrib>Bullo, F.</creatorcontrib><title>Discrete Partitioning and Coverage Control for Gossiping Robots</title><title>IEEE transactions on robotics</title><addtitle>TRO</addtitle><description>We propose distributed algorithms to automatically deploy a team of mobile robots to partition and provide coverage of a nonconvex environment. To handle arbitrary nonconvex environments, we represent them as graphs. Our partitioning and coverage algorithm requires only short-range, unreliable pairwise "gossip" communication. The algorithm has two components: 1) a motion protocol to ensure that neighboring robots communicate at least sporadically and 2) a pairwise partitioning rule to update territory ownership when two robots communicate. By studying an appropriate dynamical system on the space of partitions of the graph vertices, we prove that territory ownership converges to a pairwise-optimal partition in finite time. This new equilibrium set represents improved performance over common Lloyd-type algorithms. Additionally, our algorithm is an "anytime algorithm'' that also scales well for large teams and can be run by on-board computers with limited resources. Finally, we report on large-scale simulations in complex environments and hardware experiments using the Player/Stage robot control system.</description><subject>Algorithm design and analysis</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Artificial intelligence</subject><subject>Communication</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Control systems</subject><subject>Control theory. Systems</subject><subject>Convergence</subject><subject>Cost function</subject><subject>Distributed control</subject><subject>Exact sciences and technology</subject><subject>Heuristic algorithms</subject><subject>intelligent robots</subject><subject>multirobot systems</subject><subject>optimization</subject><subject>Partitioning algorithms</subject><subject>Protocols</subject><subject>Robotics</subject><subject>Robots</subject><subject>Software</subject><issn>1552-3098</issn><issn>1941-0468</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kM1LAzEQxYMoWKt3wcsieNx18rWbnESqVqFQKfUcstmkpNRNTbaC_70pLT3Ng_m9mcdD6BZDhTHIx-ViXhHAuCK4gYbTMzTCkuESWC3Os-aclBSkuERXKa0BCJNAR-jpxScT7WCLTx0HP_jQ-35V6L4rJuHXRr2yWfRDDJvChVhMQ0p-u0cWoQ1DukYXTm-SvTnOMfp6e11O3svZfPoxeZ6VhtZkKHOIWlrZcdYyY0VNcMuZE6ZjxklNTE24BCFJ14pGCNd1jbPGATiBucSupWN0f7i7jeFnZ9Og1mEX-_xSSUkxEVzQDMEBMjHHjNapbfTfOv4pDGrfksotqX1L6thStjwc7-pk9MZF3RufTj7CBeOMkszdHThvrT2ta6hBEkL_Acv1b5Q</recordid><startdate>20120401</startdate><enddate>20120401</enddate><creator>Durham, J. W.</creator><creator>Carli, R.</creator><creator>Frasca, P.</creator><creator>Bullo, F.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</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></search><sort><creationdate>20120401</creationdate><title>Discrete Partitioning and Coverage Control for Gossiping Robots</title><author>Durham, J. W. ; Carli, R. ; Frasca, P. ; Bullo, F.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c362t-46869e9d54b4ce8621b54f8cd4cf9a2c62590892db8788fdd7fecf00f81591fb3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Algorithm design and analysis</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Artificial intelligence</topic><topic>Communication</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Control systems</topic><topic>Control theory. Systems</topic><topic>Convergence</topic><topic>Cost function</topic><topic>Distributed control</topic><topic>Exact sciences and technology</topic><topic>Heuristic algorithms</topic><topic>intelligent robots</topic><topic>multirobot systems</topic><topic>optimization</topic><topic>Partitioning algorithms</topic><topic>Protocols</topic><topic>Robotics</topic><topic>Robots</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Durham, J. W.</creatorcontrib><creatorcontrib>Carli, R.</creatorcontrib><creatorcontrib>Frasca, P.</creatorcontrib><creatorcontrib>Bullo, F.</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>Pascal-Francis</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>Durham, J. W.</au><au>Carli, R.</au><au>Frasca, P.</au><au>Bullo, F.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Discrete Partitioning and Coverage Control for Gossiping Robots</atitle><jtitle>IEEE transactions on robotics</jtitle><stitle>TRO</stitle><date>2012-04-01</date><risdate>2012</risdate><volume>28</volume><issue>2</issue><spage>364</spage><epage>378</epage><pages>364-378</pages><issn>1552-3098</issn><eissn>1941-0468</eissn><coden>ITREAE</coden><abstract>We propose distributed algorithms to automatically deploy a team of mobile robots to partition and provide coverage of a nonconvex environment. To handle arbitrary nonconvex environments, we represent them as graphs. Our partitioning and coverage algorithm requires only short-range, unreliable pairwise "gossip" communication. The algorithm has two components: 1) a motion protocol to ensure that neighboring robots communicate at least sporadically and 2) a pairwise partitioning rule to update territory ownership when two robots communicate. By studying an appropriate dynamical system on the space of partitions of the graph vertices, we prove that territory ownership converges to a pairwise-optimal partition in finite time. This new equilibrium set represents improved performance over common Lloyd-type algorithms. Additionally, our algorithm is an "anytime algorithm'' that also scales well for large teams and can be run by on-board computers with limited resources. Finally, we report on large-scale simulations in complex environments and hardware experiments using the Player/Stage robot control system.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TRO.2011.2170753</doi><tpages>15</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1552-3098 |
| ispartof | IEEE transactions on robotics, 2012-04, Vol.28 (2), p.364-378 |
| issn | 1552-3098 1941-0468 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_25845432 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithm design and analysis Algorithms Applied sciences Artificial intelligence Communication Computer science control theory systems Computer systems and distributed systems. User interface Control systems Control theory. Systems Convergence Cost function Distributed control Exact sciences and technology Heuristic algorithms intelligent robots multirobot systems optimization Partitioning algorithms Protocols Robotics Robots Software |
| title | Discrete Partitioning and Coverage Control for Gossiping Robots |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-07T00%3A24%3A05IST&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=Discrete%20Partitioning%20and%20Coverage%20Control%20for%20Gossiping%20Robots&rft.jtitle=IEEE%20transactions%20on%20robotics&rft.au=Durham,%20J.%20W.&rft.date=2012-04-01&rft.volume=28&rft.issue=2&rft.spage=364&rft.epage=378&rft.pages=364-378&rft.issn=1552-3098&rft.eissn=1941-0468&rft.coden=ITREAE&rft_id=info:doi/10.1109/TRO.2011.2170753&rft_dat=%3Cproquest_RIE%3E2630947651%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=993128583&rft_id=info:pmid/&rft_ieee_id=6060922&rfr_iscdi=true |