Decentralized Multi-Robot Formation Control Using Reinforcement Learning

Juraj Obradovic, Marko Krizmancic, Stjepan Bogdan
6/26/2023
cs.ROcs.AIcs.MA

No confident code implementation found for this paper. 5 possible matches can be shown below.

Abstract

This paper presents a decentralized leader-follower multi-robot formation control based on a reinforcement learning (RL) algorithm applied to a swarm of small educational Sphero robots. Since the basic Q-learning method is known to require large memory resources for Q-tables, this work implements the Double Deep Q-Network (DDQN) algorithm, which has achieved excellent results in many robotic problems. To enhance the system behavior, we trained two different DDQN models, one for reaching the formation and the other for maintaining it. The models use a discrete set of robot motions (actions) to adapt the continuous nonlinear system to the discrete nature of RL. The presented approach has been tested in simulation and real experiments which show that the multi-robot system can achieve and maintain a stable formation without the need for complex mathematical models and nonlinear control laws.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 5 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{obradovic2023decentralized,
  title  = {Decentralized Multi-Robot Formation Control Using Reinforcement Learning},
  author = {Juraj Obradovic and Marko Krizmancic and Stjepan Bogdan},
  year   = {2023},
  eprint = {2306.14489},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2306.14489v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2306.14489.svg)](https://codeofpaper.com/paper/2306.14489)

Discussion