Optimal generated numerical sequences in problems of placement of tracking segments in evaluating algorithms of operator activity, I

Abstract

In designing algorithms of activity of an operator of an anthropocentric object, the problem of evaluating its load by tracking algorithms arises. The mathematical formulation of this problem is as follows: for a given positive numerical sequence with a finite number of terms and a given piecewise linear function, estimating this sequence by the sum of estimates of its terms, find an optimal sequence among the set of sequences (generated sequences) obtained by adding at any single place or in several places any number of adjacent terms. For an arbitrary sequence (from a certain class) under an a priori known piecewise linear function, a computer oriented technique of embedded sliding sections is found that makes it possible to construct a complete set of generated sequences. An algorithm for selecting optimal generated sequences in this set, recalling the algorithm of the R. Bellman dynamic programming, is proposed.