Communication-Free Distributed Coverage for Networked Systems

Handle URI:
http://hdl.handle.net/10754/623709
Title:
Communication-Free Distributed Coverage for Networked Systems
Authors:
Yazicioglu, A. Yasin; Egerstedt, Magnus; Shamma, Jeff S. ( 0000-0001-5638-9551 )
Abstract:
In this paper, we present a communication-free algorithm for distributed coverage of an arbitrary network by a group of mobile agents with local sensing capabilities. The network is represented as a graph, and the agents are arbitrarily deployed on some nodes of the graph. Any node of the graph is covered if it is within the sensing range of at least one agent. The agents are mobile devices that aim to explore the graph and to optimize their locations in a decentralized fashion by relying only on their sensory inputs. We formulate this problem in a game theoretic setting and propose a communication-free learning algorithm for maximizing the coverage.
KAUST Department:
King Abdullah University of Science and Technology (KAUST)
Citation:
Yazicioglu AY, Egerstedt M, Shamma JS (2016) Communication-Free Distributed Coverage for Networked Systems. IEEE Transactions on Control of Network Systems: 1–1. Available: http://dx.doi.org/10.1109/tcns.2016.2518083.
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
IEEE Transactions on Control of Network Systems
Issue Date:
15-Jan-2016
DOI:
10.1109/tcns.2016.2518083
Type:
Article
ISSN:
2325-5870
Sponsors:
This work was supported by ONR project #N00014-09-1-0751.
Additional Links:
http://ieeexplore.ieee.org/document/7383274/
Appears in Collections:
Articles

Full metadata record

DC FieldValue Language
dc.contributor.authorYazicioglu, A. Yasinen
dc.contributor.authorEgerstedt, Magnusen
dc.contributor.authorShamma, Jeff S.en
dc.date.accessioned2017-05-25T10:55:13Z-
dc.date.available2017-05-25T10:55:13Z-
dc.date.issued2016-01-15en
dc.identifier.citationYazicioglu AY, Egerstedt M, Shamma JS (2016) Communication-Free Distributed Coverage for Networked Systems. IEEE Transactions on Control of Network Systems: 1–1. Available: http://dx.doi.org/10.1109/tcns.2016.2518083.en
dc.identifier.issn2325-5870en
dc.identifier.doi10.1109/tcns.2016.2518083en
dc.identifier.urihttp://hdl.handle.net/10754/623709-
dc.description.abstractIn this paper, we present a communication-free algorithm for distributed coverage of an arbitrary network by a group of mobile agents with local sensing capabilities. The network is represented as a graph, and the agents are arbitrarily deployed on some nodes of the graph. Any node of the graph is covered if it is within the sensing range of at least one agent. The agents are mobile devices that aim to explore the graph and to optimize their locations in a decentralized fashion by relying only on their sensory inputs. We formulate this problem in a game theoretic setting and propose a communication-free learning algorithm for maximizing the coverage.en
dc.description.sponsorshipThis work was supported by ONR project #N00014-09-1-0751.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.relation.urlhttp://ieeexplore.ieee.org/document/7383274/en
dc.rights(c) 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.en
dc.titleCommunication-Free Distributed Coverage for Networked Systemsen
dc.typeArticleen
dc.contributor.departmentKing Abdullah University of Science and Technology (KAUST)en
dc.identifier.journalIEEE Transactions on Control of Network Systemsen
dc.eprint.versionPost-printen
dc.contributor.institutionLaboratory for Information and Decision Systems, Massachusetts Institute of Technologyen
dc.contributor.institutionSchool of Electrical and Computer Engineering, Georgia Institute of Technologyen
kaust.authorShamma, Jeff S.en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.