Share Email Print
cover

Proceedings Paper

Comparative study of neural-network-based learning strategies for collective robotic search problem
Author(s): Nian Zhang; Alexander Novokhodko; Donald C. Wunsch; Cihan H. Dagli
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

One important application of mobile robots is searching a geographical region to locate the origin of a specific sensible phenomenon. A variety of optimization algorithms can be employed to locate the target source which has the maximum intensity of the distribution of illumination function. It is very important to evaluate the performance of those optimization algorithms so that the researchers can adopt the most appropriate optimization approach to save a lot of execution time and cost of both collective robots and human beings. In this paper we provide three different neural network algorithms: steepest ascent algorithm, combined gradient algorithm and stochastic optimization algorithm to solve the collective robotics search problem. Experiments with different pair of number of sources and robots were carried out to investigate the effect of source size and team size on the task performance, as well as the risk of mission failure. The experimental results showed that the performance of steepest ascent method is better than that of combined gradient method, while the stochastic optimization method is better than steepest ascent method.

Paper Details

Date Published: 21 March 2001
PDF: 12 pages
Proc. SPIE 4390, Applications and Science of Computational Intelligence IV, (21 March 2001); doi: 10.1117/12.421174
Show Author Affiliations
Nian Zhang, Univ. of Missouri/Rolla (United States)
Alexander Novokhodko, Univ. of Missouri/Rolla (United States)
Donald C. Wunsch, Univ. of Missouri/Rolla (United States)
Cihan H. Dagli, Univ. of Missouri/Rolla (United States)


Published in SPIE Proceedings Vol. 4390:
Applications and Science of Computational Intelligence IV
Kevin L. Priddy; Paul E. Keller; Peter J. Angeline, Editor(s)

© SPIE. Terms of Use
Back to Top