Sharif Digital Repository

This paper considers flocking to the virtual leader in network of agents with double-integrator. A locally linear algorithm is employed which guarantees exponential flocking to the virtual leader. A lower bound for flocking rate is calculated which is independent of the initial conditions. Simulations are provided to validate the result and it is shown that the calculated rate is not over bound the actual convergence rate. The effect of coefficients of algorithm is investigated and it is shown that the similar results can be inferred from the calculated formula for the convergence rate. Copyright  

We use the Fokker-Planck equation and its moment equations to study the collective behavior of interacting particles in unsteady one-dimensional flows. Particles interact according to a longrange attractive and a short-range repulsive potential field known as Morse potential. We assume Stokesian drag force between particles and their carrier fluid and find analytic single-peaked traveling solutions for the spatial density of particles in the catastrophic phase. In steady flow conditions the streaming velocity of particles is identical to their carrier fluid, but we show that particle streaming is asynchronous with an unsteady carrier fluid. Using linear perturbation analysis, the stability...