Search algorithm of optimum control actions on dynamic object
Abstract
In the state-space (SS) of nonlinear non-stationary dynamic objects are investigated numerical algorithms of their optimum control with restrictions on phase coordinates. The control actions limit by a class of step functions, as positive and negative impulses generating in the SS binary trees. The dynamic process is interpreted as growth binary tree. In accordance with growth binary tree, it the knots get into various areas of the SS (clusters). The purpose of control is the get, during growth binary tree, one or several knots in a specific cluster (target set). In the present work is considered the new numerical search method of optimum control with adaptation to restrictions of an external environment, called by a method of binary trees.References
Published
2005-04-01
How to Cite
Kurbanov,. (2005). Search algorithm of optimum control actions on dynamic object. SPIIRAS Proceedings, 2(2), 317-327. https://doi.org/10.15622/sp.2.27
Section
Articles
Authors who publish with this journal agree to the following terms:
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
