Shevchenko T. Methods and algorithms of solving of continuous dynamical set partitioning problems

Українська версія

Thesis for the degree of Candidate of Sciences (CSc)

State registration number

0414U003209

Applicant for

Specialization

  • 01.05.01 - Теоретичні основи інформатики та кібернетики

23-05-2014

Specialized Academic Board

К 08.051.09

Essay

Object of research are continuous dynamical set partitioning problems. Subject of research are models, methods and algorithms for solving continuous dynamical SPPs. Research methods are an infinite-dimensional optimization methods , functional analysis , duality theory , the theory of continuous SPPs, the theory of optimal control of systems with lumped parameters, non-differentiable optimization methods . Research goal is development and justification of methods and algorithms for solving continuous dynamical SPPs in which optimality criterion depends on the phase trajectories of a controlled system, as well as the controls of the system, the partition itself may be either static or dynamic. In this work, new mathematical models of dynamical continuous SPPs in which partition is dynamical, both fixed and with the control center subsets. New methods of solving continuous dynamical SPPs based on a synthesis of the theory of optimal sets partition and known methods of optimal control theory are developed and theoretically grounded. New algorithms for solving continuous dynamical SPPs are constructed. Programming complex on Delphi and C

Files

Similar theses