Dynamic Coverage Control Based on K-Means

Abstract

In this article, we propose the dynamic coverage control method based on <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</i> -means. In the traditional coverage control, Voronoi partition method is used to assign the coverage positions for intelligent units. However, the Voronoi partition method requires that the space to be covered is compact and convex, and it is difficult to realize the coverage control of high-dimensional space. Therefore, in this article, we propose a dynamic coverage planning algorithm based on <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</i> -means, which relaxes the requirements on the coverage objects and can calculate the optimal coverage positions of the intelligent units. In addition, we also design a dynamic coverage control law based on discrete sliding mode control to drive the intelligent units to the optimal coverage positions. Through the combination of planning algorithm and control law, the optimal coverage control performance can be achieved for the specified targets and the specified area, which can be discrete, nonconvex, and high dimensional. The stability of the planning algorithm and the control law are proved by theoretical deduction. The effectiveness and superiority of the dynamic coverage control method are verified by two examples.