Abstract
The problem of navigation of cooperative multiple heterogeneous mobile robots is investigated. The mobile robots vary in size and their capabilities in terms of speeds to navigate through the region and sensor ranges to acquire information about the region. The robots are assumed to have sufficient memory to store the map and to be able to communicate with each other. An algorithm is presented for plane sweep by cooperative multiple mobile robots. The authors' approach makes use of an occupancy grid and the robots sensors are to sweep all pixels of the grid. The algorithm is discussed in detail and its feasibility is demonstrated by simulation results for the case of two cooperating mobile robots.
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.
