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 2085273584 2899936862 2166188160 2002532572 1978708265 1502739482 2118941026 2058677708 2107851383 1862013120 2904365072 2256710691 2063801303 1134107867 2885459608 2141327408
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 We introduce an event driven communication logic for decentralized control of a network of robotic vehicles (agents). The strategy proposed is robust to packet losses and drives the vehicles to predefined paths while holding a desired geometric formation pattern. To this effect, the paper extends an existing cooperative path following framework to consider the practical case where communications among the vehicles occur at discrete instants, instead of continuously. The introduced communication logic takes into account the topology of the communication network, the fact that communications are discrete, and the cost of exchanging information. We also address explicitly communication losses and bounded delays. Conditions are derived under which the overall closed loop system is input-to-state practically stable. The communication logic is applied to a cooperative path-following control system of multiple underactuated autonomous marine robots. Simulation results are presented and discussed. In this paper we present a reformulation--framed as a constrained optimization problem--of multi-robot tasks which are encoded through a cost function that is to be minimized. The advantages of this approach are multiple. The constraint-based formulation provides a natural way of enabling long-term robot autonomy applications, where resilience and adaptability to changing environmental conditions are essential. Moreover, under certain assumptions on the cost function, the resulting controller is guaranteed to be decentralized. Furthermore, finite-time convergence can be achieved, while using local information only, and therefore preserving the decentralized nature of the algorithm. The developed control framework has been tested on a team of ground mobile robots implementing long-term environmental monitoring. Control of mobile networks raises fundamental and novel problems in controlling the structure of the resulting dynamic graphs. In particular, in applications involving mobile sensor networks and multi-agent systems, a great new challenge is the development of distributed motion algorithms that guarantee connectivity of the overall network. In this paper, we address this challenge using a novel control decomposition. First, motion control is performed in the continuous state space, where nearest neighbor potential fields are used to maintain existing links in the network. Second, distributed coordination protocols in the discrete graph space ensure connectivity of the switching network topology. Coordination is based on locally updated estimates of the abstract network topology by every agent as well as distributed auctions that enable tie breaking whenever simultaneous link deletions may violate connectivity. Integration of the overall system results in a distributed, multi- agent, hybrid system for which we show that, under certain secondary objectives on the agents and the assumption that the initial network is connected, the resulting motion always satisfies connectivity of the network. Our approach can also account for communication time delays in the network as well as collision avoidance, while its efficiency and scalability properties are illustrated in nontrivial computer simulations. With the introduction of Software Defined Networking (SDN), the concept of an external and optionally centralized network control plane, i.e. controller, is drawing the attention of researchers and industry. A particularly important task in the SDN context is the placement of such external resources in the network. In this paper, we discuss important aspects of the controller placement problem with a focus on SDN-based core networks, including different types of resilience and failure tolerance. When several performance and resilience metrics are considered, there is usually no single best controller placement solution, but a trade-off between these metrics. We introduce our framework for resilient Pareto-based Optimal COntroller-placement (POCO) that provides the operator of a network with all Pareto-optimal placements. The ideas and mechanisms are illustrated using the Internet2 OS3E topology and further evaluated on more than 140 topologies of the Topology Zoo. In particular, our findings reveal that for most of the topologies more than 20 of all nodes need to be controllers to assure a continuous connection of all nodes to one of the controllers in any arbitrary double link or node failure scenario. In this paper, we study the problem of reaching a consensus among all the agents in the networked control systems (NCS) in the presence of misbehaving agents. A reputation-based resilient distributed control algorithm is first proposed for the leader-follower consensus network. The proposed algorithm embeds a resilience mechanism that includes four phases (detection, mitigation, identification, and update), into the control process in a distributed manner. At each phase, every agent only uses local and one-hop neighbors' information to identify and isolate the misbehaving agents, and even compensate their effect on the system. We then extend the proposed algorithm to the leaderless consensus network by introducing and adding two recovery schemes (rollback and excitation recovery) into the current framework to guarantee the accurate convergence of the well-behaving agents in NCS. The effectiveness of the proposed method is demonstrated through case studies in multirobot formation control and wireless sensor networks. While there has been significant progress in recent years in the study of estimation and control of dynamic network graphs, limited attention has been paid to the experimental validation and verification of such algorithms on distributed teams of robots. In this work we conduct an experimental study of a non-trivial distributed connectivity control algorithm on a team of seven nonholonomic robots as well as in simulation. The implementation of the algorithm is completely decentralized and asynchronous, assuming that each robot only has access to its pose and knowledge of the total number of robots. All other necessary information is determined via message passing with neighboring robots. We show that such algorithms, requiring complex inter-agent communication and coordination, are feasible as well as highly successful in enabling a network of robots to adapt to disturbances while preserving connectivity. In order to accomplish cooperative tasks, multi-robot systems are required to communicate among each other. Thus, maintaining the connectivity of the communication graph is a fundamental issue. Connectivity maintenance has been extensively studied in the last few years, but generally considering only kinematic agents. In this paper we will introduce a control strategy that, exploiting a decentralized procedure for the estimation of the algebraic connectivity of the graph, ensures the connectivity maintenance for groups of Lagrangian systems. The control strategy is validated by means of analytical proofs and simulation results. We study how protocol design for various functionalities within a communication network architecture can be viewed as a distributed resource allocation problem. This involves understanding what resources are, how to allocate them fairly, and perhaps most importantly, how to achieve this goal in a distributed and stable fashion. We start with ideas of a centralized optimization framework and show how congestion control, routing and scheduling in wired and wireless networks can be thought of as fair resource allocation. We then move to the study of controllers that allow a decentralized solution of this problem. These controllers are the analytical equivalent of protocols in use on the Internet today, and we describe existing protocols as realizations of such controllers. The Internet is a dynamic system with feedback delays and flows that arrive and depart, which means that stability of the system cannot be taken for granted. We show how to incorporate stability into protocols, and thus, prevent undesirable network behavior. Finally, we consider a futuristic scenario where users are aware of the effects of their actions and try to game the system. We will see that the optimization framework is remarkably robust even to such gaming. Adaptation to partial failure is one of the most important requirements for space robotics, since space robots cannot be repaired after they have been launched. We propose a decentralized autonomous control algorithm for hyper-redundant manipulators that uses parallel processing with low-performance processors to achieve this adaptation. In this paper, a number of manipulator joints are locked at a certain angle in a computer simulation and the adaptability of the control algorithm to these failures is assessed. The control algorithm successfully continues its positioning task at a rate of more than 90 , even after half of its joints have failed. The control algorithm is also compared with behavior-based control architecture. We present a control framework for achieving encirclement of a target moving in 3D using a multi-robot system. Three variations of a basic control strategy are proposed for different versions of the encirclement problem, and their effectiveness is formally established. An extension ensuring maintenance of a safe inter-robot distance is also discussed. The proposed framework is fully decentralized and only requires local communication among robots; in particular, each robot locally estimates all the relevant global quantities. We validate the proposed strategy through simulations on kinematic point robots and quadrotor UAVs, as well as experiments on differential-drive wheeled mobile robots. In earlier work, we established a decentralized optimal control framework for coordinating online connected and automated vehicles (CAVs) in specific transportation segments, e.g., urban intersections, merging roadways, roundabouts, and speed reduction zones. In this paper, we address coordination of CAVs in a corridor with multiple such scenarios and derive a closed-form analytical solution that includes interior boundary conditions. We evaluate the effectiveness of the solution through simulation in VISSIM. The proposed approach reduces significantly both fuel consumption and travel time for the CAVs compared to the baseline scenario where traditional human-driven vehicles without control are considered. In this paper, we consider a robust network control problem. We consider linear unstable and uncertain discrete time plants with a network between the sensor and controller and the controller and plant. We investigate the effect of data drop out in the form of packet losses. Four distinct control schemes are explored and sufficient conditions to ensure almost sure stability of the closed loop system are derived for each of them in terms of minimum packet arrival rate and the maximum uncertainty. I. INTRODUCTION In the past decade, networked control systems (NCS) have gained much attention from both the control com- munity and the network and communication community. When compared with classical feedback control system, networked control systems have several advantages. For example, they can reduce the system wiring, make the system easy to operate and maintain and later diagnose in case of malfunctioning, and increase system agility (20). Although NCS have advantages, inserting a network in between the plant and the controller introduces many problems as well. For instance, zero-delayed sensing and actuation, perfect information and synchronization are no longer guaranteed in the new system architecture as only finite bandwidth is available and data packet drops and delays may occur due to network traffic conditions. These must be revisited and analyzed before networked control systems become prevalent. Recently, many researchers have spent effort on these issues and some significant results were obtained and many are in progress. Many of the aforementioned issues are studied separately. Tatikonda (19) and Sahai (13) have presented some interesting results in the area of control under communication constraints. Specifically, Tatikonda gave a necessary and sufficient condition on the channel data rate such that a noiseless LTI system in the closed loop is asymptotically stable. He also gave rate results for stabilizing a noisy LTI system over a digital channel. Sahai proposed the notion of anytime capacity to deal with real time estimation and control for a networked control system. In our paper (17), the authors have considered various rate issues under finite bandwidth, packet drops and finite controls. An optimal bit allocation scheme is given in (16) under the networked setting. The effect of pacekt drops on state estimation was studied by Sinopoli, et. al. in (3). It has further been investigated by many researchers including the present authors in (15) and (6). In this paper, we provide a theoretical framework for controlling graph connectivity in mobile robot networks. We discuss proximity-based communication models composed of disk-based or uniformly-fading-signal-strength communication links. A graph-theoretic definition of connectivity is provided, as well as an equivalent definition based on algebraic graph theory, which employs the adjacency and Laplacian matrices of the graph and their spectral properties. Based on these results, we discuss centralized and distributed algorithms to maintain, increase, and control connectivity in mobile robot networks. The various approaches discussed in this paper range from convex optimization and subgradient-descent algorithms, for the maximization of the algebraic connectivity of the network, to potential fields and hybrid systems that maintain communication links or control the network topology in a least restrictive manner. Common to these approaches is the use of mobility to control the topology of the underlying communication network. We discuss applications of connectivity control to multirobot rendezvous, flocking and formation control, where so far, network connectivity has been considered an assumption. Highlighting the control of networked robotic systems, this book synthesizes a unified passivity-based approach to an emerging cross-disciplinary subject. Thanks to this unified approach, readers can access various state-of-the-art research fields by studying only the background foundations associated with passivity. In addition to the theoretical results and techniques,the authors provide experimental case studies on testbeds of robotic systems including networked haptic devices, visual robotic systems, robotic network systems and visual sensor network systems.The text begins with an introduction to passivity and passivity-based control together with the other foundations needed in this book. The main body of the book consists of three parts. The first examines how passivity can be utilized for bilateral teleoperation and demonstrates the inherent robustness of the passivity-based controller against communication delays. The second part emphasizes passivitys usefulness for visual feedback control and estimation. Convergence is rigorously proved even when other passive components are interconnected. The passivity approach is also differentiated from other methodologies. The third part presents the unified passivity-based control-design methodology for multi-agent systems. This scheme is shown to be either immediately applicable or easily extendable to the solution of various motion coordination problems including 3-D attitude pose synchronization, flocking control and cooperative motion estimation.Academic researchers and practitioners working in systems and control and or robotics will appreciate the potential of the elegant and novel approach to the control of networked robots presented here. The limited background required and the case-study work described also make the text appropriate for and, it is hoped, inspiring to students. Automated network control and management has been a long standing target of network protocols. We address in this paper the question of automated protocol design, where distributed networked nodes have to cooperate to achieve a common goal without a priori knowledge on which information to exchange or the network topology. While reinforcement learning has often been proposed for this task, we propose here to apply recent methods from semi-supervised deep neural networks which are focused on graphs. Our main contribution is an approach for applying graph-based deep learning on distributed routing protocols via a novel neural network architecture named Graph-Query Neural Network. We apply our approach to the tasks of shortest path and max-min routing. We evaluate the learned protocols in cold-start and also in case of topology changes. Numerical results show that our approach is able to automatically develop efficient routing protocols for those two use-cases with accuracies larger than 95 . We also show that specific properties of network protocols, such as resilience to packet loss, can be explicitly included in the learned protocol. A distributed control law that guarantees connectivity maintenance in a network of multiple mobile agents is presented. The control law, which lets the agents perform formation manoeuvres, respects sensor limitations by allowing each agent to only take into account agents within its sensing radius. In contrast to previous approaches to the problem, the proposed control law does not attain infinite values whenever an edge of the communication graph tends to be lost. This is achieved via the use of decentralised navigation functions, which are bounded potential fields. The navigation functions are defined to take into account the connectivity maintenance objective. The authors first treat the case of connectivity maintenance for a static communication graph and then extend the result to the case of dynamic graphs. The results are illustrated on a formation control problem.