Application of semidefinite programming to maximize the spectral gap produced by node removal

The smallest positive eigenvalue of the Laplacian of a network is called the spectral gap and characterizes various dynamics on networks. We propose mathematical programming methods to maximize the spectral gap of a given network by removing a fixed number of nodes. We formulate relaxed versions of the original problem using semidefinite programming and apply them to example networks.Comment: 1 figure. Short paper presented in CompleNet, Berlin, March 13-15 (2013

Experimental study of the robust global synchronization of Brockett oscillators

International audienceThis article studies the experimental synchronization of a family of a recently proposed oscillator model, i.e. the Brockett oscillator [Brockett, 2013]. Due to its structural property, Brockett oscillator can be considered as a promising benchmark nonlinear model for investigating synchronization and the consensus phenomena. Our experimental setup consists of analog circuit realizations of a network of Brockett oscillators. Experimental results obtained in this work correspond to the prior theoretical findings

Distributed Adaptive Attitude Synchronization of Multiple Spacecraft

This paper addresses the distributed attitude synchronization problem of multiple spacecraft with unknown inertia matrices. Two distributed adaptive controllers are proposed for the cases with and without a virtual leader to which a time-varying reference attitude is assigned. The first controller achieves attitude synchronization for a group of spacecraft with a leaderless communication topology having a directed spanning tree. The second controller guarantees that all spacecraft track the reference attitude if the virtual leader has a directed path to all other spacecraft. Simulation examples are presented to illustrate the effectiveness of the results.Comment: 13 pages, 11 figures. To appear in SCIENCE CHINA Technological Science

Aggregation Pattern Transitions by Slightly Varying the Attractive/Repulsive Function

Among collective behaviors of biological swarms and flocks, the attractive/repulsive (A/R) functional links between particles play an important role. By slightly changing the cutoff distance of the A/R function, a drastic transition between two distinct aggregation patterns is observed. More precisely, a large cutoff distance yields a liquid-like aggregation pattern where the particle density decreases monotonously from the inside to the outwards within each aggregated cluster. Conversely, a small cutoff distance produces a crystal-like aggregation pattern where the distance between each pair of neighboring particles remains constant. Significantly, there is an obvious spinodal in the variance curve of the inter-particle distances along the increasing cutoff distances, implying a legible transition pattern between the liquid-like and crystal-like aggregations. This work bridges the aggregation phenomena of physical particles and swarming of organisms in nature upon revealing some common mechanism behind them by slightly varying their inter-individual attractive/repulsive functions, and may find its potential engineering applications, for example, in the formation design of multi-robot systems and unmanned aerial vehicles (UAVs)

Consensus via multi-population robust mean-field games

In less prescriptive environments where individuals are told ‘what to do’ but not ‘how to do’, synchronization can be a byproduct of strategic thinking, prediction, and local interactions. We prove this in the context of multipopulation robust mean-field games. The model sheds light on a multi-scale phenomenon involving fast synchronization within the same population and slow inter-cluster oscillation between different populations

Distributed model predictive control of linear systems with coupled constraints based on collective neurodynamic optimization

© Springer Nature Switzerland AG 2018. Distributed model predictive control explores an array of local predictive controllers that synthesize the control of subsystems independently yet they communicate to efficiently cooperate in achieving the closed-loop control performance. Distributed model predictive control problems naturally result in sequential distributed optimization problems that require real-time solution. This paper presents a collective neurodynamic approach to design and implement the distributed model predictive control of linear systems in the presence of globally coupled constraints. For each subsystem, a neurodynamic model minimizes its cost function using local information only. According to the communication topology of the network, neurodynamic models share information to their neighbours to reach consensus on the optimal control actions to be carried out. The collective neurodynamic models are proven to guarantee the global optimality of the model predictive control system

A practical approach for outdoors distributed target localization in wireless sensor networks

Wireless sensor networks are posed as the new communication paradigm where the use of small, low-complexity, and low-power devices is preferred over costly centralized systems. The spectra of potential applications of sensor networks is very wide, ranging from monitoring, surveillance, and localization, among others. Localization is a key application in sensor networks and the use of simple, efficient, and distributed algorithms is of paramount practical importance. Combining convex optimization tools with consensus algorithms we propose a distributed localization algorithm for scenarios where received signal strength indicator readings are used. We approach the localization problem by formulating an alternative problem that uses distance estimates locally computed at each node. The formulated problem is solved by a relaxed version using semidefinite relaxation technique. Conditions under which the relaxed problem yields to the same solution as the original problem are given and a distributed consensusbased implementation of the algorithm is proposed based on an augmented Lagrangian approach and primaldual decomposition methods. Although suboptimal, the proposed approach is very suitable for its implementation in real sensor networks, i.e., it is scalable, robust against node failures and requires only local communication among neighboring nodes. Simulation results show that running an additional local search around the found solution can yield performance close to the maximum likelihood estimate

Intelligent Cooperative Control Architecture: A Framework for Performance Improvement Using Safe Learning

Planning for multi-agent systems such as task assignment for teams of limited-fuel unmanned aerial vehicles (UAVs) is challenging due to uncertainties in the assumed models and the very large size of the planning space. Researchers have developed fast cooperative planners based on simple models (e.g., linear and deterministic dynamics), yet inaccuracies in assumed models will impact the resulting performance. Learning techniques are capable of adapting the model and providing better policies asymptotically compared to cooperative planners, yet they often violate the safety conditions of the system due to their exploratory nature. Moreover they frequently require an impractically large number of interactions to perform well. This paper introduces the intelligent Cooperative Control Architecture (iCCA) as a framework for combining cooperative planners and reinforcement learning techniques. iCCA improves the policy of the cooperative planner, while reduces the risk and sample complexity of the learner. Empirical results in gridworld and task assignment for fuel-limited UAV domains with problem sizes up to 9 billion state-action pairs verify the advantage of iCCA over pure learning and planning strategies

Robotic Wireless Sensor Networks

In this chapter, we present a literature survey of an emerging, cutting-edge, and multi-disciplinary field of research at the intersection of Robotics and Wireless Sensor Networks (WSN) which we refer to as Robotic Wireless Sensor Networks (RWSN). We define a RWSN as an autonomous networked multi-robot system that aims to achieve certain sensing goals while meeting and maintaining certain communication performance requirements, through cooperative control, learning and adaptation. While both of the component areas, i.e., Robotics and WSN, are very well-known and well-explored, there exist a whole set of new opportunities and research directions at the intersection of these two fields which are relatively or even completely unexplored. One such example would be the use of a set of robotic routers to set up a temporary communication path between a sender and a receiver that uses the controlled mobility to the advantage of packet routing. We find that there exist only a limited number of articles to be directly categorized as RWSN related works whereas there exist a range of articles in the robotics and the WSN literature that are also relevant to this new field of research. To connect the dots, we first identify the core problems and research trends related to RWSN such as connectivity, localization, routing, and robust flow of information. Next, we classify the existing research on RWSN as well as the relevant state-of-the-arts from robotics and WSN community according to the problems and trends identified in the first step. Lastly, we analyze what is missing in the existing literature, and identify topics that require more research attention in the future

Nonlinear consensus protocols for multi-agent systems based on centre manifold reduction

This paper investigates nonlinear consensus protocols for dynamic directed networks of multiagent systems with fixed and switching topology, respectively. Based on center manifold reduction technic, nonlinear consensus protocols are presented. We prove a group of agents can reach a ¯¡consensus , which the group decision value varies from the minimum and the maximum values of the agents’ initial states. Moreover, we derive conditions to guarantee all agents reach a consensus on a desired group decision values. Finally, A simulation study concerning the vertical alignment maneuver of a team of unmanned air vehicles is performed. Simulation results show the nonlinear consensus protocols proposed are more effective than the linear protocols for the formation control of the agents and it is an improvement over existing protocols