Finite-Time Consensus for Multiagent Systems With Cooperative and Antagonistic Interactions

Adaptive fuzzy fixed-time bipartite consensus control for stochastic nonlinear multi-agent systems with performance constraints

This paper investigates the fixed-time bipartite consensus control problem of stochastic nonlinear multi-agent systems (MASs) with performance constraints. A constraint scaling function is proposed to model the performance constraints with user-predefined steady-state accuracy and settling time without relying on the initial condition. Technically, the local synchronization error of each follower is mapped to a new error variable using the constraint scaling function and an error transformation function before being used to design the controller. To achieve fixed-time convergence of the local tracking error, a barrier function transforms the scaled synchronization error to a new variable to guarantee the prescribed performance. Then, an adaptive fuzzy fixed-time bipartite consensus controller is developed. The fuzzy logic system handles the uncertainties in the designing procedures, and one adaptive parameter needs to be estimated online. It is shown that the closed-loop system has practical fixed-time stability in probability, and the antagonistic network's consensus error evolves within user-predefined performance constraints. The simulation results evaluate the effectiveness of the developed control scheme.

Semi-Global Bipartite Fault-Tolerant Containment Control for Heterogeneous Multiagent Systems With Antagonistic Communication Networks and Input Saturation

Semi-global bipartite fault-tolerant containment control framework on antagonistic communication networks is proposed in this article for heterogeneous multiagent systems (MASs) under the influence of input saturation and actuator faults. An observer is constructed to estimate the leaders' states on signed digraph, where the communication networks are antagonistic. A fully distributed virtual control approach is developed to acquire the containment trajectory. Based on the observer, a semi-global containment control method is developed to compensate for the detrimental impacts of both input saturation and actuator faults. Besides, the dynamics and state-space dimensions of the agents can be different. The proposed framework overcomes two drawbacks of the conventional containment control: 1) the containment trajectory is obtained under general antagonistic communication networks, which is more general in engineering applications and 2) both actuator faults and input saturation are solved for heterogeneous agents, which relaxes the limitation of homogeneous dynamics. Finally, a simulation example is conducted to test and verify the feasibility of the proposed method framework.

Interval Bipartite Synchronization of Multiple Neural Networks in Signed Graphs

Interval bipartite consensus of multiagents described by signed graphs has received extensive concern recently, and the rooted cycles play a critical role in stabilization, while the structurally balanced graphs are essential to achieve bipartite consensus. However, the gauge transformation used in the linear system is no longer feasible in the nonlinear case. This article addresses interval bipartite synchronization of multiple neural networks (NNs) in a signed graph via a Lyapunov-based approach, extending the existing work to a more practical but complicated case. A general matrix M in signed graphs is introduced to construct the novel Lyapunov functions, and sufficient conditions are obtained. We find that the rooted cycles and the structurally balanced graphs are essential to stabilize and achieve bipartite synchronization. More importantly, we discover that the nonrooted cycles are crucial in reaching interval bipartite synchronization, not previously mentioned. Several examples are presented to illustrate interval bipartite synchronization of multiple NNs with signed graphs.

Data-Driven Adaptive Iterative Learning Bipartite Consensus for Heterogeneous Nonlinear Cooperation-Antagonism Networks

Heterogeneous dynamics, strongly nonlinear and nonaffine structures, and cooperation-antagonism networks are considered together in this work, which have been considered as challenging problems in the output consensus of multiagent systems. A heterogeneous linear data model (LDM) is presented to accommodate the nonlinear nonaffine structure of the heterogeneous agent. It also builds an I/O dynamic relationship of the agents along the iteration-dimensional direction to make it possible to learn control experience from previous iterations to improve the transient consensus performance. Then, an adaptive update algorithm is developed for the estimation of the uncertain parameters of the LDM to compensate for the unknown heterogeneous dynamics and model structures. To address the problem of cooperation and antagonism, an adaptive learning consensus protocol is proposed considering two signed graphs, which are structurally balanced and unbalanced, respectively. The learning gain can be regulated using the proposed adaptive updating law to enhance the adaptability to the uncertainties. With rigorous analysis, the bipartite consensus is proven in the case that the graph is structurally balanced, and the convergence of the agent output to zero is also proven in the case that the graph is unbalanced in its structure. The presented bipartite consensus method is data-based without the use of any explicit model information. The theoretical results are demonstrated through simulations.

A Novel Bipartite Consensus Tracking Control for Multiagent Systems Under Sensor Deception Attacks

This article presents a novel adaptive bipartite consensus tracking strategy for multiagent systems (MASs) under sensor deception attacks. The fundamental design philosophy is to develop a hierarchical algorithm based on shortest route technology that recasts the bipartite consensus tracking problem for MASs into the tracking problem for a single agent and eliminates the need for any global information of the Laplacian matrix. As the sensors suffer from malicious deception attacks, the states cannot be measured accurately, we thus construct a novel dynamic estimator to estimate the actual states, which, together with a new coordinate transformation involving the attacked and estimated state variables, allows a distributed security control scheme to be developed, in which the singularity of the adaptive iterative process involved in existing works is completely avoided. Furthermore, the Nussbaum functions are included in the controller to account for the influence of the unknown control gains caused by sensor deception attacks. It is shown that the distributed consensus tracking errors converge to a small neighborhood of the origin, and all the signals in the closed-loop system remain bounded. Simulation on a forced damped pendulums (FDPs) is conducted to demonstrate and verify the effectiveness of the proposed strategy.

Bipartite Consensus for Second-Order Multiagent Systems With Matrix-Weighted Signed Network

The second-order scalar-weighted consensus problem of multiagent systems has been well explored. However, in some practical antagonistic interaction networks, the interdependencies of multidimensional states of the agents must be described by matrix coupling. In order to highlight the influence of matrix coupling in the antagonistic interaction network, we investigate the second-order matrix-weighted bipartite consensus problem on undirected structurally balanced signed networks. Under the proposed bipartite consensus protocol, an algebraic condition is obtained for achieving second-order bipartite consensus via utilizing matrix-valued Gauge transformation and stability theory. Then, using the obtained criteria, a more direct algebraic graph condition is given for reaching bipartite consensus. Besides, because of the existence of negative (positive) semidefinite connections, the matrix-weighted network may have clustering phenomena, which means that matrix weights play a critical role in achieving consensus. An algebraic graph condition for admitting cluster bipartite consensus is provided. By designing matrix weights in practical scenarios, the required number of clusters can be obtained. Finally, the theoretical results are verified by five simulation examples.

Observer-Based Multiagent Bipartite Consensus With Deterministic Disturbances and Antagonistic Interactions

This article studies the multiagent bipartite consensus in networks with deterministic disturbances and antagonistic interactions. An observer-based output-feedback controller design is provided to guarantee the bipartite consensus with deterministic disturbances that satisfy the matching condition. Then, by considering that the bandwidths of communication channels are limited in practical systems, the event-triggered scenario of the proposed output controller for the bipartite consensus is further studied; the node-based broadcast updating fashion is utilized and the Zeno behavior is ruled out. Simulations are also offered to support the theoretical results of protocol designs.

A Distributed Lyapunov-Based Redesign Approach for Heterogeneous Uncertain Agents With Cooperation-Competition Interactions

A swarming behavior problem is investigated in this article for heterogeneous uncertain agents with cooperation-competition interactions. In such a problem, the agents are described by second-order continuous systems with different intrinsic nonlinear terms, which satisfies the "linearity-in-parameters" condition, and the agents' models are coupled together through a distributed protocol containing the information of competitive neighbors. Then, for four different types of cooperation-competition networks, a distributed Lyapunov-based redesign approach is proposed for the heterogeneous uncertain agents, where the distributed controller and the estimation laws of unknown parameters are obtained. Under their joint actions, the heterogeneous uncertain multiagent system can achieve distributed stabilization for structurally unbalanced networks and output bipartite consensus for structurally balanced networks. In particular, the concept of coherent networks is proposed for structurally unbalanced directed networks, which is beneficial to the design of distributed controllers. Finally, four illustrative examples are given to show the effectiveness of the designed distributed controller.

Distributed Controller Design and Analysis of Second-Order Signed Networks With Communication Delays

This article concentrates on dealing with distributed control problems for second-order signed networks subject to not only cooperative but also antagonistic interactions. A distributed control protocol is proposed based on the nearest neighbor rules, with which necessary and sufficient conditions are developed for consensus of second-order signed networks whose communication topologies are described by strongly connected signed digraphs. Besides, another distributed control protocol in the presence of a communication delay is designed, for which a time margin of the delay can be determined simultaneously. It is shown that under the delay margin condition, necessary and sufficient consensus results can be derived even though second-order signed networks with a communication delay are considered. Simulation examples are included to illustrate the validity of our established consensus results of second-order signed networks.

Simplifying Complex Network Stability Analysis via Hierarchical Node Aggregation and Optimal Periodic Control

In this study, the stability of a hierarchical network with delayed output is discussed by applying a kind of optimal periodic control. To reduce the number of the nodes of the original hierarchical network, an aggregation algorithm is first presented to take some nodes with the same information as an aggregated node. Furthermore, the stability of the original hierarchical network can be guaranteed by the optimal periodic control of the aggregated hierarchical network. Then, an optimal control scheme is proposed to reduce the bandwidth waste in information transmission. In the control scheme, the time sequence is separated into two parts: the deterministic segment and the dynamic segment. With the optimal control scheme, two targets are achieved: 1) the outputs of the original and aggregated hierarchical system are both asymptotically stable and 2) the nodes with slow convergent rate can catch up with the convergence speeds of other nodes.

Adaptive NN Distributed Control for Time-Varying Networks of Nonlinear Agents With Antagonistic Interactions

This article proposes an adaptive neural network (NN) distributed control algorithm for a group of high-order nonlinear agents with nonidentical unknown control directions (UCDs) under signed time-varying topologies. An important lemma on the convergence property is first established for agents with antagonistic time-varying interactions, and then by using Nussbaum-type functions, a new class of NN distributed control algorithms is proposed. If the signed time-varying topologies are cut-balanced and uniformly in time structurally balanced, then convergence is achieved for a group of nonlinear agents. Moreover, the proposed algorithms are adopted to achieve the bipartite consensus of high-order nonlinear agents with nonidentical UCDs under signed graphs, which are uniformly quasi-strongly δ -connected. Finally, simulation examples are given to illustrate the effectiveness of the NN distributed control algorithms.

Finite-Time Tracking Control for Nonlinear Systems via Adaptive Neural Output Feedback and Command Filtered Backstepping

This article is concerned with the tracking control problem for uncertain high-order nonlinear systems in the presence of input saturation. A finite-time control strategy combined with neural state observer and command filtered backstepping is proposed. The neural network models the unknown nonlinear dynamics, the finite-time command filter (FTCF) guarantees the approximation of its output to the derivative of virtual control signal in finite time at the backstepping procedure, and the fraction power-based error compensation system compensates for the filtering errors between FTCF and virtual signal. In addition, the input saturation problem is dealt with by introducing the auxiliary system. Overall, it is shown that the designed controller drives the output tracking error to the desired neighborhood of the origin at a finite time and all the signals in the closed-loop system are bounded at a finite time. Two simulation examples are given to demonstrate the control effectiveness.

Bipartite Fixed-Time Output Consensus of Heterogeneous Linear Multiagent Systems

In this article, the bipartite fixed-time output consensus problem of heterogeneous linear multiagent systems (MASs) is investigated. First, a distributed bipartite fixed-time observer is proposed, by which the follower can estimate the leader's state. The estimate value is the same as the leader's state in modulus but may not in sign due to the existence of antagonistic interactions between agents. Then, an adaptive bipartite fixed-time observer is further proposed. It is fully distributed without involving any global information. This adaptive bipartite fixed-time observer can estimate not only the leader's system matrix but also the leader's state. Next, distributed nonlinear control laws are developed based on two observers, respectively, such that the bipartite fixed-time output consensus of heterogeneous linear MASs can be achieved. Moreover, the upper bound of the settling time is independent of initial states of agents. Finally, the examples are given to demonstrate the results.

Multilayered Sampled-Data Iterative Learning Tracking for Discrete Systems With Cooperative-Antagonistic Interactions

The tracking for discrete systems is discussed by designing two kinds of multilayered iterative learning schemes with cooperative-antagonistic interactions in this paper. The definition of the signed graph is presented and iterative learning schemes are then designed to be multilayered and have cooperative-antagonistic interactions. Moreover, considering the limited bandwidth of information storage, the state information of these controllers is updated in light of previous learning iterations but not just dependent on the last iteration. Two simple criteria are addressed to discuss the tracking of discrete systems with multilayered and cooperative-antagonistic iterative schemes. The simulation results are shown to demonstrate the validity of the given criteria.

Constrained Quaternion-Variable Convex Optimization: A Quaternion-Valued Recurrent Neural Network Approach

This paper proposes a quaternion-valued one-layer recurrent neural network approach to resolve constrained convex function optimization problems with quaternion variables. Leveraging the novel generalized Hamilton-real (GHR) calculus, the quaternion gradient-based optimization techniques are proposed to derive the optimization algorithms in the quaternion field directly rather than the methods of decomposing the optimization problems into the complex domain or the real domain. Via chain rules and Lyapunov theorem, the rigorous analysis shows that the deliberately designed quaternion-valued one-layer recurrent neural network stabilizes the system dynamics while the states reach the feasible region in finite time and converges to the optimal solution of the considered constrained convex optimization problems finally. Numerical simulations verify the theoretical results.

Mean-square H∞ antagonistic formations of second-order multi-agent systems with multiplicative noises and external disturbances

In physical systems, since the acceleration is always regard as the control input, it is meaningful to study the coordination problems of the second-order multi-agent system. This paper devotes to the mean-square H_∞ antagonistic formation control of second-order multi-agent systems with multiplicative noises and external disturbances under directed signed topologies. To force all agents achieve antagonistic formation and attenuate the effect of communication noises and external disturbances, a novel distributed consensus control protocol with a time-invariant control gain is proposed where only the information that received from neighbors is utilized. And then, by combining the theories of graph, robust H_∞ control and stochastic analysis, some matrix inequalities conditions are deduced. It is proved that under the designed control protocol, the state of each agent converge to its own desired formation in its allied groups in the sense of mean square. Furthermore, numerical simulations are given for the purpose of showing that the proposed theoretical results are effective.

Finite-Time Consensus of Opinion Dynamics and its Applications to Distributed Optimization Over Digraph

In this paper, some efficient criteria for finite-time consensus of a class of nonsmooth opinion dynamics over a digraph are established. The lower and upper bounds on the finite settling time are obtained based respectively on the maximal and minimal cut capacity of the digraph. By using tools of the nonsmooth theory and algebraic graph theory, the Carathéodory and Filippov solutions of nonsmooth opinion dynamics are analyzed and compared in detail. In the sense of Filippov solutions, the dynamic consensus is demonstrated without a leader and the finite-time bipartite consensus is also investigated in a signed digraph correspondingly. To achieve a predetermined consensus, a leader agent is introduced to the considered agent networks. As an application, the nonsmooth compartmental dynamics in the presence of a leader is embedded in the proposed continuous-time protocol to solve the distributed optimization problems over an unbalanced digraph. The convergence to the optimal solution by using the proposed distributed algorithm is guaranteed with appropriately selected parameters. To verify the effectiveness of the proposed protocols, three numerical examples are performed.

Finite-Time Coordination Behavior of Multiple Euler-Lagrange Systems in Cooperation-Competition Networks

In this paper, the finite-time coordination behavior of multiple Euler-Lagrange systems in cooperation-competition networks is investigated, where the coupling weights can be either positive or negative. Then, two auxiliary variables about the information exchange among agents are designed, and the finite-time distributed protocol is proposed based on the auxiliary variables and the property of the Euler-Lagrange system. By combining the approach of adding a power integrator with the homogeneous domination method, it is shown that finite-time bipartite consensus can be achieved if the cooperation-competition network is structurally balanced and the parameters of the distributed protocol are chosen appropriately; otherwise, finite-time distributed stabilization can be achieved. Furthermore, from the perspective of network decomposition, the finite-time coordination behavior is further considered, and some sufficient conditions about the cooperation subnetwork and the competition subnetwork are obtained. As an extension, finite-time coordination behavior only with partial state information of the neighbors is discussed, and some similar results are obtained. Finally, four numerical examples are shown for illustration.

Finite-Time Distributed Average Tracking for Second-Order Nonlinear Systems

This paper studies the distributed average tracking (DAT) problem for multiple reference signals described by the second-order nonlinear dynamical systems. Leveraging the state-dependent gain design and the adaptive control approaches, a couple of DAT algorithms are developed in this paper, which are named finite-time and adaptive-gain DAT algorithms. Based on the finite-time one, the states of the physical agents in this paper can track the average of the time-varying reference signals within a finite settling time. Furthermore, the finite settling time is also estimated by considering a well-designed Lyapunov function in this paper. Compared with asymptotical DAT algorithms, the proposed finite-time algorithm not only solve finite-time DAT problems but also ensure states of physical agents to achieve an accurate average of the multiple signals. Then, an adaptive-gain DAT algorithm is designed. Based on the adaptive-gain one, the DAT problem is solved without global information. Thus, it is fully distributed. Finally, numerical simulations show the effectiveness of the theoretical results.

Practical Time-Varying Formation Tracking for Second-Order Nonlinear Multiagent Systems With Multiple Leaders Using Adaptive Neural Networks

Practical time-varying formation tracking problems for second-order nonlinear multiagent systems with multiple leaders are investigated using adaptive neural networks (NNs), where the time-varying formation tracking error caused by time-varying external disturbances can be arbitrarily small. Different from the previous work, there exists a predefined time-varying formation formed by the states of the followers and the formation tracks the convex combination of the states of the leaders with unknown control inputs. Besides, the dynamics of each agent has both matched/mismatched heterogeneous nonlinearities and disturbances simultaneously. First, a practical time-varying formation tracking protocol using adaptive NNs is proposed, which is constructed using only local neighboring information. The proposed control protocol can process not only the matched/mismatched heterogeneous nonlinearities and disturbances, but also the unknown control inputs of the leaders. Second, an algorithm with three steps is introduced to design the practical formation tracking protocol, where the parameters of the protocol are determined, and the practical time-varying formation tracking feasibility condition is given. Third, the stability of the closed-loop multiagent system is proven by using the Lyapunov theory. Finally, a simulation example is showed to illustrate the effectiveness of the obtained theoretical results.

Swarming Behavior of Multiple Euler-Lagrange Systems With Cooperation-Competition Interactions: An Auxiliary System Approach

In this paper, the swarming behavior of multiple Euler-Lagrange systems with cooperation-competition interactions is investigated, where the agents can cooperate or compete with each other and the parameters of the systems are uncertain. The distributed stabilization problem is first studied, by introducing an auxiliary system to each agent, where the common assumption that the cooperation-competition network satisfies the digon sign-symmetry condition is removed. Based on the input-output property of the auxiliary system, it is found that distributed stabilization can be achieved provided that the cooperation subnetwork is strongly connected and the parameters of the auxiliary system are chosen appropriately. Furthermore, as an extension, a distributed consensus tracking problem of the considered multiagent systems is discussed, where the concept of equi-competition is introduced and a new pinning control strategy is proposed based on the designed auxiliary system. Finally, illustrative examples are provided to show the effectiveness of the theoretical analysis.

Adaptive Consensus Control of Nonlinear Multiagent Systems With Unknown Control Directions Under Stochastic Topologies

The consensus problem over high-order nonlinear multiagent systems with the Brunovsky-type model is studied. The model parameters and control directions of agents are supposed to be unknown. Hence, based on Nussbaum-type functions, an adaptive protocol is proposed, which guarantees achieving consensus in the network when the parameters and control directions of the agents are unknown and unidentical. The main contribution of this paper (compared with the existing similar results in the literature) is to guarantee achieving consensus in networks of agents when the communication topology is not connected constantly, and communication links stochastically switch over time. It is shown that if the probability of the network connectivity is not zero, under some conditions, almost sure consensus can be achieved. Illustrative examples verify the accuracy of the proposed consensus protocol.

Avoiding Congestion in Cluster Consensus of the Second-Order Nonlinear Multiagent Systems

In order to avoid congestion in the second-order nonlinear leader-following multiagent systems over capacity-limited paths, an approach called cluster lag consensus is proposed, which means that the agents in different clusters will pass through the same positions with the same velocities but lag behind the leader at different times. Lyapunov functionals and matrix theory are applied to analyze such cluster lag consensus. It is shown that when the graphic roots of clusters are influenced by the leader and the intracoupling of cluster agents is larger than a threshold, the cluster lag consensus can be achieved. Furthermore, the cluster lag consensus with a time-varying communication topology is investigated. Finally, an illustrative example is presented to demonstrate the effectiveness of the theoretical results. In particular, when the physical sizes of the agents are taken into consideration, it is shown that with a rearrangement and a position transformation, the multiagent system will reach cluster lag consensus in the new coordinate system. This means that all agents in the same cluster will reach consensus on the velocity, but their positions may be different and yet their relative positions converge to a constant asymptotically.

Distributed Adaptive Finite-Time Approach for Formation-Containment Control of Networked Nonlinear Systems Under Directed Topology

This paper presents a distributed adaptive finite-time control solution to the formation-containment problem for multiple networked systems with uncertain nonlinear dynamics and directed communication constraints. By integrating the special topology feature of the new constructed symmetrical matrix, the technical difficulty in finite-time formation-containment control arising from the asymmetrical Laplacian matrix under single-way directed communication is circumvented. Based upon fractional power feedback of the local error, an adaptive distributed control scheme is established to drive the leaders into the prespecified formation configuration in finite time. Meanwhile, a distributed adaptive control scheme, independent of the unavailable inputs of the leaders, is designed to keep the followers within a bounded distance from the moving leaders and then to make the followers enter the convex hull shaped by the formation of the leaders in finite time. The effectiveness of the proposed control scheme is confirmed by the simulation.

Terminal Sliding Mode-Based Consensus Tracking Control for Networked Uncertain Mechanical Systems on Digraphs

This brief investigates the finite-time consensus tracking control problem for networked uncertain mechanical systems on digraphs. A new terminal sliding-mode-based cooperative control scheme is developed to guarantee that the tracking errors converge to an arbitrarily small bound around zero in finite time. All the networked systems can have different dynamics and all the dynamics are unknown. A neural network is used at each node to approximate the local unknown dynamics. The control schemes are implemented in a fully distributed manner. The proposed control method eliminates some limitations in the existing terminal sliding-mode-based consensus control methods and extends the existing analysis methods to the case of directed graphs. Simulation results on networked robot manipulators are provided to show the effectiveness of the proposed control algorithms.

Cooperative Adaptive Output Regulation for Second-Order Nonlinear Multiagent Systems With Jointly Connected Switching Networks

This paper studies the cooperative global robust output regulation problem for a class of heterogeneous second-order nonlinear uncertain multiagent systems with jointly connected switching networks. The main contributions consist of the following three aspects. First, we generalize the result of the adaptive distributed observer from undirected jointly connected switching networks to directed jointly connected switching networks. Second, by performing a new coordinate and input transformation, we convert our problem into the cooperative global robust stabilization problem of a more complex augmented system via the distributed internal model principle. Third, we solve the stabilization problem by a distributed state feedback control law. Our result is illustrated by the leader-following consensus problem for a group of Van der Pol oscillators.

Finite-Time and Fixed-Time Cluster Synchronization With or Without Pinning Control

In this paper, the finite-time and fixed-time cluster synchronization problem for complex networks with or without pinning control are discussed. Finite-time (or fixed-time) synchronization has been a hot topic in recent years, which means that the network can achieve synchronization in finite-time, and the settling time depends on the initial values for finite-time synchronization (or the settling time is bounded by a constant for any initial values for fixed-time synchronization). To realize the finite-time and fixed-time cluster synchronization, some simple distributed protocols with or without pinning control are designed and the effectiveness is rigorously proved. Several sufficient criteria are also obtained to clarify the effects of coupling terms for finite-time and fixed-time cluster synchronization. Especially, when the cluster number is one, the cluster synchronization becomes the complete synchronization problem; when the network has only one node, the coupling term between nodes will disappear, and the synchronization problem becomes the simplest master-slave case, which also includes the stability problem for nonlinear systems like neural networks. All these cases are also discussed. Finally, numerical simulations are presented to demonstrate the correctness of obtained theoretical results.

Distributed Finite-Time Cooperative Control of Multiple High-Order Nonholonomic Mobile Robots

The consensus problem of multiple nonholonomic mobile robots in the form of high-order chained structure is considered in this paper. Based on the model features and the finite-time control technique, a finite-time cooperative controller is explicitly constructed which guarantees that the states consensus is achieved in a finite time. As an application of the proposed results, finite-time formation control of multiple wheeled mobile robots is studied and a finite-time formation control algorithm is proposed. To show effectiveness of the proposed approach, a simulation example is given.

Task-Space Synchronization of Networked Mechanical Systems With Uncertain Parameters and Communication Delays

This paper addresses the adaptive synchronization problem of networked mechanical systems in task space with time-varying communication delays, where both kinematic and dynamic uncertainties are considered and the information flow in the networks is represented by a directed graph. Based on a novel coordination auxiliary system, we first extend existing feedback architecture to achieve synchronization of networked mechanical systems in task space with slow-varying delays. Given that abrupt turns arise for the delays sometimes, we then propose a delay-independent adaptive synchronization control scheme which removes the requirement of the slow-varying condition. Both of the two control schemes are established with time-domain approaches by using Lyapunov-Krasovskii functions. Simulation results are provided to demonstrate the effectiveness of the proposed control schemes.