TY - GEN
T1 - NEW CONSTRAINED LEAST SQUARES APPROACH FOR RANGE-BASED POSITIONING
AU - Lin, Lanxin
AU - So, H. C.
PY - 2011/8
Y1 - 2011/8
N2 - The problem of finding the location of a target based on range measurements from an array of receivers is addressed. In the linear least squares (LLS) approach for range-based positioning, an extra range variable is usually introduced. In this paper, we derive a LLS algorithm with exploiting the known relation between the source position and range variable, which results in a simple constrained optimization problem. The optimality of the proposed algorithm at sufficiently small noise conditions is demonstrated by the theoretical analysis as well as computer simulations. © 2011 EURASIP.
AB - The problem of finding the location of a target based on range measurements from an array of receivers is addressed. In the linear least squares (LLS) approach for range-based positioning, an extra range variable is usually introduced. In this paper, we derive a LLS algorithm with exploiting the known relation between the source position and range variable, which results in a simple constrained optimization problem. The optimality of the proposed algorithm at sufficiently small noise conditions is demonstrated by the theoretical analysis as well as computer simulations. © 2011 EURASIP.
UR - https://www.scopus.com/pages/publications/84863729070
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84863729070&origin=recordpage
M3 - RGC 32 - Refereed conference paper (with host publication)
T3 - European Signal Processing Conference
SP - 1999
EP - 2003
BT - 2011 19th European Signal Processing Conference
PB - IEEE
T2 - 19th European Signal Processing Conference (EUSIPCO 2011)
Y2 - 29 August 2011 through 2 September 2011
ER -