zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Distributed leader-follower flocking control for multi-agent dynamical systems with time-varying velocities. (English) Zbl 1207.37054
In this paper, a distributed leader-follower flocking algorithm for multi-agent dynamical systems has been developed and analyzed, which considers the case in which the group has one virtual leader and the asymptotic velocity is time-varying. The proposed distributed leader-follower algorithm considers the case in which the group has one virtual leader with time-varying velocity. For each agent i, this algorithm consists of four terms: the first term is the self nonlinear dynamics which determines the final time-varying velocity, the second term is determined by the gradient of the collective potential between agent i and all of its neighbors, the third term is the velocity consensus term, and the fourth term is the navigation feedback from the leader. To avoid an impractical assumption that the informed agents sense all the states of the leader, the new designed distributed algorithm is developed by making use of observer-based pinning navigation feedback. In this case, each informed agent only has partial information about the leader, yet the velocity of the whole group can still converge to that of the leader and the centroid of those informed agents, having the leader’s position information, follows the trajectory of the leader asymptotically. It has been proved that although each informed agent can only obtain partial information about the leader, the velocity of the whole group converges to that of the leader and the centroid of those informed agents, having the leader’s position information, follows the trajectory of the leader asymptotically. It has been the goal of this paper to analyze different flocking algorithms by using tools from non-smooth analysis in combination with ideas from the study of synchronization in complex systems. The leader-follower algorithm considered in this paper fall into the category of free-flocking where no obstacles are considered. Finally, simulation results are presented to demonstrate the validity and effectiveness of the theoretical analysis. Surprisingly, it is found that the local minimum of the potential function may not form a commonly believed α-lattice.
MSC:
37N35Dynamical systems in control
References:
[1]Cao, M.; Morse, A. S.; Anderson, B. D. O.: Reaching a consensus in a dynamically changing environment: a graphical approach, SIAM J. Control optim. 47, No. 2, 575-600 (2008) · Zbl 1157.93514 · doi:10.1137/060657005
[2]Cao, M.; Morse, A. S.; Anderson, B. D. O.: Reaching a consensus in a dynamically changing environment: convergence rates, measurement delays and asynchronous events, SIAM J. Control optim. 47, No. 2, 601-623 (2008) · Zbl 1157.93434 · doi:10.1137/060657029
[3]Cucker, F.; Smale, S.: Emergent behavior in flocks, IEEE trans. Automat. control 52, No. 5, 852-862 (2007)
[4]Jadbabaie, A.; Lin, J.; Morse, A. S.: Coordination of groups of mobile autonomous agents using nearest neighbor rules, IEEE trans. Automat. control 48, No. 6, 985-1001 (2003)
[5]Moreau, L.: Stability of multiagent systems with time-dependent communication links, IEEE trans. Automat. control 50, No. 2, 169-182 (2005)
[6]Ren, W.; Beard, R. W.: Consensus seeking in multiagent systems under dynamically changing interaction topologies, IEEE trans. Automat. control 50, No. 5, 655-664 (2005)
[7]Ren, W.; Beard, R. W.: Distributed consensus in multi-vehicle cooperative control, (2008)
[8]Saber, R. O.; Murray, R. M.: Consensus problems in networks of agents with switching topology and time-delays, IEEE trans. Automat. control 49, No. 9, 1520-1533 (2004)
[9]Yu, W.; Chen, G.; Cao, M.; Kurths, J.: Second-order consensus for multi-agent systems with directed topologies and nonlinear dynamics, IEEE trans. Syst. man cybern. B 40, No. 3, 881-891 (2010)
[10]Yu, W.; Chen, G.; Wang, Z.; Yang, W.: Distributed consensus filtering in sensor networks, IEEE trans. Syst. man cybern. B 39, No. 6, 1568-1577 (2009)
[11]Yu, W.; Chen, G.; Cao, M.: Some necessary and sufficient conditions for second-order consensus in multi-agent dynamical systems, Automatica 46, No. 6, 1089-1095 (2010) · Zbl 1192.93019 · doi:10.1016/j.automatica.2010.03.006
[12]Y. Cao, W. Ren, Distributed coordinated tracking with reduced interaction via a variable structure approach, IEEE Trans. Automat. Control (in press).
[13]Chen, T.; Liu, X.; Lu, W.: Pinning complex networks by a single controller, IEEE trans. Circuits syst. I 54, No. 6, 1317-1326 (2007)
[14]Yu, W.; Cao, J.; Chen, G.; Lü, J.; Han, J.; Wei, W.: Local synchronization of a complex network model, IEEE trans. Syst. man cybern. B 39, No. 1, 230-241 (2009)
[15]Yu, W.; Cao, J.; Lü, J.: Global synchronization of linearly hybrid coupled networks with time-varying delay, SIAM J. Appl. dyn. Syst. 7, No. 1, 108-133 (2008) · Zbl 1161.94011 · doi:10.1137/070679090
[16]Gazi, V.; Passino, K. M.: Stability analysis of swarms, IEEE trans. Automat. control 48, 692-697 (2003)
[17]Gazi, V.; Passino, K. M.: Stability analysis of social foraging swarms, IEEE trans. Syst. man cybern. B 34, No. 1, 539-557 (2004)
[18]Gu, D.; Wang, Z.: Leader–follower flocking: algorithms and experiments, IEEE trans. Control syst. Technol. 17, No. 5, 1211-1219 (2009)
[19]Liu, Y.; Passino, K. M.: Stable social foraging swarms in a noisy environment, IEEE trans. Automat. control 49, No. 1, 30-44 (2004)
[20]Olfati-Saber, R.: Flocking for multi-agent dynamic systems: algorithms and theory, IEEE trans. Automat. control 51, 401-420 (2006)
[21]Su, H.; Wang, X.; Lin, Z.: Flocking of multi-agents with a virtual leader, IEEE trans. Automat. control 54, No. 2, 293-307 (2009)
[22]Su, H.; Wang, X.; Yang, W.: Flocking in multi-agent systems with multiple virtual leaders, Asian J. Control 10, No. 2, 238-245 (2008)
[23]Su, H.; Wang, X.; Chen, G.: A connectivity-preserving flocking algorithm for multi-agent systems based only on position measurements, Internat. J. Control 82, No. 7, 1334-1343 (2009) · Zbl 1168.93311 · doi:10.1080/00207170802549578
[24]H.G. Tanner, A. Jadbabaie, G.J. Pappas, Stable flocking of mobile agents, part I: fixed topology Proc. 42nd IEEE Conf. Decision and Control, Dec. 2003. pp. 2010–2015.
[25]H.G. Tanner, A. Jadbabaie, G.J. Pappas, Stable flocking of mobile agents, part II: dynamic topology Proc. 42nd IEEE Conf. Decision and Control, Dec. 2003. pp. 2016–2021.
[26]Tanner, H. G.; Jadbabaie, A.; ; Pappas, G. J.: Flocking in fixed and switching networks, IEEE trans. Automat. control 52, No. 5, 863-868 (2007)
[27]Fiedler, M.: Algebraic connectivity of graphs, Czech math. J. 23, 298-305 (1973) · Zbl 0265.05119
[28]Godsil, C.; Royle, G.: Algebraic graph theory, (2001)
[29]Vicsek, T.; Cziok, A.; Jacob, E. B.; Cohen, I.; Shochet, O.: Novel type of phase transition in a system of self-driven particles, Phys. rev. Lett. 75, No. 6, 1226-1229 (1995)
[30]Reynolds, C. W.: Flocks, herds, and schools: a distributed behavior model, Comput. graph. 21, No. 4, 25-34 (1987)
[31]Filippov, A. F.: Differential equations with discontinuous right-hand side, Mathematics and its applications (1988)
[32]Clarke, F. H.: Optimization and nonsmooth analysis, (1983) · Zbl 0582.49001
[33]Paden, B.; Sastry, S.: A calculus for computing Filippov’s differential inclusion with application to the variable structure control of robot manipulators, IEEE trans. Circuits syst. 34, 73-82 (1987) · Zbl 0632.34005 · doi:10.1109/TCS.1987.1086038
[34]Wu, C.; Chua, L. O.: Synchronization in an array of linearly coupled dynamical systems, IEEE trans. Circuits syst. I 42, No. 8, 430-447 (1995) · Zbl 0867.93042 · doi:10.1109/81.404047
[35]Horn, R. A.; Johnson, C. R.: Topics in matrix analysis, (1991)
[36]Yu, W.; Chen, G.; Lü, J.: On pinning synchronization of complex dynamical networks, Automatica 45, No. 2, 429-435 (2009) · Zbl 1158.93308 · doi:10.1016/j.automatica.2008.07.016
[37]Aubin, J. P.; Frankowska, H.: Set valued analysis, (1990)
[38]Lu, W.; Chen, T.: Dynamical behaviors of Cohen–Grossberg neural networks with discontinuous activation functions, Neural netw. 18, 231-242 (2005) · Zbl 1078.68127 · doi:10.1016/j.neunet.2004.09.004
[39]Cortés, J.: Discontinuous dynamical systems, IEEE control syst. Mag. 28, No. 3, 36-73 (2008)
[40]Shevitz, D.; Paden, B.: Lyapunov stability theory of nonsmooth systems, IEEE trans. Automat. control 39, No. 9, 1910-1914 (1994) · Zbl 0814.93049 · doi:10.1109/9.317122
[41]Aubin, J. P.; Cellina, A.: Differential inclusions, (1994)
[42]Nathanson, I. P.: Theory of functions of a real variable, (1961)