Abstract
This paper presents a class of bounded connectivity preserving consensus control algorithms for a team of unicycles. The control law is based on some analytic potential functions, ensuring the boundedness of the control signal. It is assumed that the information flow graph is an undirected static tree. A detailed convergence analysis for the designed controllers is subsequently presented. The growth of the radius of the smallest circle centered at a fix point which contains all agents is shown to be bounded by a decaying exponential function. This result is used to show the boundedness of the trajectories of the agents. Some important properties of positive limit sets of nonlinear systems are then used to prove the convergence of the agents to consensus, under the proposed controllers. Simulations demonstrate the effectiveness of the proposed connectivity preserving control law.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
