2023 |
Aloui, Messaoud; Hamidi, Faical; Jerbi, Houssem; Aoun, Mohamed Estimating and enlarging the domain of attraction for polynomial systems using a deep learning tool Conférence 2023. Résumé | Liens | BibTeX | Étiquettes: Deep learning, Domain of attraction, Learning systems, Learning tool, Linear matrix inequalities, Linear polynomials, Lyapunov functions, Lyapunov’s functions, Neural networks, Non linear, Particle swarm, Particle swarm optimization, Particle swarm optimization (PSO), Polynomial systems, Polynomials, Swarm intelligence, Swarm optimization @conference{Aloui2023b, This Paper deals with the topic of non linear polynomial systems. It explains a way to estimate and enlarge the region of attraction of nonlinear polynomial systems. It provides a deep learning method for estimating the domain of attraction and uses the Particle Swarm Optimization Algorithm to enlarge this domain. Based on an analytic method found in literature, a dataset is generated, used then to train an artificial neural network, which will be an objective function of an optimization algorithm. This method dives an imitation to a previous complicated method, with less complexity and les elapsed time. The benchmark examples show the efficiency of the method and compare results with those obtained with the one using linear matrix inequalities. © 2023 IEEE. |
Aloui, Messaoud; Hamidi, Faical; Jerbi, Houssem; Aoun, Mohamed Estimating and enlarging the domain of attraction for polynomial systems using a deep learning tool Conférence 2023. Résumé | Liens | BibTeX | Étiquettes: Deep learning, Domain of attraction, Learning systems, Learning tool, Linear matrix inequalities, Linear polynomials, Lyapunov functions, Lyapunov’s functions, Neural networks, Non linear, Particle swarm, Particle swarm optimization, Particle swarm optimization (PSO), Polynomial systems, Polynomials, Swarm intelligence, Swarm optimization @conference{Aloui2023, This Paper deals with the topic of non linear polynomial systems. It explains a way to estimate and enlarge the region of attraction of nonlinear polynomial systems. It provides a deep learning method for estimating the domain of attraction and uses the Particle Swarm Optimization Algorithm to enlarge this domain. Based on an analytic method found in literature, a dataset is generated, used then to train an artificial neural network, which will be an objective function of an optimization algorithm. This method dives an imitation to a previous complicated method, with less complexity and les elapsed time. The benchmark examples show the efficiency of the method and compare results with those obtained with the one using linear matrix inequalities. © 2023 IEEE. |
2022 |
Jerbi, Houssem; Dabbagui, Boudour; Hamidi, Faical; Aoun, Mohamad; Bouazzi, Yassine; Aoun, Sondess Ben Computing the Domain of Attraction using Numerical Techniques Conférence 2022, (Cited by: 0). Résumé | Liens | BibTeX | Étiquettes: Asymptotically stable equilibrium, Basins of attraction, Carleman linearization, Domain of attraction, Iterative methods, Linearization, Lyapunov functions, Lyapunov’s functions, Lypaunov functions, MATLAB, Non-linear modelling, Nonlinear systems, Numerical methods, Numerical techniques, Quadratic lyapunov function, Stability analyze, System stability @conference{Jerbi2022b, Stability analysis of controlled nonlinear systems is a problem of fundamental importance in system engineering. This paper elaborates an explicit numerical technique to maximize a quadratic Lyapunov function for the class of polynomial nonlinear models. Using the computed Lyapunov function an enlarged subsets of the basin of attraction of an asymptotically stable equilibrium can be computed in an iterative analytical way. We mainly use the Carleman linearization technique that converts a nonlinear autonomous system of finite dimension into an equivalent linear infinite dimension one. We implement the sampling technique as a numerical tool allowing the maximization of estimated regions of attraction. An example is given to demonstrate the efficiency of the proposed approach. The numerical study analysis of the designed scheme is led using the Matlab software environment. © 2022 IEEE. |
Jerbi, Houssem; Dabbagui, Boudour; Hamidi, Faical; Aoun, Mohamad; Bouazzi, Yassine; Aoun, Sondess Ben Computing the Domain of Attraction using Numerical Techniques Conférence 2022, (Cited by: 0). Résumé | Liens | BibTeX | Étiquettes: Asymptotically stable equilibrium, Basins of attraction, Carleman linearization, Domain of attraction, Iterative methods, Linearization, Lyapunov functions, Lyapunov’s functions, Lypaunov functions, MATLAB, Non-linear modelling, Nonlinear systems, Numerical methods, Numerical techniques, Quadratic lyapunov function, Stability analyze, System stability @conference{Jerbi2022, Stability analysis of controlled nonlinear systems is a problem of fundamental importance in system engineering. This paper elaborates an explicit numerical technique to maximize a quadratic Lyapunov function for the class of polynomial nonlinear models. Using the computed Lyapunov function an enlarged subsets of the basin of attraction of an asymptotically stable equilibrium can be computed in an iterative analytical way. We mainly use the Carleman linearization technique that converts a nonlinear autonomous system of finite dimension into an equivalent linear infinite dimension one. We implement the sampling technique as a numerical tool allowing the maximization of estimated regions of attraction. An example is given to demonstrate the efficiency of the proposed approach. The numerical study analysis of the designed scheme is led using the Matlab software environment. © 2022 IEEE. |
Publications
2023 |
Estimating and enlarging the domain of attraction for polynomial systems using a deep learning tool Conférence 2023. |
Estimating and enlarging the domain of attraction for polynomial systems using a deep learning tool Conférence 2023. |
2022 |
Computing the Domain of Attraction using Numerical Techniques Conférence 2022, (Cited by: 0). |
Computing the Domain of Attraction using Numerical Techniques Conférence 2022, (Cited by: 0). |