Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 13

GPS

(Least Squares Method)

(Chebyshev Circle)

(Semidefinite Relaxation)

GPS

Commented [1]: 3.1


1.1

(Time of Arrival, TOA)

GPS

3.1
3.1 GPS

(Pseudorange)

(Carrier Phase)

PRN(Pseudo-Random Noise) PRN

(Delay

Lock Loop)(Pseudorange) 3.2

3.2

s :

s c (3.1)

s m c 299792459 m s s

(3.1)

(3.1):

Pi s s c dti dt s (3.2)

Pi s m dti s dt s s
GPS

(relativity)(3.2)

Pi s s c dti dt s Ti s I is v p (3.3)

Pi s m s m c 299792459 m s dti

s dt s s Ti s m I is

m m v p

GPS xu , yu , zu s

x s , y s , z s s :

x xu y s yu z s zu (3.4)
2 2 2
s s

(3.4)(3.3):

Pi s s c dti dt s Ti s I is v p (3.5)
(3.5)

x0 , y0 , z0

x s x0 y s y0 z s z0
Pi s 0 x y z c dti dt s Ti s I is v p (3.7)
0 0 0

x x0 y s y0 z s z0
2 2 2
0 s

(3.7):

x

x x0
s
y y0 s
z z0 y
s

1 Pi s 0 cdt s Ti s I is v p (3.8)
0 0 0 z

cdti

m bs Pi s 0 cdt s Ti s Iis v p (3.8)

:
x1 x0 y 1 y0 z1 z0
1
0 0 0 x b1
x2 x y y0
2
z z0
2
0
1 y b 2
0 0 (3.9)
0 z

cdti b m
x m x0 y m y0 z m z0

0

0
1
0

x1 x0 y1 y0 z1 z0
1
0 0 0 x b1
x2 x y 2 y0 z 2 z0 y 2
0
1
b b
G 0 0 0 x
z

cdti b m
x m x0 y m y0 z m z0

0

0
1
0

x :

x GT G GT b (3.10)
1

x m 4 G (rank-deficient)

x :

xu , yu , zu x0 x, y0 y, z0 z (3.11)
xu , yu , zu

1.2

(Time Difference of Arrivals, TDOA)

GPS

x xu , yu , zu :

1 1
zi1 zi z1 x si x s1 vi1 , i 2,..., N (3.12)
c c

si , vi1 vi v1 2rt , 2rt , rt (a priori), c

299792459 m s

(feasible region)


Cx x : di1 x si x s1 di1 , i 2,...., N (3.13)

di1 c zi1 2rt , di1 c zi1 2rt


y (3.13):


min max y x
x yC


C y : di1 y si y s1 di1 , i 2,...., N (3.14)

xc
3.3


xCheby arg min max y x (3.15)
x yC
3.3

1.3

NP-hard(Non-deterministic

polynomial-time hard)

C3 xc v v (3.16)

y :

y xc u , || u || (3.17)

(3.14):
minimize
xc , y

subject to y xc u , || u ||

d i1 y si y s1 di1 , i 2,..., N (3.18)

(3.18):

d
2 2
y s1 y si di1 y s1 (3.19)
2
i1

d1 y s1 , yT y , d s d12 (3.19):

2siT y d s 2di1d1 siT si di1 0 (3.20)


2

2
2siT y d s 2di1d1 siT si di1 0 (3.21)

(3.20)(3.21)(3.18):

minimize
xc , y, , d1 , d s , u

subject to y xc u , || u ||

2siT y d s 2di1d1 siT si di1 0


2

2
2siT y d s 2di1d1 siT si di1 0
i 2,..., N

d s 2s1T y s1T s1

yT y , d s d12 (3.22)

yT y , d s d12 (3.22)

r y T y , d sr d12 (3.23)

(3.23):

I3 y 1 d1
yT 0, 0 (3.24)
r d1 d sr

(3.22) || u || :

I 3 u
uT 0 , 0 (3.25)

:

minimize
xc , y, r , d1 , d sr , u
subject to y xc u

I u
T3 0 , 0
u

r 2siT y d sr 2di1d1 siT si di1 0


2

2
r 2siT y d sr 2di1d1 siT si di1 0

i 2,..., N

d sr r 2s1T y s1T s1

I y 1 d1
3T 0, 0 (3.26)
y r d1 d sr

1.4 GPS

GPS

(3.26):

minimize
xc , r , d sr , u
subject to y xc u

I u
T3 0 , 0
u

r 2siT y dsr 2di e de siT si di e 0


2

2
r 2siT y dsr 2di e de siT si di e 0

i 2 , ... , N

d sr r 2seT y seT se

I y 1 de
3T 0, 0 (3.27)
y

r de d sr

y, s , d , d
i e ie , di e e

y (3.11) x si d e y se

di e , di e (3.13)

(3.27)

SeDuMiSDPT3yalmip CVX

You might also like