Abstract
In this paper, the authors present a distributed computing algorithm for an application of deploying a group of mobile robotic agents in a convex region. Each agent can be treated as an embedded system with its own sensors and actuators. Under the assumption that agents have limited sensing capabilities, the distributed computing algorithm is designed to make agents cover the convex region so that each member's individual region, the space around them, is optimized. Each agent must accommodate its kinematic constraints and can only exchange information locally based on the range of the sensors equipped. The proposed algorithm utilizes Voronoi partitions to create individual subregions and directs each member toward the centroid of their subregion. The Voronoi partitions are updated with each iteration of the algorithm. Simulation results are provided to validate the proposed 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 callMore From: International Journal of Handheld Computing Research
Disclaimer: 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.
