The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Network alignment and network completion are two fundamental cornerstones behind many high-impact graph mining applications. The state-of-the-arts have been addressing these tasks in parallel. In this paper, we argue that network alignment and completion are inherently complementary with each other, and hence propose to jointly address them so that the two tasks can benefit from each other. We formulate...
The alignment of protein-protein interaction (PPI) networks is an effective approach to uncover the functionally conserved sub-structure between networks. A wealth of approaches have been developed for global PPI network alignment in recent years. However, due to the computational intractability caused by its NP-completeness, global PPI network alignment remains challenging in finding large conserved...
The guaranteed performance consensus for multiple agents with Lipschitz nonlinear dynamics is investigated by using the delayed consensus protocol. Based on state errors between the one agent and the other agents, the performance function is introduced to describe the consensus regulation performance. The problems are transformed into guaranteed performance stabilization problems by using a matrix...
This paper studies the average consensus problem for a discrete-time multi-agent system with first-order dynamics, we provide the sufficient and necessary stable condition that the step-size needs to satisfy for the multi-agent systems with an iterative method, and the cause of oscillation is investigated with use of matrix diagonal and eigenvalue analysis method. Some conclusions about the largest...
This paper investigates the leader-following consensus problem of the switched multi-agent systems with general second-order dynamics. In the switched systems, we consider two subsystems, CT (continuous-time) subsystems and DT (discrete-time) subsystems. A linear distributed control algorithm is proposed for leader-following consensus in the multi-agent systems with switched dynamics. Moreover, based...
This technical note is aimed at studying the joint impacts of the system dynamic structure and the communication topology on the synchronization of multi-linear positive systems. Through rigorous analysis, necessary and sufficient conditions are given to guarantee the coupled systems achieving positive synchronization under the distributed control protocol, and the gain matrix designed is related...
Cooperative containment problem is presented in this paper for discrete-time multi-agent systems with different dynamics subject to structural uncertainties. The topologies of the agents could be assumed that one leader contains a directed path to all the follower agents. The paper obtains some novel and challenging results on cooperative containment control problem of discrete-time multi-agent systems:...
In this note, under time varying undirected graph, we discuss fixed-time consensus of multi-agent systems and present one framework for constructing effective distributed protocols, which is continuous and distributed state feedbacks. Based on the theory of fixed-time stability, and we prove that if the sum of time intervals is larger than a given time, and the bounded of initial states is known,...
Frequency-domain criterion on containment control for general linear multi-agent systems with time delay is studied under the directed network topology. A distributed protocol with time-invariant delay is proposed. When time-delay is an unknown constant, frequency-domain criterion on containment control of general linear multi-agent systems with delay is obtained, and an upper bound of delay is given...
Maximally recoverable codes are codes designed for distributed storage which combine quick recovery from single node failure and optimal recovery from catastrophic failure. Gopalan et al [SODA 2017] studied the alphabet size needed for such codes in grid topologies and gave a combinatorial characterization for it.Consider a labeling of the edges of the complete bipartite graph K_{n,n} with labels...
In this paper, a surrounding control problem for second-order agent system is investigated. A set of followers composed by the second-order agent networks is applied to surround a team of static leaders into a convex hull spanned by these followers. The problem is considered under a decentralized estimation-and-control framework by using tools from algebraic graph theory and Lyapunov stable theory...
This paper investigates the formation control of the multi-agent with single-integrator kinematics in the plane, and presents a new method which could guarantee the agent to realize the arbitrary prescribed formation, furthermore, locations of the agents in the formation can be arbitrary arranged as what we expected. Our method is generalized as follows: Firstly, a consensus control protocol is designed,...
In this paper, the leader-follower consensus problem for a kind of nonlinear multi-agent systems with general directed communication topologies is studied. For this problem, the dynamics of all agents are identical and nonlinear under the strict form with time-varying exponential growth rate subject to Lipschitz condition constraints. With the aid of the observers of states, a distributed output-based...
This paper deals with the bipartite consensus of multiple agents with output saturation under the signed directed graph. First, we build the equal conditions of bipartite consensus and classical consensus. Then, as an application, we take existing conditions for classical consensus problems with output saturation to solve bipartite consensus problems with output saturation. Finally, one simulation...
This paper proposes a robust model predictive control approach to address the optimized adaptive tracking consensus problem for multi-vehicle systems with periodic sampling under the directed communication topology. Unlike the existing works using the global information to achieve the tracking consensus, the proposed optimized tracking cooperative control strategy considers that the control gain is...
This paper considers the antagonistic formation problem of second-order multi-agent systems with addictive noises and multiplicative noises over directed signed graph. Firstly, a distributed protocol is proposed, and a time-varying consensus gain is introduced to attenuate the effect of communication noises. Then, by using the tools of matrix theory and stochastic differential equation, the necessary...
The consensus error calculation of the multi-agent systems (MASs) with system noises and communication noises is considered in this paper. Each agent is modeled by a continuous-time linear time-invariant dynamics and the communication topology is described by an undirected graph. It is supposed that the agent can obtain its own state accurately and receive the state of the neighbor agent with noisy...
This paper constructs a novel consensus framework for continuous-time multi-agent systems by using motion planning approaches. In this framework, a novel notion, specifiedtime consensus, is raised. Specified-time consensus means that the consensus of multi-agent systems is achieving with a finite settling time, which can be accurately and arbitrarily pre-specified according to task requirements. In...
This paper proposes a newly distributed reduced order agreement protocols based on the observer to investigate the consensus problem of high-order multi-agent systems with various agents and non-uniform delay of various time and directed communication topology. First, on the basis of Riccati equation, Lyapunov method, as well as Algebraic-Graph theory, a novel algorithm with multistep, is provided...
In this paper, a novel cooperative guidance law is proposed to make multiple missiles hit simultaneously the same target at a pre-specified impact angle. Firstly, the normal acceleration which changes the velocity direction is designed such that all missiles will fly along the desired line of sight (LOS) after a given time which ensures the hit-to-kill interception; then the consensus variable is...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.