Abstract
The paper is devoted to comparison of the efficiency of information exchange by autonomous mobile agents when searching in a limited coverage area. The special feature of the problem is to consider the case of operation within the prohibition of usage of radio, light, and acoustic communication channels at a great distance, as well as without surfacing. The paper compares the following algorithms for the work of groups of autonomous robots, based on a preliminary division of area into sectors and survey of robots in their sectors using the “breadth-first search” method.
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.
