Algorithm of Quasiuniform Filling of Reachable Set for Nonlinear Control System
In this paper, we propose an algorithm of obtaining points that uniformly fill the volume of the reachable set, and even for a small number of elements results in a cloud quasiuniform approximation of the set. To solve the task of finding each additional point is to solve the optimization problem. M...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Irkutsk State University
2017-03-01
|
| Series: | Известия Иркутского государственного университета: Серия "Математика" |
| Subjects: | |
| Online Access: | http://isu.ru/journal/downloadArticle?article=_cb015000de2b41589080695552625fc3&lang=rus |
| _version_ | 1811316342711648256 |
|---|---|
| author | E. Finkelstein A. Gornov |
| author_facet | E. Finkelstein A. Gornov |
| author_sort | E. Finkelstein |
| collection | DOAJ |
| description | In this paper, we propose an algorithm of obtaining points that uniformly fill the volume of the reachable set, and even for a small number of elements results in a cloud quasiuniform approximation of the set. To solve the task of finding each additional point is to solve the optimization problem. Minimized function describes the uniformity and depends on the Euclidean distance between the elements of the approximation. It is designed to be equal or close to zero, if the distance exceeds the desired threshold value. Thus, a lower bound for the optimal value of the functional is pre-defined, so we save computing time for the random component of global optimization algorithms. "The tunnel ideology" underlies this algorithm. Besides local descent mechanisms it assumes that there are also transition mechanisms from a local extremum with the current record functional value to lower value extrema attraction domains. As a globalizing mechanism we use a nonlocal search in random directions repeated several times at each iteration of the algorithm. To improve the reliability of the proposed method of algorithm construction a recurrent random multistart is also included. The article includes the results of computational experiments on test examples and its comparison with calculations obtained by the method based on the Pontryagin maximum principle \cite{Gornov}. The designed method of reachable set approximation is applicable for two-dimensional systems and multidimensional ones as well. The experiments showed the efficiency of the approach and results comparison confirmed the accuracy the obtained approximations. |
| first_indexed | 2024-04-13T11:48:26Z |
| format | Article |
| id | doaj.art-77cbb86a897e4142a22778bd21328874 |
| institution | Directory Open Access Journal |
| issn | 1997-7670 2541-8785 |
| language | English |
| last_indexed | 2024-04-13T11:48:26Z |
| publishDate | 2017-03-01 |
| publisher | Irkutsk State University |
| record_format | Article |
| series | Известия Иркутского государственного университета: Серия "Математика" |
| spelling | doaj.art-77cbb86a897e4142a22778bd213288742022-12-22T02:48:08ZengIrkutsk State UniversityИзвестия Иркутского государственного университета: Серия "Математика"1997-76702541-87852017-03-01191217223https://doi.org/10.26516/1997-7670.2017.19.217Algorithm of Quasiuniform Filling of Reachable Set for Nonlinear Control SystemE. FinkelsteinA. GornovIn this paper, we propose an algorithm of obtaining points that uniformly fill the volume of the reachable set, and even for a small number of elements results in a cloud quasiuniform approximation of the set. To solve the task of finding each additional point is to solve the optimization problem. Minimized function describes the uniformity and depends on the Euclidean distance between the elements of the approximation. It is designed to be equal or close to zero, if the distance exceeds the desired threshold value. Thus, a lower bound for the optimal value of the functional is pre-defined, so we save computing time for the random component of global optimization algorithms. "The tunnel ideology" underlies this algorithm. Besides local descent mechanisms it assumes that there are also transition mechanisms from a local extremum with the current record functional value to lower value extrema attraction domains. As a globalizing mechanism we use a nonlocal search in random directions repeated several times at each iteration of the algorithm. To improve the reliability of the proposed method of algorithm construction a recurrent random multistart is also included. The article includes the results of computational experiments on test examples and its comparison with calculations obtained by the method based on the Pontryagin maximum principle \cite{Gornov}. The designed method of reachable set approximation is applicable for two-dimensional systems and multidimensional ones as well. The experiments showed the efficiency of the approach and results comparison confirmed the accuracy the obtained approximations.http://isu.ru/journal/downloadArticle?article=_cb015000de2b41589080695552625fc3&lang=rusreachable setapproximation algorithmoptimal control problem |
| spellingShingle | E. Finkelstein A. Gornov Algorithm of Quasiuniform Filling of Reachable Set for Nonlinear Control System Известия Иркутского государственного университета: Серия "Математика" reachable set approximation algorithm optimal control problem |
| title | Algorithm of Quasiuniform Filling of Reachable Set for Nonlinear Control System |
| title_full | Algorithm of Quasiuniform Filling of Reachable Set for Nonlinear Control System |
| title_fullStr | Algorithm of Quasiuniform Filling of Reachable Set for Nonlinear Control System |
| title_full_unstemmed | Algorithm of Quasiuniform Filling of Reachable Set for Nonlinear Control System |
| title_short | Algorithm of Quasiuniform Filling of Reachable Set for Nonlinear Control System |
| title_sort | algorithm of quasiuniform filling of reachable set for nonlinear control system |
| topic | reachable set approximation algorithm optimal control problem |
| url | http://isu.ru/journal/downloadArticle?article=_cb015000de2b41589080695552625fc3&lang=rus |
| work_keys_str_mv | AT efinkelstein algorithmofquasiuniformfillingofreachablesetfornonlinearcontrolsystem AT agornov algorithmofquasiuniformfillingofreachablesetfornonlinearcontrolsystem |