Communication-free distributed coverage for networked systems

A. Yasin Yazicioglu; Magnus Egerstedt; Jeff S. Shamma

doi:10.1109/TCNS.2016.2518083

Communication-free distributed coverage for networked systems

A. Yasin Yazicioglu, Magnus Egerstedt, Jeff S. Shamma

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

14 Scopus citations

Abstract

In this paper, we present a communication-free algorithm for the 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 to maximize the coverage.

Original language	English (US)
Article number	7383274
Pages (from-to)	499-510
Number of pages	12
Journal	IEEE Transactions on Control of Network Systems
Volume	4
Issue number	3
DOIs	https://doi.org/10.1109/TCNS.2016.2518083
State	Published - Sep 2017

Bibliographical note

Funding Information:
Manuscript received November 10, 2015; accepted December 26, 2015. Date of publication January 14, 2016; date of current version September 15, 2017. This work was supported by ONR project under Grant N00014-09-1-0751. Recommended by Editor-in-Chief I. Paschalidis.

Publisher Copyright:
© 2014 IEEE.

Keywords

Decentralized control
game theory
learning
multiagent systems

Publisher link

10.1109/TCNS.2016.2518083

http://hdl.handle.net/10754/623709

Find It

Find It at U of M Libraries

Cite this

@article{1dfe1ed558c24b219f1988520030160a,

title = "Communication-free distributed coverage for networked systems",

abstract = "In this paper, we present a communication-free algorithm for the 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 to maximize the coverage.",

keywords = "Decentralized control, game theory, learning, multiagent systems",

author = "Yazicioglu, {A. Yasin} and Magnus Egerstedt and Shamma, {Jeff S.}",

note = "Funding Information: Manuscript received November 10, 2015; accepted December 26, 2015. Date of publication January 14, 2016; date of current version September 15, 2017. This work was supported by ONR project under Grant N00014-09-1-0751. Recommended by Editor-in-Chief I. Paschalidis. Publisher Copyright: {\textcopyright} 2014 IEEE.",

year = "2017",

month = sep,

doi = "10.1109/TCNS.2016.2518083",

language = "English (US)",

volume = "4",

pages = "499--510",

journal = "IEEE Transactions on Control of Network Systems",

issn = "2325-5870",

publisher = "IEEE CONTROL SYSTEMS SOCIETY",

number = "3",

}

TY - JOUR

T1 - Communication-free distributed coverage for networked systems

AU - Yazicioglu, A. Yasin

AU - Egerstedt, Magnus

AU - Shamma, Jeff S.

N1 - Funding Information: Manuscript received November 10, 2015; accepted December 26, 2015. Date of publication January 14, 2016; date of current version September 15, 2017. This work was supported by ONR project under Grant N00014-09-1-0751. Recommended by Editor-in-Chief I. Paschalidis. Publisher Copyright: © 2014 IEEE.

PY - 2017/9

Y1 - 2017/9

N2 - In this paper, we present a communication-free algorithm for the 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 to maximize the coverage.

AB - In this paper, we present a communication-free algorithm for the 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 to maximize the coverage.

KW - Decentralized control

KW - game theory

KW - learning

KW - multiagent systems

UR - http://www.scopus.com/inward/record.url?scp=85030128663&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85030128663&partnerID=8YFLogxK

U2 - 10.1109/TCNS.2016.2518083

DO - 10.1109/TCNS.2016.2518083

M3 - Article

AN - SCOPUS:85030128663

SN - 2325-5870

VL - 4

SP - 499

EP - 510

JO - IEEE Transactions on Control of Network Systems

JF - IEEE Transactions on Control of Network Systems

IS - 3

M1 - 7383274

ER -

Communication-free distributed coverage for networked systems

Abstract

Bibliographical note

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this