Real-time computation of optimal control

V. M. Aleksandrov

Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 52 (2012) no. 10, pp. 1778-1800

Résumé

A new approach to the real-time implementation of time-optimal control for linear systems with a bounded control is proposed. The computational costs are separated between preliminary computations and computations in the course of the control process. The preliminary computations are independent of the particular initial condition and are based on the approximation of sets reachable in different times by a collection of hyperplanes. Methods for constructing hyperplanes and selecting a supporting hyperplane are described. Methods are proposed for approximately finding the normalized vector of initial conditions of the adjoint system, the driving time, and the switching times of the time-optimal control, and an iterative method for their refinement is developed. The computational complexity of the method is estimated. The computational algorithm is described, and simulation and numerical results are presented.

Bibliographie

[1] Pontryagin L. S., Boltyanskii V. G., Gamkrelidze R. V., Mischenko E. F., Matematicheskaya teoriya optimalnykh protsessov, Nauka, M., 1976 | Zbl

[2] Boltyanskii V. G., Matematicheskie metody optimalnogo upravleniya, Nauka, M., 1969 | MR

[3] Fedorenko R. P., Priblizhennoe reshenie zadach optimalnogo upravleniya, Nauka, M., 1978 | MR | Zbl

[4] Lyubushin A. A., “O primenenii modifikatsii metoda posledovatelnykh priblizhenii dlya resheniya zadach optimalnogo upravleniya”, Zh. vychisl. matem. i matem. fiz., 22:1 (1982), 30–35 | MR | Zbl

[5] Grachev N. I., Evtushenko Yu. G., “Biblioteka programm dlya resheniya zadach optimalnogo upravleniya”, Zh. vychisl. matem. i matem. fiz., 19:2 (1979), 367–387 | MR | Zbl

[6] Gabasov R., Kirillova F. M., Konstruktivnye metody optimizatsii, v. 2, Zadachi upravleniya, Izd-vo “Universitetskoe”, Minsk, 1984 | MR

[7] Pshenichnyi B. N., Sobolenko L. A., “Uskorennyi metod resheniya zadachi lineinogo bystrodeistviya”, Zh. vychisl. matem. i matem. fiz., 8:6 (1968), 1343–1351

[8] Belolipetskii A. A., “Chislennyi metod resheniya lineinoi zadachi optimalnogo upravleniya svedeniem ee k zadache Koshi”, Zh. vychisl. matem. i matem. fiz., 17:6 (1977), 1380–1386 | MR

[9] Srochko V. A., Iteratsionnye metody resheniya zadach optimalnogo upravleniya, Fizmatlit, M., 2000

[10] Osipov Yu. S., “Pakety programm: podkhod k resheniyu zadach pozitsionnogo upravleniya s nepolnoi informatsiei”, Uspekhi matem. nauk, 61:4 (2006), 25–76 | MR | Zbl

[11] Aleksandrov V. M., “Chislennyi metod resheniya zadachi lineinogo bystrodeistviya”, Zh. vychisl. matem. i matem. fiz., 38:6 (1998), 918–931 | MR | Zbl

[12] Balashevich N. V., Gabasov R., Kirillova F. M., “Chislennye metody programmnoi i pozitsionnoi optimizatsii lineinykh sistem upravleniya”, Zh. vychisl. matem. i matem. fiz., 40:6 (2000), 838–859 | MR | Zbl

[13] Gabasov R., Kirillova F. M., “Optimalnoe upravlenie v rezhime realnogo vremeni”, II Mezhdunar. konf. po problemam upravleniya, Plenarn. dokl., In-t problem upravleniya, M., 2003, 20–47

[14] Gabasov R., Kirillova F. M., “Optimalnoe upravlenie i nablyudenie v realnom vremeni”, Izv. RAN. Teoriya i sistemy upravleniya, 2006, no. 3, 90–111 | MR

[15] Aleksandrov V. M., “Posledovatelnyi sintez optimalnogo po bystrodeistviyu upravleniya”, Zh. vychisl. matem. i matem. fiz., 39:9 (1999), 1464–1478 | MR | Zbl

[16] Aleksandrov V. M., “Iteratsionnyi metod vychisleniya v realnom vremeni optimalnogo po bystrodeistviyu upravleniya”, Sib. zhurnal. vychisl. matem., 10:1 (2007), 1–28 | Zbl

[17] Aleksandrov V. M., “Posledovatelnyi sintez optimalnogo po bystrodeistviyu upravleniya v realnom vremeni”, Avtomatika i telemekhan., 2008, no. 8, 3–24 | Zbl

[18] Aleksandrov V. M., “Priblizhennoe reshenie zadachi lineinogo bystrodeistviya”, Avtomatika i telemekhan., 1998, no. 12, 3–13

[19] Chernousko F. L., “Ellipsoidalnye otsenki oblasti dostizhimosti upravlyaemoi sistemy”, Prikl. matem. i mekhan., 45:1 (1981), 11–19 | MR

[20] Ovseevich A. I., Chernousko F. L., “Nekotorye svoistva optimalnykh ellipsoidov, approksimiruyuschikh mnozhestva dostizhimosti”, Dokl. AN, 388:4 (2003), 462–465 | MR | Zbl

[21] Ovseevich A. I., Tarabanko Yu. V., “Yavnye formuly dlya ellipsoidov, approksimiruyuschikh oblasti dostizhimosti”, Izv. RAN. Teoriya i sistemy upravleniya, 2007, no. 2, 33–44 | MR

[22] Khrustalev M. M., “Tochnoe opisanie mnozhestv dostizhimosti i uslovie globalnoi optimalnosti dinamicheskikh sistem. I: Otsenki i tochnoe opisanie mnozhestv dostizhimosti i upravlyaemosti”, Avtomatika i telemekhan., 1988, no. 5, 62–71 | MR

[23] Gurman V. I., Trushkova E. A., “Otsenki mnozhestv dostizhimosti upravlyaemykh sistem”, Differents. ur-niya, 45:11 (2009), 1601–1609 | MR | Zbl

[24] Polyak B. T., Scherbakov P. S., “Mnozhestva dostizhimosti i prityazheniya lineinykh sistem s ogranichennym upravleniem: opisanie s pomoschyu invariantnykh ellipsoidov”, Stokhasticheskaya optimizatsiya v informatike, 4:1 (2008), 3–24

[25] Berdyshev Yu. I., “O postroenii oblasti dostizhimosti v odnoi nelineinoi zadache”, Izv. RAN. Teoriya i sistemy upravleniya, 2006, no. 4, 22–26 | MR

[26] Raisig G., “Vypuklost mnozhestv dostizhimosti sistem upravleniya”, Avtomatika i telemekhan., 2007, no. 9, 64–78 | MR

[27] Brusnikina N. B., Lotov A. V., “Approksimatsiya s garantirovannoi tochnostyu mnozhestv dostizhimosti dlya lineinoi dinamicheskoi sistemy, podverzhennoi impulsnym vozdeistviyam”, Zh. vychisl. matem. i matem. fiz., 47:11 (2007), 1855–1864 | MR

[28] Gantmakher F. R., Teoriya matrits, Nauka, M., 1966 | MR

[29] Aleksandrov V. M., “Skhodimost metoda posledovatelnogo sinteza optimalnogo po bystrodeistviyu upravleniya”, Zh. vychisl. matem. i matem. fiz., 39:10 (1999), 1650–1661 | MR | Zbl

[30] Dubovitskii A. Ya., Rubtsov V. A., “Lineinye bystrodeistviya”, Zh. vychisl. matem. i matem. fiz., 8:5 (1968), 937–949 | Zbl

[31] Aleksandrov V. M., “Optimalnoe po bystrodeistviyu pozitsionno-programmnoe upravlenie lineinymi dinamicheskimi sistemami”, Sib. elektronnye matem. izvestiya, 6 (2009), 385–439 | MR