Semantic Scholar uses AI to extract papers important to this topic.
In this paper, we present a theoretical framework for design and analysis of distributed flocking algorithms. Two cases of… Expand We study a simple but compelling model of network of agents interacting via time-dependent communication links. The model finds… Expand In this paper, we discuss consensus problems for networks of dynamic agents with fixed and switching topologies. We analyze three… Expand In a recent Physical Review Letters article, Vicsek et al. propose a simple but compelling discrete-time model of n autonomous… Expand Finite-time stability is defined for equilibria of continuous but non-Lipschitzian autonomous systems. Continuity, Lipschitz… Expand The Nelder--Mead simplex algorithm, first published in 1965, is an enormously popular direct search method for multidimensional… Expand This paper analyses the stability and fairness of two classes of rate control algorithm for communication networks. The… Expand We introduce some analysis tools for switched and hybrid systems. We first present work on stability analysis. We introduce… Expand Abstract Basin boundaries for dynamical systems can be either smooth or fractal. This paper investigates fractal basin boundaries… Expand We present the first algorithms that allow the estimation of non-negative Lyapunov exponents from an experimental time series… Expand