Distributed and robust tracking by exploiting set-membership and sarsity.
2011-07
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Distributed and robust tracking by exploiting set-membership and sarsity.
Authors
Published Date
2011-07
Publisher
Type
Thesis or Dissertation
Abstract
Target tracking research and development are of major importance and continuously expanding interest to a gamut of traditional and emerging applications, which include radar- and sonar-based systems, surveillance and habitat monitoring using distributed wireless sensors, collision avoidance modules envisioned for modern transportation systems, and mobile robot localization and navigation in static and dynamically changing environments, to name a few. This thesis contributes in several issues pertaining to robustness and distributed operation of modern tracking systems.
The first issue addressed relates to measurement model nonlinearity. It turns out that by adopting a grid to describe the surveillance region, the nonlinear measurement model can be cast as a linear one at the cost of increasing state dimensionality. However, by exploiting sparsity of the state in this higher dimension, novel approaches are developed for tracking target signal strengths on a grid (TSSG). In multi-target settings, the proposed sparsity-aware TSSG trackers can bypass the challenge of data association and do not require knowing the number of targets present. To obtain individual target tracks when needed, simple data association techniques are also introduced. Due to the independence of TSSG trackers from the data association stage, association errors do not influence TSSG tracking performance.
Mitigating the effect of outliers appearing in the state and measurements is the second topic addressed in this thesis. The proposed robust algorithm referred to as doubly robust smoother (DRS) jointly estimates the outliers alongside with the state. To enable such joint estimation, sparsity in the outlier domain is exploited by regularizing the adopted criterion with the $\ell_1$-norm of the outlier vector. Through novel methods for parameter tuning, DRS is capable of coping with even high levels of outlier contamination. To ensure low-complexity implementation, iterative coordinate descent and method-of-multipliers based solvers are derived for DRS. For settings where the state remains invariant or varies slowly with time, an online robust recursive least-squares (RLS) algorithm referred to as OR-RLS is also derived. Both DRS and OR-RLS are compared against existing robust alternatives and shown to significantly improve the performance.
Finally, a consensus-based distributed particle filter referred to as set-membership constrained particle filter (SMC-PF) is introduced for tracking with wireless sensor networks. Consensus-based algorithms possess well-known merits such as robustness to sensor and link failures, scalability, and only local message exchanges with one-hop neighbors. In addition, SMC-PF provides a consensus-based mechanism for data adaptation based on set-membership ideas. SMC-PF outperforms state-of-the-art distributed particle filters in terms of performance and communication complexity.
Description
University of MInnesota Ph.D. dissertatiom. July 2011. Major:Electrical Engineering. Advisor: Professor Georgios B. Giannakis. 1 computer file (PDF); xiii, 152 pages.
Related to
Replaces
License
Collections
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Farahmand, Shahrokh. (2011). Distributed and robust tracking by exploiting set-membership and sarsity.. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/113021.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.