Co-Regulating Communication for Asynchronous Information Consensus

2018 ◽  
Author(s):  
Chandima Fernando ◽  
Carrick Detweiler ◽  
Justin Bradley
Keyword(s):  
Information Consensus

Decentralized control for mobile robotic sensor network self-deployment: barrier and sweep coverage problems

Robotica ◽  
2010 ◽  
Vol 29 (2) ◽  
pp. 283-294 ◽  
Author(s):  
Teddy M. Cheng ◽  
Andrey V. Savkin
Keyword(s):  
Sensor Network ◽  
Decentralized Control ◽  
Nearest Neighbor ◽  
Barrier Coverage ◽  
Control Law ◽  
Motion Coordination ◽  
Robotic Sensor ◽  
Information Consensus ◽  
Coverage Problems ◽  
Robotic Sensors

SUMMARYThis paper addresses the problems of barrier coverage and sweep coverage in a corridor environment with a network of self-deployed mobile autonomous robotic sensors. Using the ideas of nearest neighbor rules and information consensus, we propose a decentralized control law for the robotic sensors to solve the coverage problems. Numerical simulations illustrate the effectiveness of the proposed algorithm. The results in this paper demonstrate that such simple motion coordination rules can play a significant role in addressing the issue of coverage in a mobile robotic sensor network.

Consensus Problems for High-Order Multi-Agent Systems

2011 ◽  
Vol 403-408 ◽  
pp. 2736-2739
Author(s):  
Xu Zhu ◽  
Jian Guo Yan ◽  
Yao Hong Qu
Keyword(s):  
Network Topology ◽  
Necessary Conditions ◽  
High Order ◽  
Consensus Algorithm ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Directed Spanning Tree ◽  
Sufficient And Necessary Conditions ◽  
Multi Agent ◽  
Information Consensus

An information consensus algorithm for high-order multi-agent systems is proposed based on algebraic graph theory. Sufficient and necessary conditions are given for each information to converge to common values. The network topology of multi-agent systems has a directed spanning tree and each weight of different derivatives is positive, then consensus is achieved.

Sign in / Sign up

Export Citation Format

Share Document