A sensor reduction technique using Bellman optimal estimates of target agent dynamics

Reducing the number of sensors in a sensor network is of great interest for a variety of surveillance and target tracking scenarios. The time and resources needed to process the data from additional sensors can delay reaction time to immediate threats and consume extra financial resources. There are many methods to reduce the number of sensors by considering hardware capabilities alone. However, by incorporating an estimate of environment and agent dynamics, sensor reduction for a given scenario may be achieved using Bellman optimality principles. We propose a method that determines the capture regions where sensors can be eliminated. A capture region is defined as a section of the surveillance field, where using a causal relationship to the other sensors, an event may be determined using fast marching semi-Lagrangian (FMSL) solution techniques. This method is applied to a crowded hallway scenario with two possible exits, one primary, and one alternate. It is desired to determine if a target deviates from the crowd and moves toward the alternate exit. A proximity sensor grid is placed above the crowd to record the number of people that pass through the hallway. Our result shows that the Bellman optimal approximation of the capture set for the alternate exit identifies the region of the surveillance field where sensors are needed, allowing the others to be removed.

[1]  E. Zermelo Über das Navigationsproblem bei ruhender oder veränderlicher Windverteilung , 1931 .

[2]  P. Varaiya,et al.  Differential Games , 1994 .

[3]  Andrew Kurdila,et al.  A graph theoretical approach toward a switched feedback controller for pursuit-evasion scenarios , 2011, Proceedings of the 2011 American Control Conference.

[4]  Maurizio Falcone,et al.  A Fast Marching Method for Pursuit-Evasion Games , 2007 .

[5]  Jing Li,et al.  Voronoi-Based Coverage Optimization for Directional Sensor Networks , 2009, Wirel. Sens. Netw..

[6]  Anup Basu,et al.  Motion Tracking with an Active Camera , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Maurizio Falcone,et al.  Numerical Methods for differential Games Based on Partial differential equations , 2006, IGTR.

[8]  Thomas A. Wettergren,et al.  Optimal placement of distributed sensors against moving targets , 2009, TOSN.

[9]  J. O'Rourke Art gallery theorems and algorithms , 1987 .

[10]  Krishnendu Chakrabarty,et al.  Sensor placement for effective coverage and surveillance in distributed sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[11]  Ru-chuan Wang,et al.  Voronoi Based Area Coverage Optimization for Directional Sensor Networks , 2009, 2009 Second International Symposium on Electronic Commerce and Security.

[12]  Andreas Krause,et al.  Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies , 2008, J. Mach. Learn. Res..

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

[14]  Brian J. Goode,et al.  Sensor reduction technique using Bellman optimal estimates of target agent dynamics , 2012 .

[15]  Samuel R. Barrett Optimizing Sensor Placement for Intruder Detection with Genetic Algorithms , 2007, 2007 IEEE Intelligence and Security Informatics.

[16]  S. Sitharama Iyengar,et al.  Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks , 2002, IEEE Trans. Computers.

[17]  P. Saint-Pierre,et al.  Optimal times for constrained nonlinear control problems without local controllability , 1997 .

[18]  Brian J. Goode,et al.  A Partitioning Scheme for a Switched Feedback Control Law in Two Agent Pursuit-Evasion Scenarios , 2012 .

[19]  Parameswaran Ramanathan,et al.  Sensor deployment strategy for target detection , 2002, WSNA '02.