pith. sign in

arxiv: 1502.02224 · v1 · pith:7ULKZAEUnew · submitted 2015-02-08 · 🧮 math.OC

Proofs of the Technical Results Justifying an Algorithm of Extremum Seeking Navigation in Dynamic Environmental Fields

classification 🧮 math.OC
keywords fieldrobotlocationalgorithmcontrolgradientnavigationproofs
0
0 comments X
read the original abstract

We consider a single kinematically controlled robot with a bounded control range. The robot travels in a two-dimensional region supporting an unknown unsteady scalar field. A single sensor provides the field value at the current location of the robot. The paper is concerned with a reactive navigation strategy to drive the robot to the time-varying location where the field attains its spatial maximum, with subsequent keeping the robot close to this location. This strategy is based on a novel paradigm of kinematic control different from conventionally trying to align the velocity vector with the field gradient, does not employ estimation of the entire field gradient or derivative-dependent quantities, like the rate at which the available field reading evolves over time, and is non-demanding with respect to both computation and motion. The paper presents the proofs of the technical facts required to justify convergence of the proposed algorithm.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.