Search arXivSearch

arXiv · 0905.4305

Circumnavigation Using Distance Measurements (Extended Version)

Abstract

Consider a stationary agent A at an unknown location and a mobile agent B that must move to the vicinity of and then circumnavigate A at a prescribed distance from A. In doing so, B can only measure its distance from A, and knows its own position in some reference frame. This paper considers this problem, which has applications to surveillance or maintaining an orbit. In many of these applications it is difficult for B to directly sense the location of A, e.g. when all that B can sense is the intensity of a signal emitted by A. This intensity does, however provide a measure of the distance. We propose a nonlinear periodic continuous time control law that achieves the objective. Fundamentally, B must exploit its motion to estimate the location of A, and use its best instantaneous estimate of where A resides, to move itself to achieve the ultimate circumnavigation objective. The control law we propose marries these dual goals and is globally exponentially convergent. We show through simulations that it also permits B to approximately achieve this objective when A experiences slow, persistent and potentially nontrivial drift.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Iman Shames, Soura Dasgupta, Baris Fidan, Brian. D. O. Anderson. 2009-05-27. Circumnavigation Using Distance Measurements (Extended Version). https://arxiv.org/abs/0905.4305

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS