Clustering algorithm for generalized recurrences using complete Lyapunov functions

Carlos Argáez, Peter Giesl, Sigurdur Hafstein

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Many advances and algorithms have been proposed to obtain complete Lyapunov functions for dynamical systems and to properly describe the chain-recurrent set, e.g. periodic orbits. Recently, a heuristic algorithm was proposed to classify and reduce the over-estimation of different periodic orbits in the chain-recurrent set, provided they are circular. This was done to investigate the effect on further iterations of the algorithm to compute approximations to a complete Lyapunov function. In this paper, we propose an algorithm that classifies the different connected components of the chain-recurrent set for general systems, not restricted to (circular) periodic orbits. The algorithm is based on identifying clustering of points and is independent of the particular algorithm to construct the complete Lyapunov functions.

Original languageEnglish
Title of host publicationICINCO 2019 - Proceedings of the 16th International Conference on Informatics in Control, Automation and Robotics
EditorsOleg Gusikhin, Kurosh Madani, Janan Zaytoon
PublisherSciTePress
Pages138-146
Number of pages9
ISBN (Electronic)9789897583803
DOIs
Publication statusPublished - 2019
Event16th International Conference on Informatics in Control, Automation and Robotics, ICINCO 2019 - Prague, Czech Republic
Duration: 29 Jul 201931 Jul 2019

Publication series

NameICINCO 2019 - Proceedings of the 16th International Conference on Informatics in Control, Automation and Robotics
Volume1

Conference

Conference16th International Conference on Informatics in Control, Automation and Robotics, ICINCO 2019
Country/TerritoryCzech Republic
CityPrague
Period29/07/1931/07/19

Bibliographical note

Publisher Copyright: Copyright © 2019 by SCITEPRESS - Science and Technology Publications, Lda. All rights reserved.

Other keywords

  • Chain-recurrent set
  • Clustering algorithm
  • Complete Lyapunov functions
  • Dynamical systems
  • Mathematics

Fingerprint

Dive into the research topics of 'Clustering algorithm for generalized recurrences using complete Lyapunov functions'. Together they form a unique fingerprint.

Cite this