388
Views
6
CrossRef citations to date
0
Altmetric
Research Article

Improved frequency sweeping technique and stability analysis of the second-order consensus protocol with distributed delays

ORCID Icon, ORCID Icon, ORCID Icon & ORCID Icon
Pages 461-474 | Received 15 Feb 2021, Accepted 28 Oct 2021, Published online: 02 Dec 2021
 

Abstract

The consensus problem of a general class of second-order multi-agent system with distributed delays is investigated from a new perspective. We propose a consensus protocol with distributed delays to enhance the delay robustness of the system. First, we establish a spectral equivalence of such a system and the one with multiple discrete delays from the stability viewpoint. We then employ a factorization procedure to reduce the computational complexity. Next, we uniquely use the Dixon resultant theory to determine the exact upper bound of the imaginary spectra, leading to the kernel and offspring hypersurfaces (KOH) in the delay domain. Furthermore, the associated standing roots of the system are analyzed to determine the precise stationary root boundaries, which constitute the potential stability changing curves together with the KOH. Finally, we resort to the Cluster Treatment of Characteristic Roots (CTCR) paradigm to examine the exact and complete stability of the system.

Disclosure statement

No potential conflict of interest was reported by the author(s).

Additional information

Funding

The presented research is supported in part by the Basic Research Plan of Shenzhen [grant number JCYJ20200109113429208].

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.