相关论文: Probabilistic Gathering Of Agents With Simple Sens…

A group of mobile agents, identical, anonymous, and oblivious (memoryless), having the capability to sense only the relative direction (bearing) to neighborhing agents within a finite visibility range, are shown to gather to a meeting point…

This report surveys results on distributed systems comprising mobile agents that are identical and anonymous, oblivious and interact solely by adjusting their motion according to the relative location of their neighbours. The agents are…

Several mobile agents, modelled as deterministic automata, navigate in an infinite line in synchronous rounds. All agents start in the same round. In each round, an agent can move to one of the two neighboring nodes, or stay idle. Agents…

A team of anonymous mobile agents represented by points freely moving in the plane have to gather at a single point and stop. Agents start at different points of the plane and at possibly different times chosen by the adversary. They are…

In this paper we are interested in the task of searching and tracking multiple moving targets in a bounded surveillance area with a group of autonomous mobile agents. More specifically, we assume that targets can appear and disappear at…

In this paper, we consider the partial gathering problem of mobile agents in asynchronous unidirectional rings equipped with whiteboards on nodes. The partial gathering problem is a new generalization of the total gathering problem. The…

A team of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node and declare that they have all met. Agents have different labels and move in synchronous rounds along…

A standard belief on emerging collective behavior is that it emerges from simple individual rules. Most of the mathematical research on such collective behavior starts from imperative individual rules, like always go to the center. But how…

A team consisting of an unknown number of mobile agents, starting from different nodes of an unknown network, have to meet at the same node and terminate. This problem is known as {\em gathering}. We study deterministic gathering algorithms…

Populations of agents often exhibit surprising collective behavior emerging from simple local interactions. The common belief is that the agents must posses a certain level of cognitive abilities for such an emerging collective behavior to…

Populations of mobile and communicating agents describe a vast array of technological and natural systems, ranging from sensor networks to animal groups. Here, we investigate how a group-level agreement may emerge in the continuously…

A team consisting of an unknown number of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node. Agents are anonymous (identical), execute the same deterministic…

This paper presents a method for future motion prediction of multi-agent systems by including group formation information and future intent. Formation of groups depends on a physics-based clustering method that follows the agglomerative…

During epidemics, the population is asked to Socially Distance, with pairs of individuals keeping two meters apart. We model this as a new optimization problem by considering a team of agents placed on the nodes of a network. Their common…

A team of mobile agents, starting from distinct nodes of a network, have to meet at the same node and declare that they all met. Agents execute the same algorithm, which they start when activated by an adversary or by an agent entering…

Over the past few decades, the research community has been interested in the study of multi-agent systems and their emerging collective dynamics. These systems are all around us in nature, like bacterial colonies, fish schools, bird flocks,…

This report studies the emergent behavior of systems of agents performing cyclic pursuit controlled by an external broadcast signal detected by a random set of the agents. Two types of cyclic pursuit are analyzed: 1)linear cyclic pursuit,…

Intelligent agents collect and process information from their dynamically evolving neighbourhood to efficiently navigate through it. However, agent-level intelligence does not guarantee that at the level of a collective; a common example is…

This paper considers the problem of steering a vast group of agents of which the dynamics are governed by a discrete-time first-order linear system. The group of agents are characterized as a probability density function and an occupation…

Modeling crowds has many important applications in games and computer animation. Inspired by the emergent following effect in real-life crowd scenarios, in this work, we develop a method for implicitly grouping moving agents. We achieve…