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/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper we propose a convex programming based method for computingrobust regions of attraction for state-constrained perturbed discrete-timepolynomial systems. The robust region of attraction of interest is a set ofstates such that every possible trajectory initialized in it will approach anequilibrium state while never violating the specified state constraint,regardless of the actual perturbation. Based on a Bellman equation whichcharacterizes the interior of the maximal robust region of attraction as thestrict one sub-level set of its unique bounded and continuous solution, weconstruct a semi-definite program for computing robust regions of attraction.Under appropriate assumptions, the existence of solutions to the constructedsemi-definite program is guaranteed and there exists a sequence of solutionssuch that their strict one sub-level sets inner-approximate and converge to theinterior of the maximal robust region of attraction in measure. Finally, wedemonstrate the method by two examples.

Robust Regions of Attraction Generation for State-Constrained Perturbed Discrete-Time Polynomial Systems