Abstract
This paper focuses on the design of fixed-time consensus for multiple unicycle-type mobile agents. A distributed switched strategy, based on local information, is proposed to solve the leader-follower consensus problem for multiple nonholonomic agents in chained form. The switching times and the prescribed convergence time are explicitly given regardless of the initial conditions. Simulation results highlight the efficiency of the proposed method.
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.
