An Optimization Method for Pattern Formation in Dynamic Environment

Existing methods cannot effectively optimize the pattern formation in the dynamic environment. Therefore, this paper presents algorithms to employ the convex quadratic programming to minimize the distance to obtain the optimal pattern parameters based on the dynamic environment information and the given pattern shape and then plan the collision-free path of each robot to the goal considering a preferred velocity. Simulation results verified the effectiveness of the proposed methodology for scenarios of letter formation.