The theory of array processing is usually directed to nonmoving, particular array shapes, like the linear, rectangular, disc, crossed arrays. These are geometric figures whose description is incorporated into the problem in an expedite way. In practice, due to causes beyond the control of the designer, the actual array departs from these simple geometries. Colinearity is difficult of maintaining in very long arrays. Uncertainty may arise concerning the exact location of the array sensors. If the array is a towed flexible aggregate, its steady state shape may significantly depart from a closed type description. The array may move, through irregular paths, eg. random accelerating. These motions are best modeled as stochastic dynamics.
[1]
Jose M. F. Moura.
The hybrid algorithm: A solution to acquisition and tracking
,
1981
.
[2]
José M. F. Moura,et al.
Modeling, Algorithmic and Performance Issues in Deepwater Ranging Sound Systems
,
1981
.
[3]
Arthur B. Baggeroer,et al.
Space/Time Random Processes and Optimum Array Processing
,
1976
.
[4]
T. A. A. Broadbent,et al.
Survey of Applicable Mathematics
,
1970,
Mathematical Gazette.
[5]
Rodney Hill,et al.
Principles of Dynamics
,
1964
.
[6]
José M. F. Moura.
Recursive techniques for passive source location
,
1982,
ICASSP.
[7]
Leif Bjørnø.
Underwater Acoustics and Signal Processing
,
1981
.