Author
Long Wang
Other affiliations: Chinese Academy of Sciences, Tsinghua University, Xidian University ...read more
Bio: Long Wang is an academic researcher from Peking University. The author has contributed to research in topics: Linear system & Population. The author has an hindex of 84, co-authored 835 publications receiving 30926 citations. Previous affiliations of Long Wang include Chinese Academy of Sciences & Tsinghua University.
Papers published on a yearly basis
Papers
More filters
TL;DR: It is proved that if the sum of time intervals, in which the interaction topology is connected, is sufficiently large, the proposed protocols will solve the finite-time consensus problems.
Abstract: In this note, we discuss finite-time state consensus problems for multi-agent systems and present one framework for constructing effective distributed protocols, which are continuous state feedbacks. By employing the theory of finite-time stability, we investigate both the bidirectional interaction case and the unidirectional interaction case, and prove that if the sum of time intervals, in which the interaction topology is connected, is sufficiently large, the proposed protocols will solve the finite-time consensus problems.
907 citations
Posted Content•
TL;DR: In this article, finite-time state consensus problems for continuous-time multi-agent systems are discussed, and two distributive protocols, which ensure that the states of agents reach an agreement in a finite time, are presented.
Abstract: In this paper, finite-time state consensus problems for continuous-time multi-agent systems are discussed, and two distributive protocols, which ensure that the states of agents reach an agreement in a finite time, are presented. By employing the method of finite-time Lyapunov functions, we derive conditions that guarantee the two protocols to solve the finite-time consensus problems respectively. Moreover, one of the two protocols solves the finite-time weighted-average consensus problem and can be successively applied to the systems with switching topology. Upper bounds of convergence times are also established. Simulations are presented to show the effectiveness of our results.
834 citations
TL;DR: This paper proposes a class of nonlinear consensus protocols, which ensures that the related states of all agents will reach an agreement in a finite time under suitable conditions, and applies these protocols to the formation control, including time-invariant formation, time-varying formation and trajectory tracking.
822 citations
TL;DR: In this paper, a distributed consensus algorithm for continuous-time multi-agent systems with discontinuous information transmission is proposed, where the consensus control strategy is implemented based on the state information of each agent's neighbors at some discrete times.
Abstract: The paper studies asynchronous consensus problems of continuous-time multi-agent systems with discontinuous information transmission. The proposed consensus control strategy is implemented based on the state information of each agent's neighbors at some discrete times. The asynchrony means that each agent's update times, at which the agent adjusts its dynamics, are independent of others'. Furthermore, it is assumed that the communication topology among agents is time-dependent and the information transmission is with bounded time-varying delays. If the union of the communication topology across any time interval with some given length contains a spanning tree, the consensus problem is shown to be solvable. The analysis tool developed in this paper is based on nonnegative matrix theory and graph theory. The main contribution of this paper is to provide a valid distributed consensus algorithm that overcomes the difficulties caused by unreliable communication channels, such as intermittent information transmission, switching communication topology, and time-varying communication delays, and therefore has its obvious practical applications. Simulation examples are provided to demonstrate the effectiveness of the theoretical results.
688 citations
01 Jan 2008
TL;DR: The main contribution of this paper is to provide a valid distributed consensus algorithm that overcomes the difficulties caused by unreliable communication channels, such as intermittent information transmission, switching communication topology, and time-varying communication delays, and therefore has its obvious practical applications.
Abstract: The paper studies asynchronous consensus problems of continuous-time multi-agent systems with discontinuous infor- mation transmission. The proposed consensus control strategy is implemented based on the state information of each agent's neighbors at some discrete times. The asynchrony means that each agent's update times, at which the agent adjusts its dynamics, are independent of others'. Furthermore, it is assumed that the communication topology among agents is time-dependent and the information transmission is with bounded time-varying delays. If the union of the communication topology across any time interval with some given length contains a spanning tree, the consensus problem is shown to be solvable. The analysis tool developed in this paper is based on nonnegative matrix theory and graph theory. The main contribution of this paper is to provide a valid distributed consensus algorithm that overcomes the difficulties caused by unreliable communication channels, such as intermit- tent information transmission, switching communication topology, and time-varying communication delays, and therefore has its obvious practical applications. Simulation examples are provided to demonstrate the effectiveness of the theoretical results.
607 citations
Cited by
More filters
Journal Article•
28,685 citations
28 Jul 2005
TL;DR: PfPMP1）与感染红细胞、树突状组胞以及胎盘的单个或多个受体作用，在黏附及免疫逃避中起关键的作�ly.
Abstract: 抗原变异可使得多种致病微生物易于逃避宿主免疫应答。表达在感染红细胞表面的恶性疟原虫红细胞表面蛋白1（PfPMP1）与感染红细胞、内皮细胞、树突状细胞以及胎盘的单个或多个受体作用，在黏附及免疫逃避中起关键的作用。每个单倍体基因组var基因家族编码约60种成员，通过启动转录不同的var基因变异体为抗原变异提供了分子基础。
18,940 citations
TL;DR: Convergence of Probability Measures as mentioned in this paper is a well-known convergence of probability measures. But it does not consider the relationship between probability measures and the probability distribution of probabilities.
Abstract: Convergence of Probability Measures. By P. Billingsley. Chichester, Sussex, Wiley, 1968. xii, 253 p. 9 1/4“. 117s.
5,689 citations
[...]
01 May 1997
TL;DR: Coaching & Communicating for Performance Coaching and communicating for Performance is a highly interactive program that will give supervisors and managers the opportunity to build skills that will enable them to share expectations and set objectives for employees, provide constructive feedback, more effectively engage in learning conversations, and coaching opportunities as mentioned in this paper.
Abstract: Building Leadership Effectiveness This program encourages leaders to develop practices that transform values into action, vision into realities, obstacles into innovations, and risks into rewards. Participants will be introduced to the five practices of exemplary leadership: modeling the way, inspiring a shared vision, challenging the process, enabling others to act, and encouraging the heart Coaching & Communicating for Performance Coaching & Communicating for Performance is a highly interactive program that will give supervisors and managers the opportunity to build skills that will enable them to share expectations and set objectives for employees, provide constructive feedback, more effectively engage in learning conversations, and coaching opportunities. Skillful Conflict Management for Leaders As a leader, it is important to understand conflict and be effective at conflict management because the way conflict is resolved becomes an integral component of our university’s culture. This series of conflict management sessions help leaders learn and put into practice effective strategies for managing conflict.
4,935 citations