Skip to main content
Log in

Calculation of Elements of a Guiding Program Package for Singular Clusters of the Set of Initial States in the Package Guidance Problem

  • Published:
Proceedings of the Steklov Institute of Mathematics Aims and scope Submit manuscript

Abstract

A fixed-time package guidance problem is considered for a linear controlled dynamic system with a finite set of initial states. The control set is convex and compact and the target set is convex and closed. The paper focuses on the case where the set of initial states has singular clusters for which the existing algorithm for estimating the elements of a guiding program package is not applicable. It is suggested to consider a perturbed problem of extended program guidance with a smoothed control set. It is proved that the motions of the original and perturbed problems are close to each other at the terminal time; the corresponding estimates are provided. In the case of an extended target set with nonempty interior, it is also shown that a solution of the extended program guidance problem that is precisely guiding to the target set can be obtained by applying the existing algorithm for the perturbed problem with compressed target set. The suggested theoretical constructions are illustrated with a model example.

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. Yu. S. Osipov, “Control packages: An approach to solution of positional control problems with incomplete information,” Russ. Math. Surv. 61 (4), 611–661 (2006).

    Article  Google Scholar 

  2. A. V. Kryazhimskii and Yu. S. Osipov, “Idealized program packages and problems of positional control with incomplete information,” Proc. Steklov Inst. Math. 268 (Suppl. 1), S155–S174 (2010).

    Article  MathSciNet  Google Scholar 

  3. N. N. Krasovskii and A. I. Subbotin, Positional Differential Games (Nauka, Moscow, 1974) [in Russian].

    MATH  Google Scholar 

  4. A. V. Kryazhimskii and Yu. S. Osipov, “On the solvability of problems of guaranteeing control for partially observable linear dynamical systems,” Proc. Steklov Inst. Math. 277, 144–159 (2012).

    Article  MathSciNet  Google Scholar 

  5. A. V. Kryazhimskii and N. V. Strelkovskii, “An open-loop criterion for the solvability of a closed-loop guidance problem with incomplete information: Linear control systems,” Proc. Steklov Inst. Math. 291 (Suppl. 1), S113–S127 (2015).

    Article  Google Scholar 

  6. N. V. Strelkovskii, “Constructing a strategy for the guaranteed positioning guidance of a linear controlled system with incomplete data,” Moscow Univ. Comput. Math. Cybernet. 39 (3), 126–134 (2015).

    Article  MathSciNet  Google Scholar 

  7. P. G. Surkov, “The problem of package guidance with incomplete information for a linear control system with a delay,” Comput. Math. Model 28 (4), 504–516 (2017).

    Article  MathSciNet  Google Scholar 

  8. V. I. Maksimov and P. G. Surkov, “On the solvability of the problem of guaranteed package guidance to a system of target sets,” Vestn. Udmurt. Univ., Ser. Mat. Mekh. Komp. Nauki 27 (3), 344–354 (2017).

    Article  MathSciNet  Google Scholar 

  9. P. G. Surkov, “The problem of package guidance under incomplete information with integral observation signal,” Sib. Elektron. Mat. Izv. 15, 373–388 (2018).

    MATH  Google Scholar 

  10. N. V. Strelkovskii and S. M. Orlov, “Algorithm for constructing a guaranteeing program package in a control problem with incomplete information,” Moscow Univ. Comput. Math. Cybern. 42 (2), 69–79 (2018).

    Article  MathSciNet  Google Scholar 

  11. N. V. Strelkovskii and S. M. Orlov, “A method for calculation of program package elements for singular clusters,” in Systems Analysis: Modeling and Control: Proceedings of the International Conference in Memory of Academician A. V. Kryazhimskii, Moscow, Russia, 2018, pp. 97–99.

    Google Scholar 

  12. V. B. Gindes, “Singular control in optimal systems,” Izv. Vyssh. Uchebn. Zaved., Ser. Mat., No. 7, 34–42 (1967).

    MathSciNet  MATH  Google Scholar 

  13. S. N. Avvakumov, “Smooth approximation of convex compact sets,” Trudy Inst. Mat. Mekh. UrO RAN 4, 184–200 (1996).

    MathSciNet  MATH  Google Scholar 

  14. Yu. N. Kiselev, S. N. Avvakumov, and M. V. Orlov, Optimal Control: Linear Theory and Applications (MAKS, Moscow, 2007) [in Russian].

    Google Scholar 

  15. L. S. Pontryagin, “Linear differential games,” Proc. Steklov Inst. Math. 185, 225–232 (1990).

    MathSciNet  MATH  Google Scholar 

  16. S. N. Avvakumov, Yu. N. Kiselev, and M. V. Orlov, “Methods of solving optimal control problems based on the Pontryagin maximum principle,” Proc. Steklov Inst. Math. 211, 1–27 (1995).

    MathSciNet  MATH  Google Scholar 

  17. S. N. Avvakumov and Yu. N. Kiselev, “Support functions of some special sets, constructive smoothing procedures, and geometric difference,” in Problems of Dynamic Control: Collection of Research Papers, Ed. by Yu. S. Osipov and A. V. Kryazhimskii (VMK MGU, Moscow, 2005), pp. 24–110 [in Russian].

    MATH  Google Scholar 

Download references

Acknowledgments

The authors are grateful to S.N. Avvakumov, Yu.N. Kiselev, and M.V. Orlov for useful discussions of the results of this paper.

Funding

This work was supported by the Russian Science Foundation (project no. 14-11-00539).

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to S. M. Orlov or N. V. Strelkovskii.

Additional information

Russian Text © The Author(s), 2019, published in Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2019, Vol. 25, No. 1, pp. 150-165.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Orlov, S.M., Strelkovskii, N.V. Calculation of Elements of a Guiding Program Package for Singular Clusters of the Set of Initial States in the Package Guidance Problem. Proc. Steklov Inst. Math. 308 (Suppl 1), 163–177 (2020). https://doi.org/10.1134/S0081543820020133

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0081543820020133

Keywords

Navigation