Abstract
This article, concerned with a part of the research on distributed coordination work by multiple robots, discusses an algorithm for creating maps of unknown environments which are searched for and observed by multiple mobile robots, and on the results of a simulation experiment using this algorithm. This algorithm comprises a moving method, an observation method, and a task planning method which are intended to help the multiple mobile robots carry out an efficient search of unknown environments.
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.
