Following our previous result on generic strong accessibility (GSA) for nonlinear systems, where we showed that GSA can be checked through a rank test on a 'nonlinear controllability matrix', we show here that the same test can be made further more efficient through a preliminary polynomial system immersion, which is in fact always quadratic and for which we give here a geometric interpretation, that allows to take advantage of polynomial algebra algorithms.
Testing Generic Strong Accessibility of Nonlinear Control Systems via Polynomial (Quadratic) Immersion
Francesco Carravetta;
2022
Abstract
Following our previous result on generic strong accessibility (GSA) for nonlinear systems, where we showed that GSA can be checked through a rank test on a 'nonlinear controllability matrix', we show here that the same test can be made further more efficient through a preliminary polynomial system immersion, which is in fact always quadratic and for which we give here a geometric interpretation, that allows to take advantage of polynomial algebra algorithms.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
