Abstract

This paper is an extension to our work presented in Ben Slimane and Tagina (in: Nguyen, Pimenidis, Khan and Trawinski (eds) Computational collective intelligence, Springer, Cham, 2018). It deals with the the problem of partitioning the space in an even way between a number of autonomous mobile robots. In our previous work we proposed a distributed one-phased partitioning method where each robot constructs its corresponding Voronoi cell from the information received from its neighbors. We propose in what follows a two-phased partitioning approach, starting with a dispersion task, followed by the distributed Voronoi partitioning as for the one-phased method. For the dispersion phase, we propose a novel parametrized algorithm from which we seek to control the dispersion behavior of the robots. The individual actions of the agents are controlled by the belief–desire–intention model which endows them with the required know-how needed to operate deliberately and readjust the plans dynamically on the go. We show in this paper, through a series of experiments, the results of the dispersion method and the impact of its parameters on the generated maps. We also compare the results of the two partitioning methods to show the impact of the dispersion on the partitioning in terms of the actual performed steps towards convergence and the generated maps for both methods.

Full Text
Paper version not known

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 call

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.