Optimisation of Discrete Processes with Bounded Control

2018

Full text Open access: Gold Metadata (CSL-JSON)
DOI 10.5755/j01.itc.47.4.19933
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

The study considers the problem of optimal control for linear discrete systems with a free right end of the trajectory and constraints on control. A new approach to constructing a discrete system is proposed and control is determined at discrete instants of time. Necessary and sufficient conditions for optimality are obtained and a method is proposed for the exact solution of the boundary value problem, which is reduced to solving a finite number of systems of algebraic equations. The proposed method for solving the optimal control problem for a discrete system allows to represent the desired optimal control in the form of synthesising control. For this, a positively definite symmetric matrix is defined that satisfies a difference equation of Riccati type. An algorithm for constructing control for discrete systems is developed, based on the feedback principle, taking into account constraints on the values of controls. The problem is solved using the Lagrange multipliers of a special form, which depend on the phase coordinates at discrete instants of time. The proposed method for solving the problem of optimal control with constraints on control values is implemented on a computer with an application package and tested for the task of planning production and storage of products. Numerical calculations are carried out on a computer using the described problem-solving algorithm in which it is possible to take into account restrictions on the values of controls. Optimal values are determined and appropriate schedules of the production plan, storage of products and limited management at discrete instants of time are constructed.DOI: http://dx.doi.org/10.5755/j01.itc.47.4.19933