Algorithm for Constructing a Guaranteeing Program Package in a Control Problem with Incomplete Information

Strelkovskii, N. ORCID: https://orcid.org/0000-0001-6862-1768 & Orlov, S. (2018). Algorithm for Constructing a Guaranteeing Program Package in a Control Problem with Incomplete Information. Moscow University Computational Mathematics and Cybernetics 42 (2) 69-79. 10.3103/S0278641918020061.

Full text not available from this repository.

Abstract

A package control problem is considered for a target set at a moment of time. The dynamic system under control is described by linear differential equations, the control area is a convex compact, and the target set is convex and closed. A version of the subsequent approximations method in extended space is proposed for constructing elements of a guaranteeing program package in the case of regular clusters.

Item Type:	Article
Uncontrolled Keywords:	incomplete information; linear dynamic systems; control problem for a target set; subsequent approximations method
Research Programs:	Advanced Systems Analysis (ASA)
Depositing User:	Luke Kirwan
Date Deposited:	05 Jun 2018 07:48
Last Modified:	27 Aug 2021 17:30
URI:	https://pure.iiasa.ac.at/15315

Actions (login required)

View Item