Distributed connectivity control of car-like robot networks

Abstract

This paper investigates communication connectivity control of mobile car-like robot networks. Employing algebraic graph theory, LaSalle invariant and negative gradient algorithm, the distributed control laws are proposed to maintain the communication connectivity of mobile car-like robots. With the control laws, robots can achieve the maximum connectivity topology. The simulation illustrates the effectiveness of the presented control laws.