465 research outputs found

    Distributed Model-Free Bipartite Consensus Tracking for Unknown Heterogeneous Multi-Agent Systems with Switching Topology

    Get PDF
    This paper proposes a distributed model-free adaptive bipartite consensus tracking (DMFABCT) scheme. The proposed scheme is independent of a precise mathematical model, but can achieve both bipartite time-invariant and time-varying trajectory tracking for unknown dynamic discrete-time heterogeneous multi-agent systems (MASs) with switching topology and coopetition networks. The main innovation of this algorithm is to estimate an equivalent dynamic linearization data model by the pseudo partial derivative (PPD) approach, where only the input–output (I/O) data of each agent is required, and the cooperative interactions among agents are investigated. The rigorous proof of the convergent property is given for DMFABCT, which reveals that the trajectories error can be reduced. Finally, three simulations results show that the novel DMFABCT scheme is effective and robust for unknown heterogeneous discrete-time MASs with switching topologies to complete bipartite consensus tracking tasks

    Finite-time and fixed-time sliding mode control for second-order nonlinear multiagent systems with external disturbances

    Get PDF
    In this paper, the leader-following consensus of second-order nonlinear multiagent systems (SONMASs) with external disturbances is studied. Firstly, based on terminal sliding model control method, a distributed control protocol is proposed over undirected networks, which can not only suppress the external disturbances, but also make the SONMASs achieve consensus in finite time. Secondly, to make the settling time independent of the initial values of systems, we improve the protocol and ensure that the SONMASs can reach the sliding surface and achieve consensus in fixed time if the control parameters satisfy some conditions. Moreover, for general directed networks, we design a new fixed-time control protocol and prove that both the sliding mode surface and consensus for SONMASs can be reached in fixed time. Finally, several numerical simulations are given to show the effectiveness of the proposed protocols

    Adaptive and learning-based formation control of swarm robots

    Get PDF
    Autonomous aerial and wheeled mobile robots play a major role in tasks such as search and rescue, transportation, monitoring, and inspection. However, these operations are faced with a few open challenges including robust autonomy, and adaptive coordination based on the environment and operating conditions, particularly in swarm robots with limited communication and perception capabilities. Furthermore, the computational complexity increases exponentially with the number of robots in the swarm. This thesis examines two different aspects of the formation control problem. On the one hand, we investigate how formation could be performed by swarm robots with limited communication and perception (e.g., Crazyflie nano quadrotor). On the other hand, we explore human-swarm interaction (HSI) and different shared-control mechanisms between human and swarm robots (e.g., BristleBot) for artistic creation. In particular, we combine bio-inspired (i.e., flocking, foraging) techniques with learning-based control strategies (using artificial neural networks) for adaptive control of multi- robots. We first review how learning-based control and networked dynamical systems can be used to assign distributed and decentralized policies to individual robots such that the desired formation emerges from their collective behavior. We proceed by presenting a novel flocking control for UAV swarm using deep reinforcement learning. We formulate the flocking formation problem as a partially observable Markov decision process (POMDP), and consider a leader-follower configuration, where consensus among all UAVs is used to train a shared control policy, and each UAV performs actions based on the local information it collects. In addition, to avoid collision among UAVs and guarantee flocking and navigation, a reward function is added with the global flocking maintenance, mutual reward, and a collision penalty. We adapt deep deterministic policy gradient (DDPG) with centralized training and decentralized execution to obtain the flocking control policy using actor-critic networks and a global state space matrix. In the context of swarm robotics in arts, we investigate how the formation paradigm can serve as an interaction modality for artists to aesthetically utilize swarms. In particular, we explore particle swarm optimization (PSO) and random walk to control the communication between a team of robots with swarming behavior for musical creation

    Event-triggering architectures for adaptive control of uncertain dynamical systems

    Get PDF
    In this dissertation, new approaches are presented for the design and implementation of networked adaptive control systems to reduce the wireless network utilization while guaranteeing system stability in the presence of system uncertainties. Specifically, the design and analysis of state feedback adaptive control systems over wireless networks using event-triggering control theory is first presented. The state feedback adaptive control results are then generalized to the output feedback case for dynamical systems with unmeasurable state vectors. This event-triggering approach is then adopted for large-scale uncertain dynamical systems. In particular, decentralized and distributed adaptive control methodologies are proposed with reduced wireless network utilization with stability guarantees. In addition, for systems in the absence of uncertainties, a new observer-free output feedback cooperative control architecture is developed. Specifically, the proposed architecture is predicated on a nonminimal state-space realization that generates an expanded set of states only using the filtered input and filtered output and their derivatives for each vehicle, without the need for designing an observer for each vehicle. Building on the results of this new observer-free output feedback cooperative control architecture, an event-triggering methodology is next proposed for the output feedback cooperative control to schedule the exchanged output measurements information between the agents in order to reduce wireless network utilization. Finally, the output feedback cooperative control architecture is generalized to adaptive control for handling exogenous disturbances in the follower vehicles. For each methodology, the closed-loop system stability properties are rigorously analyzed, the effect of the user-defined event-triggering thresholds and the controller design parameters on the overall system performance are characterized, and Zeno behavior is shown not to occur with the proposed algorithms --Abstract, page iv

    Data Driven Distributed Bipartite Consensus Tracking for Nonlinear Multiagent Systems via Iterative Learning Control

    Get PDF
    This article explores a data-driven distributed bipartite consensus tracking (DBCT) problem for discrete-time multi-agent systems (MASs) with coopetition networks under repeatable operations. To solve this problem, a time-varying linearization model along the iteration axis is first established by using the measurement input and output (I/O) data of agents. Then a data-driven distributed bipartite consensus iterative learning control (DBCILC) algorithm is proposed considering both fixed and switching topologies. Compared with existing bipartite consensus, the main characteristic is to construct the proposed control protocol without requiring any explicit or implicit information of MASs’ mathematical model. The difference from existing iterative learning control (ILC) approaches is that both the cooperative interactions and antagonistic interactions, and time-varying switching topologies are considered. Furthermore, through rigorous theoretical analysis, the proposed DBCILC approach can guarantee the bipartite consensus reducing tracking errors in the limited iteration steps. Moreover, although not all agents can receive information from the virtual leader directly, the proposed distributed scheme can maintain the performance and reduce the costs of communication. The results of three examples further illustrate the correctness, effectiveness, and applicability of the proposed algorithm

    Data-Driven Architecture to Increase Resilience In Multi-Agent Coordinated Missions

    Get PDF
    The rise in the use of Multi-Agent Systems (MASs) in unpredictable and changing environments has created the need for intelligent algorithms to increase their autonomy, safety and performance in the event of disturbances and threats. MASs are attractive for their flexibility, which also makes them prone to threats that may result from hardware failures (actuators, sensors, onboard computer, power source) and operational abnormal conditions (weather, GPS denied location, cyber-attacks). This dissertation presents research on a bio-inspired approach for resilience augmentation in MASs in the presence of disturbances and threats such as communication link and stealthy zero-dynamics attacks. An adaptive bio-inspired architecture is developed for distributed consensus algorithms to increase fault-tolerance in a network of multiple high-order nonlinear systems under directed fixed topologies. In similarity with the natural organisms’ ability to recognize and remember specific pathogens to generate its immunity, the immunity-based architecture consists of a Distributed Model-Reference Adaptive Control (DMRAC) with an Artificial Immune System (AIS) adaptation law integrated within a consensus protocol. Feedback linearization is used to modify the high-order nonlinear model into four decoupled linear subsystems. A stability proof of the adaptation law is conducted using Lyapunov methods and Jordan decomposition. The DMRAC is proven to be stable in the presence of external time-varying bounded disturbances and the tracking error trajectories are shown to be bounded. The effectiveness of the proposed architecture is examined through numerical simulations. The proposed controller successfully ensures that consensus is achieved among all agents while the adaptive law v simultaneously rejects the disturbances in the agent and its neighbors. The architecture also includes a health management system to detect faulty agents within the global network. Further numerical simulations successfully test and show that the Global Health Monitoring (GHM) does effectively detect faults within the network

    Mobile Robots

    Get PDF
    The objective of this book is to cover advances of mobile robotics and related technologies applied for multi robot systems' design and development. Design of control system is a complex issue, requiring the application of information technologies to link the robots into a single network. Human robot interface becomes a demanding task, especially when we try to use sophisticated methods for brain signal processing. Generated electrophysiological signals can be used to command different devices, such as cars, wheelchair or even video games. A number of developments in navigation and path planning, including parallel programming, can be observed. Cooperative path planning, formation control of multi robotic agents, communication and distance measurement between agents are shown. Training of the mobile robot operators is very difficult task also because of several factors related to different task execution. The presented improvement is related to environment model generation based on autonomous mobile robot observations

    On Iterative Learning in Multi-agent Systems Coordination and Control

    Get PDF
    Ph.DDOCTOR OF PHILOSOPH

    Safe and Secure Control of Connected and Automated Vehicles

    Get PDF
    Evolution of Connected and Automated Vehicles (CAV), as an important class of Cyber-Physical Systems (CPS), plays a crucial role in providing innovative services in transport and traffic management. Vehicle platoons, as a set of CAV, forming a string of connected vehicles, have offered significant enhancements in traffic management, energy consumption, and safety in intelligent transportation systems. However, due to the existence of the cyber layer in these systems, subtle security related issues have been underlined and need to be taken into account with sufficient attention. In fact, despite the benefits brought by the platoons, they potentially suffer from insecure networks which provide the connectivity among the vehicles participating in the platoon which makes these systems prone to be under the risk of cyber attacks. One (or more) external intelligent intruder(s) might attack one (or more) of the vehicles participating in a platoon. In this respect, the need for a safe and secure driving experience is highly sensible and crucial. Hence, we will concentrate on improving the safety and security of CAVs in different scenarios by taking advantage of security related approaches and CAV control systems. In this thesis, we are going to focus on two main levels of platoon control, namely I) High level secure platoon control, and II) Low level secure platoon control. In particular, in the high level part, we consider platoons with arbitrary inter-vehicular communication topoloy whereby the vehicles are able to exchange their driving data with each other through DSRC-based environment. The whole platoon is modeled using graph-theoretic notions by denoting the vehicles as the nodes and the inter-vehicular communication quality as the edge weights. We study the security of the vehicle platoon exposed to cyber attacks using a novel game-theoretic approach. The platoon topologies under investigation are directed (called predecessor following) or undirected (bidirectional) weighted graphs. The attacker-detector game is defined as follows. The attacker targets some vehicles in the platoon to attack and the detector deploys monitoring sensors on the vehicles. The attacker's objective is to be as stealthy to the sensors as possible while the detector tries to place the monitoring sensors to detect the attack impact as much as he can. The existence of equilibrium strategies for this game is investigated based on which the detector can choose specific vehicles to put his sensors on and increase the security level of the system. Moreover, we study the effect of adding (or removing) communication links between vehicles on the game value. We then address the same problem while investigating the optimal actuator placement strategy needed by the defender to mitigate the effects of the attack. In this respect, the energy needed by the attacker to steer the consensus follower-leader dynamics of the system towards his desired direction is used as the game payoff. Simulation and experimental results conducted on a vehicle platoon setup using Robotic Operating System (ROS) demonstrate the effectiveness of our analyses. In the low level platoon control, we exploit novel secure model predictive controller algorithms to provide suitable countermeasure against a prevalent data availability attack, namely Denial-of-Service (DoS) attack. A DoS intruder can endanger the security of platoon by jamming the communication network among the vehicles which is responsible to transmit inter-vehicular data throughout the platoon. In other words, he may cause a failure in the network by jamming it or injecting a huge amount of delay, which in essence makes the outdated transferred data useless. This can potentially result in huge performance degradation or even hazardous collisions. We propose novel secure distributed nonlinear model predictive control algorithms for both static and dynamic nonlinear heterogeneous platoons which are capable of handling DoS attack performed on a platoon equipped by different communication topologies and at the same time they guarantee the desired formation control performance. Notably, in the dynamic case, our proposed method is capable of providing safe and secure control of the platoon in which arbitrary vehicles might perform cut-in and/or cut-out maneuvers. Convergence time analysis of the system are also investigated. Simulation results on a sample heterogeneous attacked platoon exploiting two-predecessor follower communication environment demonstrates the fruitfulness of the method
    corecore