Escolar Documentos
Profissional Documentos
Cultura Documentos
INTRODUCTION
120 IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS VOL. 46, NO. 1 JANUARY 2010
Authorized licensd use limted to: IE Xplore. Downlade on May 13,20 at 1:534 UTC from IE Xplore. Restricon aply.
of the relative position of the UAVs and the target.
In addition the solution proposed in [25] provides an
optimal set of UAV positions, but no path planning for
the UAVs or any guarantees that it is possible for the
dynamically constrained UAVs to reach the resulting
positions in the allotted time.
In this work, we assume a multistatic radar
scenario in which a transmitter, either airborne or on
the ground, illuminates a target with a radar signal.
A team of UAVs receives the target reflection, and Fig. 1. Multiple UAVs tracking single target.
each UAV makes a local time-delay and Doppler
measurement. These measurements are then sent
to a centralized processor or base which uses this The UAVs are assumed to be capable of velocity
collected data set to track the targets position and and altitude hold with an autopilot such as the one
velocity. Based on the calculated accuracy of the described in [26]. Therefore, for simplicity, we
tracking algorithm, the base determines trajectories consider only a two-dimensional scenario. We define
for the UAV team in order to optimize performance the position of the base station as the origin for our
and sends heading commands to the UAVs to (x, y) coordinate system where x and y correspond to
best position them for the next measurement. The the cardinal directions East and North, respectively.
maneuverability of the UAVs provides the base with Let x, y, Vx , and Vy represent, respectively, the position
the ability to improve tracking performance through of the target and the components of the target velocity
the tunable parameters in the tracking algorithm. vector in the (x, y) directions. Similarly, let xi and yi
We present two general optimization algorithms denote the position of the ith UAV, and assume that
for the problem, and a closed-form solution that each UAV is flying at the same constant speed V, with
is considerably simpler to implement but performs heading angle i measured counterclockwise from
essentially as well as the optimal approaches in many the x axis. According to [27] and after appropriate
situations. scaling, the time-delay and Doppler measurements can
The format of the paper is as follows: In be written as
q
Section II we describe the problem setup, the 1 p 2
assumed dynamic models, and relevant aspects i = x + y 2 + (x xi )2 + (y yi )2 (1)
c
of the extended Kalman filter (EKF). The issue !
of range-dependent measurement accuracy is also 1 Vx x + Vy y Vp
addressed. In Section IIIA and IIIB, two algorithms fi = p +p (2)
x2 + y 2 (x xi )2 + (y yi )2
for determining the optimal UAV heading angles
based on the EKF updates are presented. A more where
computationally efficient approach is described in
Section IIIC, based on heuristic observations of one of Vp = (Vx V cos i )(x xi ) + (Vy V sin i )(y yi ):
the algorithms in simple scenarios. Simulation results In the above equation, c and stand for the speed of
are presented in Section IV, and some conclusions are light and the wavelength of the signal, respectively.
drawn in Section V. The problem we address in this paper is how
the mobility of the UAV receivers can be exploited
II. BACKGROUND AND SYSTEM DEFINITION to improve the systems tracking performance. In
our solution to this problem, the time-delay and
A. Problem Statement Doppler estimates collected by the UAV team are
uploaded to the base and used as measurement
As illustrated in Fig. 1, we consider a multistatic updates in an EKF tracking the target. Simultaneously
radar problem in which a set of N UAVs receives the optimal heading commands for each UAV are
signal reflected by an airborne target illuminated by a calculated at the base station and then transmitted to
base transmitter. We assume that the UAVs are able to the agents. The precise optimality criteria used for
form time delay (i ) and Doppler (fi ) estimates based computing the heading commands is presented in
on these signals,1 and transmit these measurements Section III.
back to the base.
B. UAV Receivers and Measurement Error
1 Another viable model would be to use the time difference
of arrival rather than time delay. Using this model the control
The accuracy of the UAV measurements is a
algorithms developed later would remain unchanged since the function of the transmitted radar signal, the signal
observation Jacobians with respect to target parameters are identical strength, the length of the propagation path from
under both models. transmitter to receiver, and so on. To quantify the
ZHAN ET AL.: ADAPTIVE MOBILE SENSOR POSITIONING FOR MULTI-STATIC TARGET TRACKING 121
Authorized licensd use limted to: IE Xplore. Downlade on May 13,20 at 1:534 UTC from IE Xplore. Restricon aply.
We represent the target state vector at time k as
xk = [x y Vx Vy ]T , and define the vector hk (xk ) by
arranging the time-delay and Doppler equations from
each UAV as
hk (xk ) =[1 N f1 fN ]T
122 IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS VOL. 46, NO. 1 JANUARY 2010
Authorized licensd use limted to: IE Xplore. Downlade on May 13,20 at 1:534 UTC from IE Xplore. Restricon aply.
where t is the time interval between samples. We nonlinearities are accounted for through the Jacobian
also use a simple white process noise model: Hk in the EKF.
ZHAN ET AL.: ADAPTIVE MOBILE SENSOR POSITIONING FOR MULTI-STATIC TARGET TRACKING 123
Authorized licensd use limted to: IE Xplore. Downlade on May 13,20 at 1:534 UTC from IE Xplore. Restricon aply.
function. For higher dimensional problems, we the covariance measurement update in (11), yielding
employ a Quasi-Newton approach to minimize (18).
P1 1
k = (Pk ) + HTk R1
k Hk (20)
At each iteration the heading is updated by m+1 =
m S1 1
m gm , where Sm and gm are the Hessian matrix where P1k is the information matrix at step k. The
and gradient vector of the cost function evaluated at T 1
term Hk Rk Hk represents the increase in information
m . Due to the complexity involved in calculating the provided by the UAVs, assuming that their headings
Hessian matrix, the Quasi-Newton approach uses an are chosen to yield Hk . If the UAVs provided no
estimate of the Hessian based on the gradient vector. new information at step k, then HTk R1k Hk = 0, and
The gradient with respect to the heading of the ith the information matrix would be equal to its value
UAV at time k is given by after k 1 steps: P1 1
k = (Pk ) . The idea, then, is to
T 1
@tr(Wk P k+1 ) @B 1 T choose Hk so that Hk Rk Hk is maximized in some
= tr Wk Ak+1 B1 B Ak+1 sense. This approach makes sense intuitively: one can
@i,k @i,k
think of this as choosing a set of vectors Hk that lie as
(19) much as possible in the eigenvector space of R1 k with
where the largest eigenvalues (or, equivalently, in the space
B = (P 1
+ HTk R1 of eigenvectors of Rk with the smallest eigenvalues).
k) k Hk
In other words, we try to position the UAVs so that
T the new information that they provide is corrupted the
@B @HTk 1 @HTk 1
= R H + R H least by the measurement noise. Since Hk enters into
@i,k @i,k k k @i,k k k
this term quadratically, an analysis of the impact of
@Rk 1 the UAV headings is much simpler. As discussed in
HTk R1 R H:
k
@i,k k k the next section, this allows for the development of an
efficient algorithm for computing the optimal heading
The problem boils down to calculating @Hk =@i,k and commands.
@Rk =@i,k , where Hk is 2N 4 and Rk is 2N 2N. Under the maximizing information increase (MII)
Minimizing the cost function (17) over the correct approach, the heading commands are found by solving
control variable will work generally for any adaptive
sensor network. The weighting matrix Wk is helpful k = arg max det(HTk R1
k Hk )
k
in that is can be used to place importance on specific (21)
variables of interest. In our problem the magnitude for ji,k i,k1 j C 8 i = 1 : : : N:
position values was much greater than the velocity,
and by adjusting the elements of Wk , we were able to Assuming that the measurement errors across the
place suitable errors on each of these terms. UAVs are uncorrelated, and after regrouping the
time-delay and Doppler equation vector as hk (xk ) =
[1 f1 N fN ]T , the covariance matrix Rk will have
B. Maximizing Information Increase a block diagonal structure. Each block along the
We investigate here an alternative approach diagonal is denoted by Rik , which is equivalent to the
derived from examining an expression for the Fisher CRB matrix discussed in Section IIB. More algebraic
information matrix (or inverse covariance matrix). manipulation leads to the following equality:
Our motivation is to find an algorithm for determining
N
X
the UAV headings that is computationally simpler to 'k = HTk R1
k Hk = HiT i 1 i
k (Rk ) Hk
implement than the error covariance minimization i=1 (22)
(ECM) method of the previous section. As we will HTk = [H1T NT
k : : : Hk ]:
see, the UAV heading parameters enter into the
information matrix update in a much simpler way The submatrices, Hik , which constitute the
that lends itself more easily to approximation. A measurement gradient matrix, HTk , are defined in (34)
closed-form solution based on such an approximation of the Appendix.
is presented in the next section. A computationally By maximizing the new information (21), the
efficient optimization method was found in [9] sensors will position themselves such that the next
for a similar application that used the trace of the measurement contains the most information possible.
covariance matrix, but it was for a much simpler Notice that this cost metric does not necessarily try to
measurement model than assumed here. gain new information that is less known to the system.
Rather than optimizing over the information matrix It simply tries to find the measurements with the
itself, in our approach we choose the UAV headings most information. This metric is perhaps not optimal,
so that the increase in information provided by the but as shown in the results section, it yields good
UAVs at the new locations is maximized [2, 35]. More performance results. Again because of the simple form
precisely, note that the information matrix update can the cost function (21), it allows a closed-form solution
be found by applying the matrix inversion lemma to which is presented in the following section.
124 IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS VOL. 46, NO. 1 JANUARY 2010
Authorized licensd use limted to: IE Xplore. Downlade on May 13,20 at 1:534 UTC from IE Xplore. Restricon aply.
C. Approximate Closed-Form Solution IV. SIMULATION RESULTS
ZHAN ET AL.: ADAPTIVE MOBILE SENSOR POSITIONING FOR MULTI-STATIC TARGET TRACKING 125
Authorized licensd use limted to: IE Xplore. Downlade on May 13,20 at 1:534 UTC from IE Xplore. Restricon aply.
In the following simulations, we simulate a simple
scenario involving 2 UAVs tracking a moving target.
We assume an average transmit power of 15 W at
the base station (BS) located at the origin, a carrier
frequency of f0 = 10 GHz, number of transmitted
pulses Np = 31, an IPP of T = 1 ms, receive noise
figure F = 5 dB, noise reference temperature T0 =
290 K, and Gaussian pulse parameter = 105 Hz. The
algorithm updates its estimate once every second, and
the heading change constraint C in (17) is set to be
=9.
The initial coordinates of the UAVs were assumed
to be (10, 20) km and (10, 10) km. Both of the Fig. 3. Trajectories of UAVs and target using ECM. A *
UAVs are given initial headings of 0 , and the marker has been placed on each trajectory every 300 s to help
simulation was run for p 1500 s. The UAVs move visualize time evolution.
with constant speed 80 2 m/s. The targets initial
location and speed were (0, 50) km and 100 m/s,
respectively. Its initial heading was randomly created
for each simulation, and in the results presented below
it was about 85 . The targets RCS is assumed
to be b = 100 m2 , and its trajectory is generated
according to (6). For the Kalman filter we set the
initial state estimate to be the true target location
and the covariance matrix associated with the initial
position to be the identity matrix. The process
covariance matrix was set to be Qk = diag(50, 50, 3, 3),
and the time-varying measurement covariance matrix
Rk was generated according to the model described
in Section IID. The antenna gains at the BS side and
the UAV side were assumed to be 40 dB and 30 dB Fig. 4. UAV headings with control using ECM.
respectively.
B. Results
We present results for five simulations involving a
two-agent UAV team tracking a maneuvering target,
one simulation each for the ECM approach of (17),
MII according to (21), the approximate solution of
the previous section, random UAV headings, and
as a comparison, a scenario involving fixed sensor
positions.
In Figs. 35, we plot the performance of the
error covariance minimization approach of (17). The
trajectories of each UAV and the target are shown in
Fig. 3; the starting postions are denoted by crosses Fig. 5. Norm of tracking error using ECM.
(likewise for all subsequent trajectory plots). The
heading angles for each UAV are plotted in Fig. 4. Figs. 911 show the results obtained by the
The UAVs generally tend to follow the target due simplified solution presented in the previous
to the systems desire to increase the SNR (reduce section. As observed, the UAV team behaves almost
path loss), while at the same time spreading out in identically to the MII approach, which shows the
order to improve resolution of the target position and approximation and decoupling work well for this
dynamics. Fig. 5 shows the norm of one run of the scenario regardless of the small number of samples
actual tracking error for both the position and velocity used for the sinusoidal approximation (L = 10 as
estimates. Similar results are shown for the MII mentioned in Section IIIC). The simulation run time
algorithm in Figs. 68. The motion of the UAVs for in Matlab on a 2.16 GHz Intel Core 2 Duo processor
both algorithms is very similar, and both approaches shows that the MIA method is at least 20 times faster
provide similar tracking error performance. than the brute force MII algorithm for this specific
126 IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS VOL. 46, NO. 1 JANUARY 2010
Authorized licensd use limted to: IE Xplore. Downlade on May 13,20 at 1:534 UTC from IE Xplore. Restricon aply.
Fig. 6. Trajectories of UAVs and target using MII. A * marker Fig. 9. Trajectories of UAVs and target using MIA. A *
has been placed on each trajectory every 300 s to help visualize marker has been placed on each trajectory every 300 s to help
time evolution. visualize time evolution.
Fig. 7. UAV headings with control using MII. Fig. 10. UAV headings using MIA.
Fig. 8. Norm of tracking error using MII. Fig. 11. Norm of tracking error using MIA.
case. The tracking error of all of the above algorithms like an antenna element in an adaptive, reconfigurable
is considerably better than that obtained using random array. Clearly, the use of closed-loop heading control
UAV motion (subject to the given turning constraint) significantly reduces the tracking error by arranging
as illustrated in Figs. 1213. Fig. 14 shows the norm the UAVs into a more optimal orientation.
of the actual tracking error for one run of a scenario It is clear from the examples above that there
with sensors fixed at the initial UAV locations. Much are two competing factors that drive the behavior
larger tracking errors are observed in this case. This of the mobile UAV sensors: 1) the desire to reduce
is due to the relatively small sensor aperture and poor the range to the target in order to keep the received
orientation. Here the aperture and orientation refer to signal power from becoming too small, and 2) the
the conglomerate UAV network, where each UAV acts need for the sensors to spread out and provide a
ZHAN ET AL.: ADAPTIVE MOBILE SENSOR POSITIONING FOR MULTI-STATIC TARGET TRACKING 127
Authorized licensd use limted to: IE Xplore. Downlade on May 13,20 at 1:534 UTC from IE Xplore. Restricon aply.
step ahead. An approach that attempted to predict the
target location at some time farther in the future may
be able to sacrifice a short-term performance gain for
a smaller long-term tracking error. This is the subject
of ongoing research.
V. CONCLUSIONS
APPENDIX
A. Time-Delay Approximation
Fig. 13. Norm of tracking error with random headings. Recalling the delay expression (1) and the UAV
dynamic model in (15)(16), we can rewrite the
time-delay measurement at the ith UAV at time t = k
as
q q
1
k (i) = xk2 + yk2 + (xk xi,k )2 + (yk yi,k )2
c
q q
1
= xk2 + yk2 + 2
ri,k 2ri,k Vt cos(i,k i,k ) + V2 2t
c
q (30)
ri,k = (xk xi,k1 )2 + (yk yi,k1 )2
yk yi,k1
i,k = arctan :
xk xi,k1
128 IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS VOL. 46, NO. 1 JANUARY 2010
Authorized licensd use limted to: IE Xplore. Downlade on May 13,20 at 1:534 UTC from IE Xplore. Restricon aply.
B. Doppler Shift Approximation assumptions
Inserting the UAV dynamic model (15)(16) into ri,k Vt , ri,k V, ri,k VT (35)
the Doppler measurement model (2) yields q
C where VT = Vx2 + Vy2 , each entry in Hik (except the
fk (i) = 1 f(xi,k1 t Vx xk )V cos i,k
zero terms) can be approximated by a constant plus a
+ (yi,k1 t Vy yk )V sin i,k + C2 g sinusoid with a relatively small amplitude. Assuming
t is small, the second assumption ri,k V includes
Vx xk + Vy yk
+ q (32) the previous cases ri,k Vt and ri,k 2Vt . Then
xk2 + yk2 the two assumptions ri,k V and ri,k VT state,
respectively, that the speed of the UAV and the speed
where of the target must be much smaller than the range of
s the target from the UAV. This ensures that over short
2Vt V2 2 time spans, the bearing angle from the UAV to the
C11 = ri,k 1 cos(i,k i,k ) + 2 t
ri,k ri,k target changes slowly.
From Section IID, we recall that Rik is a constant
and
matrix scaled by N0 (N0 + Er )=2Er2 . When the
C2 = V2 t + Vx (xk xi,k1 ) + Vy (yk yi,k1 ): SNR is not too small, i.e., Er N0 , (Rik )1 can
be approximated as a constant matrix scaled by
Again using the fact that ri,k 2Vt , we have C11 2 SNR. Since Er is inversely proportional to the
ri,k , and hence square of ri,k Vt cos(i,k i,k ), a first-order Taylor
expansion around ri,k can be used to show that the
fk (i) Fi,k Gi,k cos(i,k i,k ) (33) SNR can be approximated as a sinusoid that is again
where offset by a bias term much larger in magnitude. Let
i 1 i
Vx xk + Vy yk 'i,k = HiT
k (Rk ) Hk . Each entry of 'i,k is the product
C
Fi,k = q + 2 of three sinusoids with identical harmonics (i,k ) and
xk2 + yk2 ri,k differing phases plus bias terms that are large relative
V to the magnitude of the sinusoids. Thus the (j, l) entry
Gi,k = [(t Vx + (xk xi,k1 ))2 of 'i,k can be approximated as follows:
ri,k
+ (t Vy + (yk yi,k1 ))2 ]1=2 3
X
'i,k (j, l) aim,k (j, l) sin(m i,k + m (j, l))
and m=1
t Vy + (yk yi,k1 )
i,k = arctan : + bki (j, l) (36)
t Vx + (xk xi,k1 )
As in the case of the time delay, the Doppler shift aip,k (j, l) aiq,k (j, l), if p < q
measurement is also approximately a sinusoidal bki (j, l) aim,k (j, l), 1 m 3:
function of i,k .
In other words, each entry of 'i,k can be characterized
C. Cost Function Approximation as the sum of three harmonics and a large bias,
where the bias is large with respect to the magnitude
Maximizing jAT T 1 1
k+1 Hk Rk Hk Ak+1 j is equivalent to of the three harmonic
P components. Since the cost
maximizing jHTk R1 T 1
k Hk j when both Ak and Hk Rk Hk
function 'k = N i=1 i,k and the determinant of 'k
'
i
are full rank. In (22), each Hk is a 2 4 matrix with involve further products and sums of its elements,
the following structure: coupling between the different UAVs headings
2 i 3 will be introduced. However, due to the relationship
@k @ki
0 0 in (36), the coupling is relatively small compared
6 @xk @yk 7 with the effect of the bias term and the sum of
6 7
Hik = 6 7: (34)
4 @f i @f i @f i @f i 5 first-order sinusoidal terms, where the first-order
k k k k
terms are dependent on only one UAV heading i,k .
@xk @yk @Vx,k @Vy,k
This observation leads to the idea of decoupling
It is easily seen that the gradient of the time delay the N-dimensional optimization problem into N
with respect to the targets position equals the gradient one-dimensional optimization problems. The cost
of the Doppler with respect to the targets velocity function j'k j will produce sinusoidal harmonics up
(i.e., @fki =@Vx,k = @ki =@xk and @fki =@Vy,k = @ki =@yk ). to the twelfth order, but due to the observation in (36),
Using the time-delay and Doppler approximations only harmonics up to the second order are required
given in the previous two sections and under the for sufficient accuracy. Thus, the criterion can be
ZHAN ET AL.: ADAPTIVE MOBILE SENSOR POSITIONING FOR MULTI-STATIC TARGET TRACKING 129
Authorized licensd use limted to: IE Xplore. Downlade on May 13,20 at 1:534 UTC from IE Xplore. Restricon aply.
written in the following general form: [9] Zhou, K., and Roumeliotis, S.
Optimal motion strategies for range-only distributed target
tracking.
k
J(i,k ) = ki,1 sin(i,k + i,1 )
In Proceedings of the American Control Conference, 2006,
k k 51955200.
+ i,2 sin(2i,k + i,2 ) + i,k + n(i, k)
[10] Martinez, S., and Bullo, F.
(37) Optimal sensor placement and motion coordination for
k k target tracking.
where i,m , i,m , i,k , m = 1, 2 are unknown and
Automatica, 42, 4 (2006), 661668.
independent of i,k , and only i,k depends on the [11] Hernandez, M. L.
headings of the other UAVs. Any errors in this Optimal sensor trajectories in bearings-only tracking.
approximation are absorbed into n(i, k). In P. Svensson and J. Schubert (Eds.), Proceedings of the
The approximation in (37) holds under the Seventh International Conference on Information Fusion,
vol. II, June 2004, 893900.
assumptions in (35). In situations where the range
[12] Oshman, Y., and Davidson, P.
of the target to the UAVs is much larger than the Optimization of observer trajectories for bearings-only
UAVs velocity and the estimated target velocity, this target localization.
approximation will work well, as can be seen from the IEEE Transactions on Aerospace and Electronic Systems,
simulations in Section IVB. As the target gets close 35, 3 (July 1999), 892902.
to the UAVs, higher order effects become important, [13] Grocholsky, B., Makarenko, A., and Durrant-Whyte, H.
Information-theoretic coordinated control of multiple
and the UAV headings become increasingly coupled; sensor platforms.
in such scenarios the optimal heading must be found In Proceedings of the IEEE International Conference on
using a search from the cost function (i.e., (17)). Robotics and Automation, 2003, 15211526.
[14] Maheswararajah, S., and Halgamuge, S.
Mobile sensor management for target tracking.
REFERENCES In Proceedings of the 2nd International Symposium on
Wireless Pervasive Computing, 2007, 506510.
[1] Ousingsawat, J., and Campbell, M. [15] Baras, A., and Bensoussan, J. S.
Establishing trajectories for multi-vehicle reconnaissance. Sensor scheduling problems.
In Proceedings of the AIAA Guidance, Navigation, and In Proceedings of the IEEE Conference on Decision and
Control Conference, Aug. 2004, 21882199. Control, vol. 3, Dec. 1988, 23422345.
[2] Ousingsawat, J., and Campbell, M. [16] Gupta, V., Chung, T., Hassibi, B., and Murray, R.
Optimal cooperative reconnaissance using multiple On a stochastic sensor selection algorithm with
vehicles. applications in sensor scheduling and sensor coverage.
AIAA Journal of Guidance, Control, and Dynamics, 30, 1 Automatica, 42, 2 (2006), 251260.
(2007), 122132. [17] He, Y., and Chong, K.
[3] Hernandez, M., Kirubarajan, T., and Bar-Shalom, Y. Sensor scheduling for target tracking in sensor networks.
Multisensor resource deployment using posterior In Proceedings of the IEEE Conference on Decision and
Cramer-Rao bounds. Control, Dec. 2004, 743748.
IEEE Transactions on Aerospace and Electronic Systems, [18] Kaplan, L.
40, 2 (2004), 399416. Global node selection for localization in a distributed
sensor network.
[4] Sinha, A., Kirubarajan, T., and Bar-Shalom, Y.
IEEE Transactions on Aerospace and Electronic Systems,
Autonomous ground target tracking by multiple
42, 1 (Jan. 2006), 113135.
cooperative UAVs.
In Proceedings of the IEEE Aerospace Conference, 2005, [19] Kaplan, L.
19. Local node selection for localization in a distributed
sensor network.
[5] Kovacina, M., Palmer, D., Yang, G., and Vaidyanathan, R.
IEEE Transactions on Aerospace and Electronic Systems,
Multi-agent control algorithms for chemical cloud
42, 1 (Jan. 2006), 136146.
detection and mapping using unmanned air vehicles.
[20] Mehrotra, K., Mohan, C., Niu, R., and Varshney, P.
In Proceedings of the IEEE/RSJ International Conference
Temporally staggered sensors in multi-sensor target
on Intelligent Robots and System, vol. 3, Sept. 30Oct. 5,
tracking systems.
2002, 27822788.
IEEE Transactions on Aerospace and Electronic Systems,
[6] Keller, D. R., Moon, T. K., and Gunther, J. H. 41, 3 (July 2005), 794808.
Narrowband source localization from a moving array of [21] Moges, M., and Robertazzi, T.
sensors. Wireless sensor networks: Scheduling for measurement
In Proceedings of the 40th Asilomar Conference Signals, and data reporting.
Systems, and Computers, 2006, 22852289. IEEE Transactions on Aerospace and Electronic Systems,
[7] Toussaint, G. J., De Lima, P., and Pack, D. J. 42, 1 (Jan. 2006), 327340.
Localizing RF targets with cooperative unmanned aerial [22] Erdinc, O., Willett, P., and Coraluppi, S.
vehicles. Multistatic sensor placement: A tracking approach.
In Proceedings of the American Control Conference, July In Proceedings of the 9th International Conference on
913, 2007, 59285933. Information Fusion, July 2006, 18.
[8] Pack, D., York, G., and Fierro, R. [23] Punithakumar, K., Kirabarajan, T., and Hernandez, M.
Information-based cooperative control for multiple Multisensor deployment using PCRLBs incorporating
unmanned aerial vehicles. sensor deployment and motion uncertainties.
In Proceedings of the IEEE International Conference on IEEE Transactions on Aerospace and Electronic Systems,
Networking, Sensing and Control, 2006, 446450. 42, 4 (Oct. 2006), 14741485.
130 IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS VOL. 46, NO. 1 JANUARY 2010
Authorized licensd use limted to: IE Xplore. Downlade on May 13,20 at 1:534 UTC from IE Xplore. Restricon aply.
[24] Keller, D., Moon, T., and Gunther, J. [26] Beard, R., Kingston, D., Quigley, M., Snyder, D.,
Source localization from moving arrays of sensors. Christiansen, R., Johnson, W., McLain, T., and Goodrich, M.
In Proceedings of the 39th Asilomar Conference on Signals, Autonomous vehicle technologies for small fixed-wing
Systems, and Computers, 2005, 452456. UAVs.
[25] Gu, G., Chandler, P., Schumacher, C., Sparks, A., and Journal of Aerospace Computing, Information, and
Prachter, M. Communication, 2, 1 (2005), 92108.
Optimal cooperative sensing using a team of UAVs.
IEEE Transactions on Aerospace and Electronic Systems,
42, 4 (2006), 14461458.
Pengcheng Zhan received the B.S. degree in electrical engineering from Tsinghua
University, Beijing, China in 2002, and the Ph.D. degree in electrical engineering
from Brigham Young University, Provo, UT, in 2007.
He is employed at ArrayComm LLC, San Jose, CA, where he works on
multi-antenna signal processing for wireless communications.
ZHAN ET AL.: ADAPTIVE MOBILE SENSOR POSITIONING FOR MULTI-STATIC TARGET TRACKING 131
Authorized licensd use limted to: IE Xplore. Downlade on May 13,20 at 1:534 UTC from IE Xplore. Restricon aply.
David W. Casbeer received the B.S. degree in electrical engineering from
Brigham Young University, Provo, UT, in 2004. He is currently a Ph.D. candidate
in electrical engineering at Brigham Young University.
Since 2003, he has worked as a research assistant in the MAGICC Lab,
Brigham Young University, where he has worked on multiagent estimation and
control problems. He visited the Australian Centre for Field Robotics, University
of Sydney, Sydney, Australia in the summer of 2007 where he investigated the
use of consensus filters in decentralized data fusion.
132 IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS VOL. 46, NO. 1 JANUARY 2010
Authorized licensd use limted to: IE Xplore. Downlade on May 13,20 at 1:534 UTC from IE Xplore. Restricon aply.