Abstract

This paper investigates the adaptive leaderless consensus of first-order agents with unknown control directions under switching topologies. The unknown control directions can be nonidentical and the network topologies are switching but jointly connected topologies in the sense that the union of the associated graphs over a certain time interval always has a spanning tree. It is shown that the leaderless consensus problem can be solved if the distributed control algorithms are properly designed. Finally, one example is given to show the effectiveness of the proposed algorithms.

Full Text
Published version (Free)

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 call