Abstract
In this paper we address the problem of dynamic coverage control of a convex polygonal region in the plane using N agents with bounded velocities and finite instantaneous area of coverage. The proposed coverage algorithm guarantees finite-time search of the region, does not depend on gradient-based methods, and can be carried out by the agents in a distributed fashion. We provide an upper bound on the completion time as well as the number of messages that need to be exchanged by the agents. A simulation is provided to illustrate the algorithm.
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.
