Network connectivity plays an important role in the information exchange between different agents in the multi-level networks. In this paper, we establish a game-theoretic framework to capture the uncoordinated nature of the decision-making at different layers of the multi-level networks. Specifically, we design a decentralized algorithm that aims to maximize the algebraic connectivity of the global network iteratively. In addition, we show that the designed algorithm converges to a Nash equilibrium asymptotically and yields an equilibrium network. To study the network resiliency, we introduce three adversarial attack models and characterize their worst-case impacts on the network performance. Case studies based on a two-layer mobile robotic network are used to corroborate the effectiveness and resiliency of the proposed algorithm and show the interdependency between different layers of the network during the recovery processes.
In the previous works, robotic network connectivity control problem is often addressed either in a totally centralized way @cite_5 @cite_0 @cite_29 @cite_2 , or completely decentralized way @cite_6 @cite_23 @cite_11 . The centralized framework yields an optimal network but with low resiliency, since responses to failures in a global network may not be instantaneous. The network resulting from the decentralized framework is resilient; however, it is difficult to achieve the team solution with limited coordination. Our framework stands in between these two frameworks and thus leads to balanced features in terms of resiliency and optimality.
@cite_29 @cite_6 @cite_0 @cite_23 @cite_2 @cite_5 @cite_11
2108556117 2070113904 2603752963 1788292158
To accomplish cooperative tasks, robotic systems are often required to communicate with each other. Thus, maintaining connectivity of the communication graph is a fundamental issue in the field of multi-robot systems. In this paper we present a completely decentralized control strategy for global connectivity maintenance of the communication graph. Considering the disk communication model, we describe a gradient-based control strategy that exploits decentralized estimation of the algebraic connectivity. Unlike previous approaches available in the literature, the proposed control algorithm solves the global connectivity problem in a decentralized manner providing theoretical guarantees, without requiring maintenance of the local connectivity between robotic systems. Moreover, results obtained with simulations and experiments on real robots are described for demonstrating the efficacy of the proposed algorithm. To accomplish cooperative tasks, robotic systems are often required to communicate with each other. Thus, maintaining connectivity of the interagent communication graph is a fundamental issue in the field of multi-robot systems. In this paper we present a completely decentralized control strategy for global connectivity maintenance of the interagent communication graph. We describe a gradient-based control strategy that exploits decentralized estimation of the algebraic connectivity. The proposed control algorithm guarantees the global connectivity of the communication graph without requiring maintenance of the local connectivity between the robotic systems. The control strategy is validated by means of an analytical proof and simulative results. In this paper, we address the connectivity maintenance problem for a multirobot system that moves according to a given bounded collective control objective. We assume that the interaction among the robotic units is limited by a given visibility radius both in terms of sensing and communication capabilities. For this scenario, we propose a decentralized bounded control law that can provably preserve the connectivity of the multirobot system over time. We characterize the effect of the connectivity control term on the achievement of the collective control objective by resorting to an input-to-state stability-like analysis. We provide numerical and experimental results to corroborate the theoretical findings and assess the effectiveness of the proposed bounded connectivity maintenance control law. This self-contained introduction to the distributed control of robotic networks offers a distinctive blend of computer science and control theory. The book presents a broad set of tools for understanding coordination algorithms, determining their correctness, and assessing their complexity; and it analyzes various cooperative strategies for tasks such as consensus, rendezvous, connectivity maintenance, deployment, and boundary estimation. The unifying theme is a formal model for robotic networks that explicitly incorporates their communication, sensing, control, and processing capabilities--a model that in turn leads to a common formal language to describe and analyze coordination algorithms.Written for first- and second-year graduate students in control and robotics, the book will also be useful to researchers in control theory, robotics, distributed algorithms, and automata theory. The book provides explanations of the basic concepts and main results, as well as numerous examples and exercises.Self-contained exposition of graph-theoretic concepts, distributed algorithms, and complexity measures for processor networks with fixed interconnection topology and for robotic networks with position-dependent interconnection topology Detailed treatment of averaging and consensus algorithms interpreted as linear iterations on synchronous networks Introduction of geometric notions such as partitions, proximity graphs, and multicenter functions Detailed treatment of motion coordination algorithms for deployment, rendezvous, connectivity maintenance, and boundary estimation