Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Exploiting geometry for improved hybrid AOA/TDOA-based localization
Bishop A., Fidan B., Doğançay K., Anderson B., Pathirana P. Signal Processing88 (7):1775-1791,2008.Type:Article
Date Reviewed: Aug 28 2008

A localization algorithm based on the use of a hybrid approach is discussed in this paper. Bishop et al. suggest the use of both time difference of arrival (TDOA) and angle of arrival (AOA). This approach is based on the assumption that a number of sensors N exist (N being greater than or equal to two) that can each individually estimate both the azimuth bearing to a target and the time of signal arrival.

Section 1 presents a justification of why such an approach is promising, and may result in achieving both more reliable and more robust results. After that, the application of the algorithm in two-dimensional (2D) and three-dimensional (3D) cases is described. Some previous implementations of hybrid algorithms are discussed in Section 3. The main theoretical results related to the proposed algorithms (two theorems and a corollary) are formulated and proven in Section 4. A constrained optimization approach, applicable to both the 2D and 3D cases, is described in Section 5. Examples are given in Section 6. The results from the numerical experiments clearly show that the algorithm proposed by Bishop et al., called the geometrically constrained optimization approach, incorporating a weighted least squares cost function (GCLS), generally performs better than the other algorithms used in the comparisons; the text explains why this is so. Short conclusions are given in Section 7. Appropriate stopping criteria for the GCLS algorithm are derived in Appendix A.

This paper is well written, and the results proven may successfully be used in attempts to make the localization process both more accurate and more robust.

Reviewer:  Z. Zlatev Review #: CR136002 (0907-0676)
Bookmark and Share
  Featured Reviewer  
 
Constrained Optimization (G.1.6 ... )
 
 
Convergence And Stability (G.1.7 ... )
 
 
Geometrical Problems And Computations (F.2.2 ... )
 
 
Model Validation And Analysis (I.6.4 )
 
 
Nonnumerical Algorithms And Problems (F.2.2 )
 
 
Ordinary Differential Equations (G.1.7 )
 
  more  
Would you recommend this review?
yes
no
Other reviews under "Constrained Optimization": Date
Procedures for optimization problems with a mixture of bounds and general linear constraints
Gill P., Murray W., Saunders M., Wright M. (ed) ACM Transactions on Mathematical Software 10(3): 282-298, 1984. Type: Article
May 1 1985
Symmetric minimum-norm updates for use in Gibbs free energy calculations
Salane D. Mathematical Programming: Series A 36(2): 145-156, 1986. Type: Article
Jun 1 1988
Examination timetabling by computer
Laporte G., Desroches S. Computers and Operations Research 11(4): 351-360, 1984. Type: Article
Aug 1 1985
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy