SYMASYNov 28, 2018

Finite-time Heterogeneous Cyclic Pursuit with Application to Target Interception

arXiv:1811.108271 citationsh-index: 24
Originality Incremental advance
AI Analysis

For multi-agent systems requiring finite-time consensus, this work provides a theoretical framework and practical algorithm for heterogeneous cyclic pursuit, with application to missile interception.

This paper proposes a finite-time heterogeneous cyclic pursuit scheme for consensus among integrator agents, proving that consensus occurs in finite time with positive non-identical gains. The method is applied to cooperative target interception, achieving collision-free interception in simulations.

This paper presents a finite-time heterogeneous cyclic pursuit scheme that ensures consensus among agents modelled as integrators. It is shown that for the proposed sliding mode control, even when the gains corresponding to each agent are non-identical, consensus results within a finite-time provided all the gains are positive. An algorithm is presented to compute the consensus value and consensus time for a given set of gains and initial states of the agents. The set of values where consensus can occur, by varying the gains, has been derived and a second algorithm aids in determining the gains that enable consensus at any point in the aforementioned set, within a given finite-time. As an application, the finite-time consensus in line-of-sight (LOS) rates, over a cycle digraph, for a group of interceptors is shown to be effective in ensuring co-operative collision-free interception of a target, for both kinematic and realistic models of the interceptors. Simulations vindicate the theoretical results.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes