efficient numerical approach for the stability analysis of a class of LTI systems with arbitrary number of delays

Abstract: A practical and numerically efficient algorithm is presented for determining the stability robustness map of a general class of higher order linear time invariant (LTI) systems in the parametric space of arbitrary number of independent delays. The stability of this class of dynamics is of...

Full description

Bibliographic Details
Published:
Online Access:http://hdl.handle.net/2047/d10009413
id ndltd-NEU--neu-377807
record_format oai_dc
spelling ndltd-NEU--neu-3778072016-04-25T16:16:11Zefficient numerical approach for the stability analysis of a class of LTI systems with arbitrary number of delaysAbstract: A practical and numerically efficient algorithm is presented for determining the stability robustness map of a general class of higher order linear time invariant (LTI) systems in the parametric space of arbitrary number of independent delays. The stability of this class of dynamics is of particular interest in low-gain design and multi-agent control problems. The backbone of the new algorithm is inspired by a scaled frequency sweeping technique which enables the exhaustive determination of stability switching hypersurfaces in the parametric space of delays, without requiring nested loops. Two case studies are presented in order to demonstrate the strength of the new algorithm.http://hdl.handle.net/2047/d10009413
collection NDLTD
sources NDLTD
description Abstract: A practical and numerically efficient algorithm is presented for determining the stability robustness map of a general class of higher order linear time invariant (LTI) systems in the parametric space of arbitrary number of independent delays. The stability of this class of dynamics is of particular interest in low-gain design and multi-agent control problems. The backbone of the new algorithm is inspired by a scaled frequency sweeping technique which enables the exhaustive determination of stability switching hypersurfaces in the parametric space of delays, without requiring nested loops. Two case studies are presented in order to demonstrate the strength of the new algorithm.
title efficient numerical approach for the stability analysis of a class of LTI systems with arbitrary number of delays
spellingShingle efficient numerical approach for the stability analysis of a class of LTI systems with arbitrary number of delays
title_short efficient numerical approach for the stability analysis of a class of LTI systems with arbitrary number of delays
title_full efficient numerical approach for the stability analysis of a class of LTI systems with arbitrary number of delays
title_fullStr efficient numerical approach for the stability analysis of a class of LTI systems with arbitrary number of delays
title_full_unstemmed efficient numerical approach for the stability analysis of a class of LTI systems with arbitrary number of delays
title_sort efficient numerical approach for the stability analysis of a class of lti systems with arbitrary number of delays
publishDate
url http://hdl.handle.net/2047/d10009413
_version_ 1718236123617034240