Publication

Nonholonomic source seeking in switching random fields

Mahmut Selman Sakar
2010
Conference paper
Abstract

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.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.