METHOD OF DYNAMIC PROGRAMMING FOR INFORMATION ROBOT’S BRANCHING PATH OPTIMIZATION
DOI:
https://doi.org/10.18372/1990-5548.53.12150Keywords:
Compound dynamic system, optimal control, branching path.Abstract
The article describes and proves the necessary and sufficient conditions for optimality of information robot’s branching path with branching profile containing the central and lateral branches without interaction of subsystems after separation. The formulated conditions make it possible to determine the optimal coordinates and instants of the branching time of the trajectory, as well as the optimal controls and trajectories of the components of the information robot to the specified purposes along the hotel branches of the trajectory after they are separated from the carrier. The practical importance of the obtained conditions lies in the fact that it is possible to develop on its base the computational procedures for on-line calculation of optimal branching paths of such compound dynamical systems.
References
O. Lysenko and O. Tachinina, “Mathematical formulation of the problem of optimization of the motion of a group of flying robots on the basis of unmanned aerial vehicles,” Visnyk AMU, Kyiv, 2014, vol. 1(7), pp. 93–99.
L. Ashchepkov. Optimal control of discontinuous systems. Novosibirsk, Nauka, 1987, 226 p.
O. Lysenko, O. Tachinina, S. Chumachenko, and O. Nikulin, “Problem of the theory of branching paths to solve problems of search and rescue emergencies in the area,” Tehnycheskaya Mechanics, Dnepropetrovsk, 2015, vol. 1, pр.73–78.
O. Lysenko, O. Tachinina, “Method of location of sensors based on the compound dynamic system technology in the area of emergency situation”. International periodic scientific journal SWorld, Ivanovo, 2014, vol. 1, pp. 84–89.
O. Tachinina, “Conditions for optimality of the trajectory groups of unmanned aerial vehicles to possible changes in the target motion at any time in a given interval.” Visnyk AMU, Kyiv, 2015, no. 1(9). pp. 178–185.
A. Sage and Ch. C. White, Optimum Systems Control. Moscow, Radio and connection, 1982, 392 p.
R. Bellman, Dynamic Programming, Princeton, Princeton University Press, 1957, 400 p.
N. Sivov and O. Lysenko, “Minimization of the functional of the generalized work in the optimization problem of an arbitrarily branching trajectory of a composite dynamical system, Integrated on-board systems,” Moscow, 1989, vol. 3. pp. 37–46.
Downloads
Issue
Section
License
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).
