5 research outputs found
Multi-Bernoulli Sensor-Control via Minimization of Expected Estimation Errors
This paper presents a sensor-control method for choosing the best next state
of the sensor(s), that provide(s) accurate estimation results in a multi-target
tracking application. The proposed solution is formulated for a multi-Bernoulli
filter and works via minimization of a new estimation error-based cost
function. Simulation results demonstrate that the proposed method can
outperform the state-of-the-art methods in terms of computation time and
robustness to clutter while delivering similar accuracy
Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey
Wireless sensor networks (WSNs) consist of autonomous and resource-limited
devices. The devices cooperate to monitor one or more physical phenomena within
an area of interest. WSNs operate as stochastic systems because of randomness
in the monitored environments. For long service time and low maintenance cost,
WSNs require adaptive and robust methods to address data exchange, topology
formulation, resource and power optimization, sensing coverage and object
detection, and security challenges. In these problems, sensor nodes are to make
optimized decisions from a set of accessible strategies to achieve design
goals. This survey reviews numerous applications of the Markov decision process
(MDP) framework, a powerful decision-making tool to develop adaptive algorithms
and protocols for WSNs. Furthermore, various solution methods are discussed and
compared to serve as a guide for using MDPs in WSNs
Random Set Tracker Experiment on a Road Constrained Network with Resource Management
Abstract -This paper describes the application of finite set statistics (FISST) to real-time multiple target road constrained tracking problems. We studied specific test problems where multiple modality wireless sensor networks monitored road networks of interest. Acoustic and radar detections updated a global density that tracked the number and positions of targets. The global density determines "information states" that form the basis of a closed-loop Markov Decision Process resource management procedure that controls sensor operation
Markov decision processes with applications in wireless sensor networks: A survey
Ministry of Education, Singapore under its Academic Research Funding Tier
Sensor management for multi-target tracking using random finite sets
Sensor management in multi-target tracking is commonly focused on actively scheduling and managing sensor resources to maximize the visibility of states of a set of maneuvering targets in a surveillance area. This project focuses on two types of sensor management techniques: - controlling a set of mobile sensors (sensor control), and - scheduling the resources of a sensor network (sensor selection).​ In both cases, agile sensors are employed to track an unknown number of targets. We advocate a Random Finite Set (RFS)-based approach for formulation of a sensor control/selection technique for multi-target tracking problem. Sensor control/scheduling offers a multi-target state estimate that is expected to be substantially more accurate than the classical tracking methods without sensor management. Searching for optimal sensor state or command in the relevant space is carried out by a decision-making mechanism based on maximizing the utility of receiving measurements.​ In current solutions of sensor management problem, the information of the clutter rate and uncertainty in sensor Field of View (FoV) are assumed to be known in priori. However, accurate measures of these parameters are usually not available in practical situations. This project presents a new sensor management solution that is designed to work within a RFS-based multi-target tracking framework. Our solution does not require any prior knowledge of the clutter distribution nor the probability of detection profile to achieve similar accuracy. Also, we present a new sensor management method for multi-object filtering via maximizing the state estimation confidence. Confidence of an estimation is quantified by measuring the dispersion of the multi-object posterior about its statistical mean using Optimal Sub-Pattern Assignment (OSPA). The proposed method is generic and the presented algorithm can be used with any statistical filter