All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

On finite-time and fixed-time consensus algorithms for dynamic networks switching among disconnected digraphs

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F20%3A00496006" target="_blank" >RIV/67985556:_____/20:00496006 - isvavai.cz</a>

  • Result on the web

    <a href="https://www.tandfonline.com/doi/full/10.1080/00207179.2018.1543896" target="_blank" >https://www.tandfonline.com/doi/full/10.1080/00207179.2018.1543896</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1080/00207179.2018.1543896" target="_blank" >10.1080/00207179.2018.1543896</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    On finite-time and fixed-time consensus algorithms for dynamic networks switching among disconnected digraphs

  • Original language description

    The aim of this paper is to analyze a class of consensus algorithms with finite-time or fixed-time convergence for dynamic networks formed by agents with first-order dynamics. In particular, in the analyzed class a single evaluation of a nonlinear function of the consensus error is performed per each node. The classical assumption of switching among connected graphs is dropped here, allowing to represent failures and intermittent communications between agents. Thus, conditions to guarantee finite and fixed-time convergence, even while switching among disconnected graphs, are provided. Moreover, the algorithms of the considered class are shown to be computationally simpler than previously proposed finite-time consensus algorithms for dynamic networks, which is an important feature in scenarios with computationally limited nodes and energy efficiency requirements such as in sensor networks. The performance of the considered consensus algorithms is illustrated through simulations, comparing it to existing approaches for dynamic networks with finite-time and fixed-time convergence. It is shown that the settling time of the considered algorithms grows slower when the number of nodes increases than with other consensus algorithms for dynamic networks.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    20201 - Electrical and electronic engineering

Result continuities

  • Project

    <a href="/en/project/GA17-04682S" target="_blank" >GA17-04682S: Control of walking robots using collocated virtual holonomic constraints</a><br>

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2020

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    International Journal of Control

  • ISSN

    0020-7179

  • e-ISSN

  • Volume of the periodical

    93

  • Issue of the periodical within the volume

    9

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    17

  • Pages from-to

    2120-2134

  • UT code for WoS article

    000558913100009

  • EID of the result in the Scopus database

    2-s2.0-85057300373