Discrete time extremum seeking by autonomous vehicles in a stochastic environment

Miloş S. Stanković, Duşan M. Stipanović

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, discrete time extremum seeking algorithms with sinusoidal perturbations have been developed for three different problems involving autonomous vehicle planar control: a) control of velocity actuated vehicles; b) control of force actuated vehicles; c) control of nonholonomic vehicles (unicycles). The algorithms assume time varying gains and are able to cope with stochastic perturbations. Convergence to the extremal point, with probability one, has been demonstrated for all three cases. It is also shown how the proposed algorithms can be applied to mobile sensors as a tool for achieving optimal observation positions. The proposed algorithms have been illustrated with several simulations.

Original languageEnglish (US)
Title of host publicationProceedings of the 48th IEEE Conference on Decision and Control held jointly with 2009 28th Chinese Control Conference, CDC/CCC 2009
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages4541-4546
Number of pages6
ISBN (Print)9781424438716
DOIs
StatePublished - 2009
Event48th IEEE Conference on Decision and Control held jointly with 2009 28th Chinese Control Conference, CDC/CCC 2009 - Shanghai, China
Duration: Dec 15 2009Dec 18 2009

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0743-1546
ISSN (Electronic)2576-2370

Other

Other48th IEEE Conference on Decision and Control held jointly with 2009 28th Chinese Control Conference, CDC/CCC 2009
Country/TerritoryChina
CityShanghai
Period12/15/0912/18/09

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Fingerprint

Dive into the research topics of 'Discrete time extremum seeking by autonomous vehicles in a stochastic environment'. Together they form a unique fingerprint.

Cite this