A Comparison of PSO and Reinforcement Learning for Multi-Robot Obstacle Avoidance

The design of high-performing robotic controllers constitutes an example of expensive optimization in uncertain environments due to the often large parameter space and noisy performance metrics. There are several evaluative techniques that can be employed for on-line controller design. Adequate benchmarks help in the choice of the right algorithm in terms of final performance and evaluation time. In this paper, we use multi-robot obstacle avoidance as a benchmark to compare two different evaluative learning techniques: Particle Swarm Optimization and Q-learning. For Q-learning, we implement two different approaches: one with discrete states and discrete actions, and another one with discrete actions but a continuous state space. We show that continuous PSO has the highest fitness overall, and Q-learning with continuous states performs significantly better than Q-learning with discrete states. We also show that in the single robot case, PSO and Q-learning with discrete states require a similar amount of total learning time to converge, while the time required with Q-learning with continuous states is significantly larger. In the multi-robot case, both Q-learning approaches require a similar amount of time as in the single robot case, but the time required by PSO can be significantly reduced due to the distributed nature of the algorithm.

Published in:
2013 IEEE Congress on Evolutionary Computation (CEC), 149-156
Presented at:
IEEE Congress on Evolutionary Computation, Cancún, México, June 20-23, 2013
New York, IEEE

 Record created 2013-05-20, last modified 2018-01-28

External links:
Download fulltextURL
Download fulltextPreprint
Rate this document:

Rate this document:
(Not yet reviewed)