Nonholonomic source seeking in switching random fields

We consider the problem of designing controllers for nonholonomic mobile robots converging to the source (minimum) of a field. In addition to the mobility constraints posed by the nonholonomic dynamics, we assume that the field is completely unknown to the robot and the robot has no knowledge of its own position. Furthermore, the field is randomly switching. In this paper, we combine ideas from stochastic approximations and nonholonomic control, in order to address this challenging problem. In particular, we develop a rotation-invariant and forward-sided version of the simultaneous-perturbation stochastic algorithm, which is much more suitable for sensor-free navigation. Based on this algorithm, we design source seeking controllers for nonholonomic robots and prove convergence to the unknown source with probability 1. The proposed controllers are demonstrated by numerical simulations.

Published in:
Proceedings of the IEEE Conference on Decision and Control, 6337-6342
Presented at:
IEEE Conference on Decision and Control, Atlanta, GA, USA, December 15-17, 2010

 Record created 2016-02-16, last modified 2018-09-13

Rate this document:

Rate this document:
(Not yet reviewed)