Abstract
In this paper we address multi-robot coordinated navigation from a topological perspective. The adopted topological representation of the environment leads naturally to a Markov game model to describe the interaction of the multiple robots in the environment. In this setting, we combine the Q-learning algorithm with a powerful coordination mechanism (biased adaptive play). We show that this combined algorithm, coordinated Q-learning, converges to an optimal, coordinated solution for the navigation problem. This implies that the team of robots is able to coordinate without using any communication protocol to enforce the coordination. We illustrate our method in some simple navigation tasks.
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.
