Sciweavers

Share
CDC
2010
IEEE

Nonholonomic source seeking in switching random fields

10 years 6 months ago
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 sensorfree navigation. Based on this algorithm, we design source seeking controllers for nonholonomic robots and prove conver
Shun-ichi Azuma, Mahmut Selman Sakar, George J. Pa
Added 13 May 2011
Updated 13 May 2011
Type Journal
Year 2010
Where CDC
Authors Shun-ichi Azuma, Mahmut Selman Sakar, George J. Pappas
Comments (0)
books