English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

In this paper we investigate the finite-time and fixed-time consensus problems of multiagent networks with pinning control and noise perturbation. In order to reach the finite-time and fixed-time consensus, several pinning protocols are proposed. Compared with the consensus protocols without pinning control, the proposed finite-time and fixed-time protocols need to control only a small fraction of agents, which is practical and has advantages from the physical viewpoint of energy consumption. More specifically, the deterministic and stochastic protocols include the graph $(p+1)$-Laplacian, a nonlinear generalization of the standard graph Laplacian. We show that, unlike the protocols with the standard (linear) graph Laplacian, those with the graph $(p+1)$-Laplacian solve the finite-time as well as the fixed-time consensus problems. By using the finite-time and fixed-time stability theory and the algebra graph theory, sufficient conditions are established to ensure the finite-time and fixed-time consensus. ...

Finite-Time and Fixed-Time Consensus of Multiagent Networks with Pinning Control and Noise Perturbation