Skip to main content
Log in

Reachability Sets of a Class of Multistep Control Processes: Their Design

  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

An upper estimate and an iterative “restriction” algorithm for the reachability set for determining the optimal control for a class of multistep control processes are designed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. Chernous'ko, F.L., Otsenivanie fazovogo sostoyaniya sistem. Metod ellipsoidov (Phase State of Systems: An Ellipsoidal Estimation Method), Moscow: Nauka, 1988.

    Google Scholar 

  2. Khrustalev, M.M., Exact Description of Reachability Sets and Conditions for the Global Optimality of a Dynamic System, Avtom. Telemekh., 1988, no. 5, pp. 62–70.

  3. Gurman, V.I., Printsip rasshireniya v zadachakh upravleniya (Extension Principle in Control Problems), Moscow: Nauka, 1985.

    Google Scholar 

  4. Konstantinov, G.N., Normirovanie vozdeistvii na dinamicheskie sistemy (Normalization of Actions on Dynamic Systems), Irkutsk: Irkut. Gos. Univ., 1983.

    Google Scholar 

  5. Mikhalevich, I.S. and Volkovich, V.L., Vychislitel'nye metody issledovaniya i proektirovaniya slozhnykh sistem (Computer-Aided Research Methods and Design of Complicated Systems), Moscow: Nauka, 1982.

    Google Scholar 

  6. Krotov, V.F. and Gurman, V.I., Metody i zadachi optimal'nogo upravleniya (Optimal Control Methods and Problems), Moscow: Nauka, 1973.

    Google Scholar 

  7. Averbakh, I.L. and Tsurkov, V.L., Optimizatsiya v blochnykh zadachakh s tselochislennymi peremennymi (Optimization in Block Problems with Integral-Valued Variables), Moscow: Nauka, 1995.

    Google Scholar 

  8. Gendler, M.V. and Zaretskii, L.S., An Exact Algorithm for Solving Multivariate Resource Allocation Problem, Avtom. Telemekh., 1992, no. 6, pp. 138–145.

  9. Sergeev, S.I., Computational Algorithms for the Travelling Salesman Problem. I, II, Avtom. Telemekh., 1994, no. 5, pp. 66–79; no. 6, pp. 106–114.

  10. Balas, E. and Christofides, N., A Restricted Lagrangean Approach to the Travelling Salesman Problem, Math. Program., 1981, vol. 21, no. 1, pp. 19–46.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sergeev, S.I. Reachability Sets of a Class of Multistep Control Processes: Their Design. Automation and Remote Control 63, 919–925 (2002). https://doi.org/10.1023/A:1016117706044

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1016117706044

Keywords

Navigation