This paper studies the problem of multi-leader multi-follower coordination with proximity-based network topologies. The particular interest is to drive all the followers towards the convex hull formed by the moving leaders while producing cohesion behavior and keeping group dispersion. First, in the case of stationary leaders, we design a gradient-based continuous control algorithm. We show that with this continuous algorithm the control objective can be achieved, and the tracking error bound can be controlled by tuning some control parameters. We apply the continuous control algorithm to the moving leaders case and show that the tracking error bound is related to the velocities of the leaders. However, in this case, the algorithm has one restriction that the velocities of the leaders should depend on neighboring followers’ velocities, which might not be desirable in some scenarios. Therefore, we propose a nonsmooth algorithm for moving leaders which works under the mild assumption of boundedness of leaders’ velocities. Finally, we present numerical examples to show the validity of the proposed algorithms. This paper studies the problem of multi-leader multi-follower coordination with proximity-based network topologies. The particular interest is to drive all the followers towards the convex hull formed by the moving leaders while producing cohesion behavior and keeping group dispersion. First, in the case of stationary leaders, we design that gradient-based continuous control algorithm. We show that continuous algorithm the control objective can be achieved, and the tracking error bound can be controlled by tuning some control parameters. We apply the continuous control algorithm to the moving leaders case and show that the tracking error bound is related to the velocities of the leaders. However, in this case, the algorithm has one restriction that the velocities of the leaders should depend on neighboring followers’ velocities, which might not be desirable in some scenarios. Therefore, we propose a nonsmooth algorithm for moving leaders which works under the mild assumption of boundedness of leaders’ velocities. Finally, we present numerical examples to show the validity of the proposed algorithms.