A Cyclic Pursuit Framework for Networked Mobile Agents Based on Vector Field Approach

This paper proposes a pursuit formation control scheme for a network of double-integrator mobile agents based on a vector field approach. In a leaderless architecture, each agent pursues another one via a cyclic topology to achieve a regular polygon formation. On the other hand, the agents are exposed to a rotational vector field such that they rotate around the vector field centroid, while they keep the regular polygon formation. The main problem of existing approaches in the literature for cyclic pursuit of double-integrator multiagent systems is that under those approaches, the swarm angular velocity and centroid are not controllable based on missions and agents capabilities. However, by employing the proposed vector field approach in this paper, while keeping a regular polygon formation, the swarm angular velocity and centroid can be determined arbitrary. The obtained results can be extended to achieve elliptical formations with cyclic pursuit as well. Simulation results for a team of eight mobile agents verify the accuracy of the proposed control scheme

Construction of Barrier in a Fishing Game With Point Capture

This paper addresses a particular pursuit-evasion game, called as “fishing game” where a faster evader attempts to pass the gap between two pursuers. We are concerned with the conditions under which the evader or pursuers can win the game. This is a game of kind in which an essential aspect, barrier, separates the state space into disjoint parts associated with each player's winning region. We present a method of explicit policy to construct the barrier. This method divides the fishing game into two subgames related to the included angle and the relative distances between the evader and the pursuers, respectively, and then analyzes the possibility of capture or escape for each subgame to ascertain the analytical forms of the barrier. Furthermore, we fuse the games of kind and degree by solving the optimal control strategies in the minimum time for each player when the initial state lies in their winning regions. Along with the optimal strategies, the trajectories of the players are delineated and the upper bounds of their winning times are also derived

Station Keeping through Beacon-referenced Cyclic Pursuit

This paper investigates a modification of cyclic constant bearing (CB) pursuit in a multi-agent system in which each agent pays attention to a neighbor and a beacon. The problem admits shape equilibria with collective circling about the beacon, with the circling radius and angular separation of agents determined by choice of parameters in the feedback law. Stability of circling shape equilibria is shown for a 2-agent system, and the results are demonstrated on a collective of mobile robots tracked by a motion capture system

Observer-based consensus control strategy for multi-agent system with communication time delay

This paper proposes an observer-based consensus control strategy for multi-agent system (MAS) with communication time delay. The condition of stability for MIMO agents is derived by Lyapunov theorem. It gives systematic design procedure under assumed unidirectional network. Furthermore, new consensus control law using observers is proposed for the networked MAS with communication delays. Experimental results show effectiveness of our proposed output consensus approaches. ©2008 IEEE

Virtual structure based target-enclosing strategies for nonholonomic agents

In this paper, we discuss a target-enclosing problem for a group of multiple nonholonomic agents in a plane. The proposed strategies guarantee that multiple agents\u27 coordination finally results in a circular formation enclosing the targe-to-bject which moves in the plane. Firstly, virtual agents for the feedback linearization of the real nonholonomic agents are introduced. Secondly, we propose the target-enclosing control laws based on the consensus algorithm to the virtual agents. Algebraic graph theory and consensus algorithm are employed to prove convergence and stability of the enclosing problem. Finally, experiments are provided to demonstrate the effectiveness of the proposed control laws. ©2008 IEEE

Guaranteed Road Network Search with Small Unmanned Aircraft

The use of teams of small unmanned aircraft in real-world rapid-response missions is fast becoming a reality. One such application is search and detection of an evader in urban areas. This paper draws on results in graph-based pursuit-evasion, developing mappings from these abstractions to primitive motions that may be performed by aircraft, to produce search strategies providing guaranteed capture of road-bound targets. The first such strategy is applicable to evaders of arbitrary speed and agility, offering a conservative solution that is insensitive to motion constraints pursuers may possess. This is built upon to generate two strategies for capture of targets having a known speed bound that require searcher teams of much smaller size. The efficacy of these algorithms is demonstrated by evaluation in extensive simulation using realistic vehicle models across a spectrum of environment classes

Formation control on Jordan curves based on noisy proximity measurements

The paradigmatic formation control problem of steering a multi-agent system towards a balanced circular formation has been the subject of extensive studies in the control engineering community. Indeed, this is due to the fact that it shares several features with relevant applications such as distributed environmental monitoring or fence-patrolling. However, these applications may also present some relevant differences from the ideal setting such as the curve on which the formation must be achieved not being a circle, or the measurements being neither ideal nor as a continuous information flow. In this work, we attempt to fill this gap between theory and applications by considering the problem of steering a multi-agent system towards a balanced formation on a generic closed curve and under very restrictive assumptions on the information flow amongst the agents. We tackle this problem through an estimation and control strategy that borrows tools from interval analysis to guarantee the robustness that is required in the considered scenario