×

On the problem of optimization in group control. (English) Zbl 1425.93107

Kondratenko, Yuriy P. (ed.) et al., Advanced control techniques in complex engineering systems: theory and applications. Dedicated to Professor Vsevolod M. Kuntsevich. Cham: Springer. Stud. Syst. Decis. Control 203, 51-61 (2019).
Summary: Given is a team of \(m\) controlled motions with two types of members, a target set \(\mathcal{M}\) and an array \(\mathbf{E}_k(t)\) of external obstacles. The problem is for both types to simultaneously reach the target, avoiding the obstacles and the possible mutual collisions, while performing the overall process in minimal time. The problem solution is described in terms of the Hamiltonian formalism.
For the entire collection see [Zbl 1416.93005].

MSC:

93B52 Feedback control
49N90 Applications of optimal control and differential games
Full Text: DOI

References:

[1] Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Boston (2004) · Zbl 1058.90049
[2] Krasovski, N.N., Subbotin, A.I.: Game-Theoretic Control Problems. Springer, Berlin (1988) · Zbl 0649.90101
[3] Kumar, V., Leonard, N., Morse, A.S. (eds.): Cooperative Control. Lecture Notes in Control and Information Sciences, vol. 309. Springer, Berlin (2004)
[4] Kuntsevich, V.M.: Control Under Uncertainty: Guaranteed Results in Control and Identification Problems. Naukova Dumka, Kyiv (2006)
[5] Kuntsevich, V.M., Gubarev, V.F., Kondratenko, Y.P., Lebedev, D.V., Lysenko, V.P. (eds.): Control Systems: Theory and Applications. Automation, Control and Robotics. River Publishers, Gistrup (2018) · Zbl 1522.93012
[6] Kurzhanski, A.B.: Comparison principle for equations of the Hamilton-Jacobi type in control theory. Proc. Steklov Inst. Math. 251, 185-195 (2006) · Zbl 1129.49035 · doi:10.1134/S0081543806050130
[7] Kurzhanski, A.B.: On a team control problem under obstacles. Proc. Steklov Inst. Math. 291(1), S122-S142 (2015) · Zbl 1339.93012
[8] Kurzhanski, A.B.: Problem of collision avoidance for a group motion with obstacles. Trudy Inst. Mat. I Mekh. UrO RAN 21(2), 134-149 (2015)
[9] Kurzhanski, A.B., Kuntsevich, V.M.: Attainability domains for linear and some classes of nonlinear discrete systems and their control. J. Autom. Inf. Sci. 42(1), 1-18 (2010)
[10] Kurzhanski, A.B., Mesyats, A.I.: Ellipsoidal motions for applied control: from theory to computation. In: Proceedings of CDC 2013 (the 52nd IEEE Conference on Decision and Control), pp. 5816-5821 (2013)
[11] Kurzhanski, A.B., Mesyats, A.I.: The mathematics of team control. In: Proceedings of MTNS 2014 (the 21st International Symposium on Mathematical Theory of Networks and Systems), pp. 1755-1758 (2014)
[12] Kurzhanski, A.B., Mesyats, A.I.: The Hamiltonian formalism for problems of group control under obstacles. In: Proceedings of NOLCOS 2016 (the 10th IFAC Symposium on Nonlinear Control Systems) (2016)
[13] Kurzhanski, A.B., Varaiya, P.: On synthesizing target controls under obstacle and collision avoidance. J. Frankl. Inst. 347(1), 130-145 (2010) · Zbl 1298.93161 · doi:10.1016/j.jfranklin.2009.11.002
[14] Kurzhanski, A.B., Varaiya, P.: Dynamics and Control of Trajectory Tubes: Theory and Computation. Birkhäuser, Boston (2014) · Zbl 1336.93004
[15] Nijmeijer, H., Pettersen, K.Y., Gravdahl, J.T. (eds.): Group Coordination and Cooperative Control. Lecture Notes in Control and Information Sciences, vol. 336. Springer, Berlin (2006) · Zbl 1096.93002
[16] Olfati-Saber, R.: Flocking for multi-agent dynamic systems: algorithms and theory. IEEE Trans. Autom. Control 51(3), 5816-5821 (2006) · Zbl 1366.93391 · doi:10.1109/TAC.2005.864190
[17] Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1972)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.