Abstract
A distributed control law that guarantees connectivity maintenance in a network of multiple mobile agents is presented. The control law, which lets the agents perform formation manoeuvres, respects sensor limitations by allowing each agent to only take into account agents within its sensing radius. In contrast to previous approaches to the problem, the proposed control law does not attain infinite values whenever an edge of the communication graph tends to be lost. This is achieved via the use of decentralised navigation functions, which are bounded potential fields. The navigation functions are defined to take into account the connectivity maintenance objective. The authors first treat the case of connectivity maintenance for a static communication graph and then extend the result to the case of dynamic graphs. The results are illustrated on a formation control problem.
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.
