2,143 research outputs found
Sensor Management for Tracking in Sensor Networks
We study the problem of tracking an object moving through a network of
wireless sensors. In order to conserve energy, the sensors may be put into a
sleep mode with a timer that determines their sleep duration. It is assumed
that an asleep sensor cannot be communicated with or woken up, and hence the
sleep duration needs to be determined at the time the sensor goes to sleep
based on all the information available to the sensor. Having sleeping sensors
in the network could result in degraded tracking performance, therefore, there
is a tradeoff between energy usage and tracking performance. We design sleeping
policies that attempt to optimize this tradeoff and characterize their
performance. As an extension to our previous work in this area [1], we consider
generalized models for object movement, object sensing, and tracking cost. For
discrete state spaces and continuous Gaussian observations, we derive a lower
bound on the optimal energy-tracking tradeoff. It is shown that in the low
tracking error regime, the generated policies approach the derived lower bound
Stochastic Sensor Scheduling via Distributed Convex Optimization
In this paper, we propose a stochastic scheduling strategy for estimating the
states of N discrete-time linear time invariant (DTLTI) dynamic systems, where
only one system can be observed by the sensor at each time instant due to
practical resource constraints. The idea of our stochastic strategy is that a
system is randomly selected for observation at each time instant according to a
pre-assigned probability distribution. We aim to find the optimal pre-assigned
probability in order to minimize the maximal estimate error covariance among
dynamic systems. We first show that under mild conditions, the stochastic
scheduling problem gives an upper bound on the performance of the optimal
sensor selection problem, notoriously difficult to solve. We next relax the
stochastic scheduling problem into a tractable suboptimal quasi-convex form. We
then show that the new problem can be decomposed into coupled small convex
optimization problems, and it can be solved in a distributed fashion. Finally,
for scheduling implementation, we propose centralized and distributed
deterministic scheduling strategies based on the optimal stochastic solution
and provide simulation examples.Comment: Proof errors and typos are fixed. One section is removed from last
versio
Information Acquisition with Sensing Robots: Algorithms and Error Bounds
Utilizing the capabilities of configurable sensing systems requires
addressing difficult information gathering problems. Near-optimal approaches
exist for sensing systems without internal states. However, when it comes to
optimizing the trajectories of mobile sensors the solutions are often greedy
and rarely provide performance guarantees. Notably, under linear Gaussian
assumptions, the problem becomes deterministic and can be solved off-line.
Approaches based on submodularity have been applied by ignoring the sensor
dynamics and greedily selecting informative locations in the environment. This
paper presents a non-greedy algorithm with suboptimality guarantees, which does
not rely on submodularity and takes the sensor dynamics into account. Our
method performs provably better than the widely used greedy one. Coupled with
linearization and model predictive control, it can be used to generate adaptive
policies for mobile sensors with non-linear sensing models. Applications in gas
concentration mapping and target tracking are presented.Comment: 9 pages (two-column); 2 figures; Manuscript submitted to the 2014
IEEE International Conference on Robotics and Automatio
- …