Home /Research /Multi-Robot Guided Policy Search for Learning Decentralized Swarm Control
SWARM

Multi-Robot Guided Policy Search for Learning Decentralized Swarm Control

Chao Jiang, Yi Guo

Year
2020
Citations
6

Abstract

Multi-robot learning has been extensively studied recently. Developing provably-correct algorithms for learning decentralized control policies remains challenging. In this letter, we propose a sample-efficient multi-robot learning method based on guided policy search to learn decentralized swarm control policies. The proposed method uses distributed trajectory optimization to provide guiding trajectory samples for policy training. In turn, the learned policy is exploited to update the trajectory optimization results so that the guiding trajectories are reproducible by the current policy. A learning algorithm is designed to alternate between distributed trajectory optimization and policy optimization, which eventually converges to a solution with good long-term performance. We demonstrate the effectiveness of our method in a multi-robot rendezvous problem. The simulation results in a robot simulator show that our method efficiently learn decentralized control policy with substantially less training samples.

Keywords

RendezvousTrajectoryComputer scienceRobotTrajectory optimizationSwarm behaviourControl (management)Artificial intelligenceMathematical optimizationOptimal control

Related papers

Browse all SWARM papers