On the graphical stability of hybrid solutions with non-matching jump times

From MaRDI portal
Publication:2288643

DOI10.1016/J.AUTOMATICA.2019.108662zbMATH Open1430.93102arXiv1906.02332OpenAlexW2982482054WikidataQ126856644 ScholiaQ126856644MaRDI QIDQ2288643FDOQ2288643


Authors: J. J. Benjamin Biemond, W. P. Maurice H. Heemels, Romain Postoyan, N. van de Wouw Edit this on Wikidata


Publication date: 20 January 2020

Published in: Automatica (Search for Journal in Brave)

Abstract: We investigate stability of a solution of a hybrid system in the sense that the graphs of solutions from nearby initial conditions remain close and tend towards the graph of the given solution. In this manner, a small continuous-time mismatch is allowed between the jump times of neighbouring solutions and the `peaking phenomenon' is avoided. We provide conditions such that this stability notion is implied by stability with respect to a specifically designed distance-like function. Hence, stability of solutions in the graphical sense can be analysed with existing Lyapunov techniques.


Full work available at URL: https://arxiv.org/abs/1906.02332




Recommendations




Cites Work


Cited In (2)





This page was built for publication: On the graphical stability of hybrid solutions with non-matching jump times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2288643)