Multi-step sensor selection with position uncertainty constraints

Research on localization systems has shifted from focusing mainly on accuracy towards a more cognitive design, accounting for communication constraints, energy limitations, and delay. This leads to a variety of sensor selection optimization problems that are solved using techniques from convex optimization. We provide a novel formulation of the sensor selection problem over an extended time horizon, aiming to minimize the sensing cost of an entire path while guaranteeing a certain position accuracy. We state algorithms for determining lower and upper bounds on the sensing cost and utilize these in a path selection problem for autonomous agents. Simulation results confirm the usefulness of our approach, where we observe a benefit of optimizing over longer time horizons in low to medium noise scenarios compared to a myopic sensor selection scheme.

[1]  Moe Z. Win,et al.  Cooperative Localization in Wireless Networks , 2009, Proceedings of the IEEE.

[2]  Roland Siegwart,et al.  Experience in system design for human-robot teaming in urban search & rescue , 2014 .

[3]  Pramod K. Varshney,et al.  Sensor Selection Based on Generalized Information Gain for Target Tracking in Large Sensor Networks , 2013, IEEE Transactions on Signal Processing.

[4]  Sebastian Thrun,et al.  Multi-robot SLAM with Sparse Extended Information Filers , 2003, ISRR.

[5]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[6]  Wei Zhang,et al.  On efficient sensor scheduling for linear dynamical systems , 2010, ACC 2010.

[7]  Wei Yu,et al.  An introduction to convex optimization for communications and signal processing , 2006, IEEE Journal on Selected Areas in Communications.

[8]  John W. Fisher,et al.  Approximate Dynamic Programming for Communication-Constrained Sensor Network Management , 2007, IEEE Transactions on Signal Processing.

[9]  Henk Wymeersch,et al.  On the Trade-Off Between Accuracy and Delay in Cooperative UWB Localization: Performance Bounds and Scaling Laws , 2014, IEEE Transactions on Wireless Communications.

[10]  D. Simon Optimal State Estimation: Kalman, H Infinity, and Nonlinear Approaches , 2006 .

[11]  Douglas L. Jones,et al.  Expected-utility-based sensor selection for state estimation , 2012, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[12]  Darryl Morrell,et al.  On the Use of Binary Programming for Sensor Scheduling , 2007, IEEE Transactions on Signal Processing.

[13]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[14]  Jonathan Fink,et al.  Communication for teams of networked robots , 2011 .

[15]  Marco F. Huber On multi-step sensor scheduling via convex optimization , 2010, 2010 2nd International Workshop on Cognitive Information Processing.

[16]  Haris Vikalo,et al.  Greedy sensor selection: Leveraging submodularity , 2010, 49th IEEE Conference on Decision and Control (CDC).

[17]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[18]  Stephen P. Boyd,et al.  Sensor Selection via Convex Optimization , 2009, IEEE Transactions on Signal Processing.

[19]  Deniz Erdogmus,et al.  The Future of Human-in-the-Loop Cyber-Physical Systems , 2013, Computer.