“…The communication topology of USVs with a leader and N followers is described by the directed graph G = (V, E) [44][45][46] , where node set V = {0, 1, • • • , N} with "0" being the leader and "1, 2, • • • , N" standing for the followers. E = {(j, i) : i, j ∈ V, i = j, i = 0} is a set of edges, where ordered edge (j, i) implies that node i can receive the information from node j, and node j is a neighbor of node i.…”