Papers
Topics
Authors
Recent
Search
2000 character limit reached

Nonlocal Nonholonomic Source Seeking Despite Local Extrema

Published 28 Mar 2023 in math.OC | (2303.16027v1)

Abstract: In this paper, we investigate the problem of source seeking with a unicycle in the presence of local extrema. Our study is motivated by the fact that most of the existing source seeking methods follow the gradient direction of the signal function and thus only lead to local convergence into a neighborhood of the nearest local extremum. So far, only a few studies present ideas on how to overcome local extrema in order to reach a global extremum. None of them apply to second-order (force- and torque-actuated) nonholonomic vehicles. We consider what is possibly the simplest conceivable algorithm for such vehicles, which employs a constant torque and a translational/surge force in proportion to an approximately differentiated measured signal. We show that the algorithm steers the unicycle through local extrema towards a global extremum. In contrast to the previous extremum-seeking studies, in our analysis we do not approximate the gradient of the objective function but of the objective function's local spatial average. Such a spatially averaged objective function is expected to have fewer critical points than the original objective function. Under suitable assumptions on the averaged objective function and on sufficiently strong translational damping, we show that the control law achieves practical uniform asymptotic stability and robustness to sufficiently weak measurement noise and disturbances to the force and torque inputs.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.