DocumentCode
2419930
Title
Stochastic source seeking in complex environments
Author
Atanasov, Nikolay ; Le Ny, Jerome ; Michael, Nathan ; Pappas, George J.
Author_Institution
Dept. of Electr. & Syst. Eng., Univ. of Pennsylvania, Philadelphia, PA, USA
fYear
2012
fDate
14-18 May 2012
Firstpage
3013
Lastpage
3018
Abstract
The objective of source seeking problems is to determine the minimum of an unknown signal field, which represents a physical quantity of interest, such as heat, chemical concentration, or sound. This paper proposes a strategy for source seeking in a noisy signal field using a mobile robot and based on a stochastic gradient descent algorithm. Our scheme does not require a prior map of the environment or a model of the signal field and is simple enough to be implemented on platforms with limited computational power. We discuss the asymptotic convergence guarantees of algorithm and give specific guidelines for its application to mobile robots in unknown indoor environments with obstacles. Both simulations and real-world experiments were carried out to evaluate the performance of our approach. The results suggest that the algorithm has good finite time performance in complex environments.
Keywords
convergence; gradient methods; mobile robots; robot vision; stochastic processes; asymptotic convergence; complex environments; indoor environments; mobile robot; noisy signal field; performance evaluation; stochastic gradient descent algorithm; stochastic source seeking; unknown signal field determination; Approximation methods; Noise; Robot kinematics; Stochastic processes; Trajectory; Wireless communication;
fLanguage
English
Publisher
ieee
Conference_Titel
Robotics and Automation (ICRA), 2012 IEEE International Conference on
Conference_Location
Saint Paul, MN
ISSN
1050-4729
Print_ISBN
978-1-4673-1403-9
Electronic_ISBN
1050-4729
Type
conf
DOI
10.1109/ICRA.2012.6225289
Filename
6225289
Link To Document