Related papers: Stability of Linear Flocks on a Ring Road
We study the linear stability of flock and mill ring solutions of two individual based models for biological swarming. The individuals interact via a nonlocal interaction potential that is repulsive in the short range and attractive in the…
The movement of a flock with a single leader (and a directed path from it to every agent) can be stabilized. Nonetheless for large flocks perturbations in the movement of the leader may grow to a considerable size as they propagate…
In this paper we consider interacting particle systems which are frequently used to model collective behavior in animal swarms and other applications. We study the stability of orientationally aligned formations called flock solutions, one…
We consider large but finite systems of identical agents on the line with up to next nearest neighbor asymmetric coupling. Each agent is modelled by a linear second order differential equation, linearly coupled to up to four of its…
In this paper, we consider a multi-agent system consisting of mobile agents with second-order dynamics. The communication network is determined by the so-called topological interaction rule: agents interact with a fixed number of their…
This paper analyzes the global dynamics of 1-dimensional agent arrays with nearest neighbor linear couplings. The equations of motion are second order linear ODEs with constant coeffcients. The novel part of this research is that the…
Group behavior has received much attention as a test case of self-organization. There has been much written in recent years to investigate interactions within groups of agents. These agents can be animals moving in an interactive way, such…
The study of the movement of flocks, whether biological or technological is motivated by the desire to understand the capability of coherent motion of a large number of agents that only receive very limited information. In a biological…
In this paper we establish a necessary and sufficient stability condition for a stochastic ring network. Such networks naturally appear in a variety of applications within communication, computer, and road traffic systems. They typically…
We present a general framework for modeling a wide selection of flocking scenarios under free boundary conditions. Several variants have been considered - including examples for the widely observed behavior of hierarchically interacting…
In this paper, we consider one-to-one matchings between two disjoint groups of agents. Each agent has a preference over a subset of the agents in the other group, and these preferences may contain ties. Strong stability is one of the…
We study the problem of patrolling the nodes of a network collaboratively by a team of mobile agents, such that each node of the network is visited by at least one agent once in every $I(n)$ time units, with the objective of minimizing the…
Consider a string of N+1 damped oscillators moving on the line of which the motion of the first (called the "leader") is independent of the others. Each of the followers `observes' the relative velocity and position of only its nearest…
Flocking is a fascinating phenomenon observed across a wide range of living organisms. We investigate, based on a simple self-propelled particle model, how the emergence of ordered motion in a collectively moving group is influenced by the…
We study stable matching problems with locality of information and control. In our model, each agent is a node in a fixed network and strives to be matched to another agent. An agent has a complete preference list over all other agents it…
We consider the two-sided stable matching setting in which there may be uncertainty about the agents' preferences due to limited information or communication. We consider three models of uncertainty: (1) lottery model --- in which for each…
This paper investigates the mathematical modeling and the stability of multi-lane traffic in the microscopic scale, studying a model based on two interaction terms. To do this we propose simple lane changing conditions and we study the…
Consider a cyclically ordered collection of $r$ equinumerous agent sets with strict preferences of every agent over the agents from the next agent set. A weakly stable cyclic matching is a partition of the set of agents into disjoint union…
We consider the collective behaviour of active particles that locally align with their neighbours. Agent-based simulation models have previously shown that in one dimension, these particles can form into a flock that maintains its stability…
This paper deals with the problem of string stability of interconnected systems with double-integrator open loop dynamics (e.g.~acceleration-controlled vehicles). We analyze an asymmetric bidirectional linear controller, where each vehicle…