Home > Seminars > Simple Distributed Control of Networked CPS: Indirect and Direct Communications

Simple Distributed Control of Networked CPS: Indirect and Direct Communications

Start:

4/1/2014 at 2:00PM

End:

4/1/2014 at 3:00PM

Location:

258 Fitzpatrick Hall

Host:

College of Engineering close button
headerbottom

Panos Antsaklis

Panos Antsaklis

VIEW FULL PROFILE Email: antsaklis.1@nd.edu
Phone: 574-631-5792
Website: http://www.nd.edu/~pantsakl/
Office: 205A Cushing Hall

Affiliations

Department of Electrical Engineering H. Clifford and Evelyn A. Brosey Chair Professor
College of Engineering H. Clifford and Evelyn A. Brosey Chair Professor
Research Interests: My research group focuses on Cyber Physical Networked Embedded Systems and addresses problems in the interdisciplinary research area of Control, Computing and Communication Networks, and on Hybrid and Discrete Event Dynamical Systems. It addresses problems of control and ...
Click for more information about Panos
574-631-5792
Add to calendar:
iCal vCal
We consider a system of N agents, each picking actions from a finite set and receiving a payoff depending on the actions of all agents. The exact form of the payoffs is unknown and only their values can be measured by the respective agents. A decentralized algorithm was recently proposed by Young et al and in the author’s earlier work, that, in this setting, leads to the agents picking welfare optimizing actions under some restrictive assumptions on the payoff structure. We have very recently improved the algorithm to incorporate exchange of certain bit-valued information between the agents over a directed communication graph. An interaction graph is introduced to encode known interactions in the system. Restrictions on the payoff structure are eliminated and conditions that guarantee convergence to welfare minimizing actions w.p. 1 are derived under the assumption that the union of the interaction and communication graphs is strongly connected. We next consider the continuous time and continuous state space version of the problem based on ideas from extremum seeking control. A result on local convergence of the proposed algorithm to an arbitrarily small neighborhood of a local minimizer of the welfare function is proved. We include a novel analysis of a dynamic consensus algorithm that may be of independent interest. Stochastic methods are employed throughout in the proofs. Our results show how indirect communications (signaling between the agents via their interactions through the system) and direct communications (direct messages sent between the agents) can complement each other and lead to simple distributed control algorithms with remarkably good performance. There are many applications including: management of wind farms, coverage problems in sensor networks, robotic swarm formation control. We close by describing current and future research directions.

Seminar Speaker:

John Baras

John Baras

University of Maryland

B.S. in Electrical and Mechanical Engineering from the National Technical University of Athens, Greece, 1970; M.S. and Ph.D. in Applied Mathematics from Harvard University 1971, 1973. Since 1973 with the Electrical and Computer Engineering Department, and the Applied Mathematics Faculty, at the University of Maryland College Park. Since 2000 faculty member in the Fischell Department of Bioengineering. Since 2014 faculty member in the Mechanical Engineering Department. Founding Director of the Institute for Systems Research (ISR) from 1985 to 1991. Since 1991, has been the Director of the Maryland Center for Hybrid Networks (HYNET). Since 2013, Guest Professor at the Royal Institute of Technology (KTH), Sweden. Life Fellow of the IEEE and a Foreign Member of the Royal Swedish Academy of Engineering Sciences. Received the 1980 George Axelby Prize from the IEEE Control Systems Society and the 2006 Leonard Abraham Prize from the IEEE Communications Society. Professor Baras' research interests include control, communication and computing systems.