Next Article in Journal
An Autonomous Wireless Device for Real-Time Monitoring of Water Needs
Next Article in Special Issue
Passive Underwater Target Tracking: Conditionally Minimax Nonlinear Filtering with Bearing-Doppler Observations
Previous Article in Journal
Integrity Concept for Maritime Autonomous Surface Ships’ Position Sensors
Previous Article in Special Issue
Flow Field Perception of a Moving Carrier Based on an Artificial Lateral Line System
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Path Planning in Threat Environment for UUV with Non-Uniform Radiation Pattern

by
Andrey A. Galyaev
*,
Alexander V. Dobrovidov
,
Pavel V. Lysenko
,
Mikhail E. Shaikin
and
Victor P. Yakhno
Institute of Control Sciences of RAS, Moscow 117997, Russia
*
Author to whom correspondence should be addressed.
Sensors 2020, 20(7), 2076; https://doi.org/10.3390/s20072076
Submission received: 16 March 2020 / Revised: 1 April 2020 / Accepted: 4 April 2020 / Published: 7 April 2020
(This article belongs to the Special Issue Autonomous Underwater Vehicle Navigation)

Abstract

:
The problem of optimal trajectory planning of the unmanned underwater vehicle (UUV) is considered and analytically solved. The task is to minimize the risk of detection of the moving object by a static sonar while moving between two given points on a plane. The detection is based on the primary acoustic field radiated by the object with a non-uniform radiation pattern. In the first part of the article, the probability of non-detection is derived. Further, it is used as an optimization criterion. The non-uniform radiation pattern of the object differentiates this work from previous research in the area. The optimal trajectory and velocity law of the moving object are found, as well as the criterion value on it.

1. Introduction

The extensive development of unmanned mobile vehicles has led to a new area of control problems known as “path planning in the threat environment.” The threat environment is defined as a set of agents (they are called conflicting) that the controlled vehicle must not approach while performing its main task. The control goal is to minimize the negative impact of conflicting agents by selecting the route, parameters of its movement and/or operating modes of technical devices. Depending on the nature of the specific task, the objectives of the negative impact can be considered to be the detection of an object, the approach to the conflicting object to the distances from which it is possible to defeat, and so forth. In the problem of evasion the moving object has to remain covert for the detector system [1]. These problems are extremely relevant for modern-day warfare applications. The technical progress allows using of non-trivial onboard algorithms for unmanned vehicles from wide scientific areas such as optimal control and differential games.
In Reference [2], the problem of automated path planning of combat unmanned aerial vehicles (UAVs) in the presence of radar-controlled surface-to-air missiles is considered. This task includes the interaction of three subsystems—the aircraft and its characteristics, the radar and its capabilities, and the missile and its striking properties. The paper proposes an approach to a model consisting of three subsystems united in a single system. In general, the literature on UAV path planning can be divided into two groups. The first group considers the problem under the assumption of isotropic radar capabilities (i.e., the independence of the reflected signal from the UAV’s spatial orientation), and the second group assumes the implementation of such dependence in the model.
Mathematical criteria for the success of missions performed by moving objects can be the following—the probability of rescue, the motion time on the trajectory, the mathematical expectation of the time interval until the first detection on the path, the path length, and so forth [3,4,5,6,7,8,9]. These criteria are often in conflict with each other, that is, they are contradictory. Some of them may be functionally related. In References [10,11], the path planning problem criterion is based on the artificial potential field which is formed by the obstacles. In Reference [12], optimal path consists of lines and circular arcs (2D Dubins curves). A fairly complete overview of path planning algorithms for the unmanned underwater vehicle (UUV) finding an optimal or sub-optimal route between an origin point and a termination point in marine environments is given in Reference [13].
The solution of the problem of hidden penetration of UUV into the protected area is carried out in the conditions of network-centric counteraction of the opposite side, equipped by means of illumination of the underwater situation and the detection of UUV. Unlike previous works [1,4,5,8], the acoustic signal emitted by a moving object has a non-uniform pattern. One example of a hydroacoustic signal detector is a stationary sonar system (SSS). In the case of a passive mode of reception, the SSS detects UUV using a radiated signal generated by UUV motion [14]. However, in the case of an active mode, UUV reveals itself by the secondary field of the reflected probing signal. An indicator of the effectiveness of a hidden object penetration into the area is the probability of UUV non-detection by means of SSS [3,15]. In the problem of penetration, the maximal UUV invisibility is achieved by finding the route and the law of speed change on it, at which the maximum of this probability is reached. On the other hand, an indicator of the effectiveness of the detection by SSS is the probability of detection of a moving UUV in the conditions of receiving a signal against the background of random noise of the aquatic environment. Therefore, the problem of a hidden penetration is naturally formulated as the problem of testing two statistical hypotheses: H 0 (there is no UUV object in a given area) and H 1 (there is an object in the area). Both hypotheses are complex. They depend on the trajectory of the object and its speed.
The choice of the route with the maximum covertness is the subject of a certain optimization problem. Route selection is a difficult task for the calculus of variations and since it is also posed as a probabilistic task, a probabilistic measure on the functional space of the trajectories must be specified, for example, on the space of continuous functions C ( 0 , T ) . Articles [16,17,18,19] are devoted to the problems of the optimal planning of the UUV route under threat conditions, in which other probabilistic and energy criteria are implemented.
The noted features of the UUV route optimization problem determine the structure of the proposed work. The probabilistic properties of the environment in which the UUV passes do not depend on the UUV, they are set a priori and are determined by the effectiveness of the opposing side, which is SSS. Therefore, Section 2 of the work contains information about the proposed principle of operation of the detection station. The main theme here is the feature of a digital processing of broadband sonar signals received by its linear antenna arrays.
Section 2 discusses the problem of calculating the probabilities of UUV detection in both passive and active observation modes. One of the options for setting the probabilistic distribution of the acoustic noise field, which determines the degree of visibility of the UUV for the SSS, is as follows. The entire tracking area is divided into many spatial zones, in each of which the SSS can calculate (and UUV—estimate by modeling) the probability of detection of an extraneous object. The threat map obtained in this way then serves as initial information for calculating the total probability of detection on the set of zones through which any selected or given object trajectory runs. This probability is identified with the probability of detection on the trajectory. Section 2 also considers the case of detection with a small signal to noise ratio. At the same time, it is useful to use important concepts of the risk of detection and the functionality of threats. Section 3 completes the work, where a more general optimization problem is posed, in which, in addition to the antenna array radiation pattern, it is possible to take into account the scattering indicatrix of the noise-emitting object as a function of its course angle. The choice of the course angle in the task of optimizing the trajectory allows one to improve the indicators of UUV covertness. In Section 4 the obtained solutions of the optimal path planning problem are discussed and compared with known results. Section 5 gives the direction for future work.

2. UUV Non-Detection Probability

2.1. Features of the Reception of Broadband Signals by Antenna Arrays

An antenna array with N H receiving elements is a multi-channel receiving device with output signals x i ( t ) , i = 1 , , N H , whose vector x ( t ) is represented in the time and frequency domains by the relations
x ( t ) = t h ( t τ ) s ( τ ) d τ + ξ ( t ) , X ( ω ) = M ( ω ) S ( ω ) + ξ ( ω ) .
The matrix function h ( · ) characterizes the effects of the propagation of the signal s ( t ) generated by the source, as well as the effects of possible distortions introduced by the receiving elements. The front of the wave received in the far zone is considered flat, and then the signal s ( t ) becomes a scalar function of time. The wave front does not reach the receiving elements simultaneously, but with delays τ i = ( n · r i ) / c , where n is the unit direction vector of the wave front, r i is the coordinate vector of the i-th antenna element and c is the signal propagation speed. In a non-dispersive medium the matrix h ( · ) becomes a vector with components h i ( t ) = δ ( t τ i ) , that reflect only the time delay.
In the two-dimensional problem, the vectors n , r are located in the same plane and it is assumed that the reception is carried out on a linear equidistant lattice with an inter-element distance d located along the axis O x , and the angle between n and the axis O y is equal θ . The signals from various array elements are weighed, generally speaking, with complex weights w i , i = 1 , , N H and summed. The frequency response of such an antenna array has the form
H ( j ω , θ ) = i = 1 N H w i e j ( i 1 ) ψ , ψ = 2 π ( d / λ ) sin θ , λ = 2 π c / ω .
If the array is tuned to the frequency ω 0 of the received signal then the function H ( j ω 0 , θ ) = A ( θ ) = i = 1 N H w i e j ( i 1 ) ψ depends on the angle θ . Moreover, it determines the normalized radiation pattern of the antenna array G ( θ ) = 10 log ( | A ( θ ) | 2 / N H 2 ) (in terms of power). In a dispersive medium, the signal s ( t ) in Equation (1) is a vector with a component s i ( t ) at the input of the i-th element of antenna.
If the signal s i ( t ) has a carrier frequency f i f 0 , i = 1 , , N H , then it is impossible, generally speaking, to tune the array simultaneously to each of these signal frequencies. This fact determines the difference in the methods of receiving narrow-band and wide-band signals on the antenna arrays. During broadband reception, the signal s i ( t ) received by the i-th antenna element is fed to a transverse filter with amplitude and phase frequency characteristics that are adjustable for it, wherein each channel has its own transverse filter. If the latter is synthesized on the basis of a multi-tap delay line (with a delay Δ i between adjacent taps), the choice of value Δ i depends on the frequency sub-band of the signal s i ( t ) that this filter processes.
Consider some channel of the array that processes a frequency-limited portion [ F , F ] of the input signal spectrum. The Fourier transform S ( f ) of the output signal of such a filter has a limited support. By Kotelnikov’s sampling theorem, a discrete set of points s ( i ) : = s ( t i ) , defined by the formula s ( i ) = F F S ( f ) e j 2 π f i Δ t d f ( Δ t is the time interval between adjacent sample points), is enough to restore the function from these points. Namely, just put S ( f ) = Δ t i = s ( i ) e j 2 π f i Δ t . Similarly, the function s ( t ) can be reconstructed from a discrete sequence s ( i ) according to the same theorem. In particular, if t = k Δ t , we have s ( k Δ t ) = Δ t s ( k ) 2 F = s ( k ) . At intermediate points, the use of an expression of the type sin t / t serves as an interpolation scheme which restores s ( t ) by values s ( i ) .
For digital computers, the use of the Kotelnikov’s theorem is not entirely convenient. It would be desirable to have a slightly different form of the Fourier transform, in which they are also specified discretely, but the limits of summation are finite both in the direct and inverse Fourier transforms. This form is used in the theory of the fast Fourier transform (FFT), where the time sequence s ( i ) , i = 0 , 1 , , N 0 1 and its frequency FFT sequence S ( k ) , k = 0 , 1 , , N 0 1 are set by formulas
S ( k ) = Δ t i = 0 N 0 1 s ( i ) e j 2 π i k N 0 , s ( i ) = 1 N 0 Δ t k = 0 N 0 1 S ( k ) e j 2 π i k N 0 ,
where S ( k ) : = S ( f k ) , f k = k N 0 Δ t .
The FFT algorithm can be given in a matrix notation [20]
S = W s ,
where s is a vector representation of the sequence s ( i ) , i = 0 , 1 , , N 0 1 , S is a vector representation of the sequence S ( k ) , k = 0 , 1 , , N 0 1 and W is a unitary matrix with elements
W N 0 i k = exp j 2 π N 0 i k .
From this fact, the equivalence of the results obtained using the time and frequency representations of the data follows. In particular, if s is a random vector of Gaussian time samples, then the vector S in Equation (2) of frequency samples of its Fourier image will also be Gaussian. Recalculation of covariance matrices from one representation to another is simplified due to the unitarity of the transition matrix. In this paper, both representations are used equally. In particular, such an important parameter in the problems of detecting and evaluating signals as the signal-to-noise ratio is easily recalculated.
Finally, the last remark concerns the inclusion of scattering indicatrix (in power) for an object emitting a signal. The indicatrix depends on the course angle of the object. Multiplying the scattering indicatrix and the radiation pattern of the receiving antenna, we obtain a function W ( ω , θ , ϕ ) depending on the frequency and two angular variables, which determines the strength of the target at the receiving point. It can be shown that for the case of a spatial (and not just flat) problem, the function W ( ω , θ , ϕ ) can be represented by the Chebyshev polynomials with coefficients g m n ( ω ) depending on the frequency. The coefficients g m n ( ω ) are downloaded in the form of tables from the database for the entire set of operating frequencies of the monitoring station.
The selection of weighting coefficients of antenna arrays and frequency channel parameters for a broadband signal processing is not considered in the work. As noted in the introduction, the purpose of the work is not to optimize the detection procedure, but to optimize the trajectory of the object in order to evade detection.

2.2. Non-Detection Probability of UUV under Passive Surveillance

The covertness of the UUV on the selected trajectory with a given velocity law can be characterized by the probability that during the passage of the whole route it will not be detected at any tact. Such probability is denoted by P n d and will be called the non-detection probability of UUV on the trajectory. Let us denote as T 0 the UUV transit time of the whole trajectory, and the duration of the tact will be Δ T . Then the entire trajectory can be divided into N = T 0 Δ T segments, on each of which a decision is made about the absence of an object and the corresponding probabilities P n d ( j ) , j = 1 , , N are calculated. Then, assuming statistical independence of the signals on each segment, one of the simplest variants of the probability measure on the trajectory is defined as the product of the probabilistic measures on the segments of the trajectory
P n d = j = 1 N P n d j .
In the case of several SSS, the product of expressions of the form Equation (3) over all available SSS is taken [2]. Thus, the criterion in the formalization problem of the stealth concept of UUV is the Formula (3). Now the task is to construct the optimal trajectory and the optimal UUV velocity law, maximizing the UUV non-detection probability P n d .
In passive mode, the signal on the elements of the antenna array is described by the formula
x ( t ) = δ · s ( t ) + ξ ( t ) , t = 1 , , N T ,
where x ( t ) , s ( t ) , ξ ( t ) are Gaussian input signal, object signal and noise, respectively, and N T = Δ T Δ t – number of discrete time samples. Here δ = 0 in the case of hypothesis H 0 (a signal from UUV is absent) and δ = 1 in the case of alternative H 1 (a signal from UUV is present).
If the bearing (with the angle θ ) to the UUV does not coincide with the normal to the antenna line and it is known, then the hydrophone input signal is
x ( k ) ( t ) = s ( t ( k 1 ) d sin θ / c ) + ξ ( k ) , k = 1 , , N H ,
where d is the distance between antenna elements, c is a speed of sound in water and N H is the number of hydrophones. This signal at the k-th hydrophone is a function of time and after sampling in time it turns into a vector
y ( k ) = ( y ( k ) ( t 1 ) , y ( k ) ( t 2 ) , , y ( k ) ( t i ) , , y ( k ) ( t N T ) )
of size N T . The covariance matrix of this vector is equal to the sum of the covariance matrices K s + K of the signal and noise respectively, where, due to the independence of time samples of noise, the matrix becomes diagonal, and the matrix of the signal from the object, due to the assumed stationarity, is a Toeplitz matrix with elements
k s , ( l , k ) t ( i ) = E [ s ( t i + l Δ τ ) s ( t i + k Δ τ + i Δ t ) ] ,
where a pair of indices ( l , k ) fixes the numbers of hydrophones, and i Δ t corresponds to the time shift of the signals during sampling by time in step Δ t = t i + 1 t i . Similarly, Δ τ = d sin θ / c means the inter-element delay in the equidistant linear array when the wave is incident at an angle θ . The time sequence of N T vectors in the number of N H pieces can be represented as a single column vector
Y t = ( y ( 1 ) , y ( 2 ) , , y ( N H ) ) T
with N T N H elements. In modern SSS with linear antenna array the incoming signal is often preprocessed in the receiving path using FFT. Consider the detector, which performs FFT of time-sampled signals coming from the hydrophones of the linear antenna. As a result, we get a sample of Gaussian centered complex random vectors x ( f ) , f = 1 , , N F of dimension equal to the number of hydrophones N H in antenna. Further processing of the received signal is assumed not in the time but in the frequency domain, since in the case of broadband reception, it is possible to select the frequency ranges most informative for the received useful signal. Therefore, the FFT is applied to the temporal components of the vector Y t .
After the FFT conversion, the observation signal is described as
Y f = ( Y ( 1 ) ( f ) , , Y ( N H ) ( f ) ) T , f = 1 , , N F .
The detector works according to the threshold principle, according to which the observations obtained at one tact are converted into decisive statistics compared with the threshold. If the threshold is exceeded, a decision is made about the presence of the object. A false alarm is when the threshold is exceeded in the absence of an object. Such an event is random, and the threshold is selected from the condition that the probability of false alarm is equal to a given small number α ( 0 < α < 1 ) .
After pre-processing at each hydrophone (band-pass filtering, time-shift of the input signal, sampling by time of the continuous signal and FFT of them), the input signal to be decided is a set of random vector-columns Y ( k ) ( f ) , k = 1 , , N F with a dimension equal to the number of hydrophones N H . Moreover, Y ( k ) = ξ ( k ) in the case of a hypothesis and Y ( k ) = S ( k ) + ξ ( k ) in the case of an alternative. A ( N F N H ) -vector Y = Y f is compiled from complex vectors Y ( 1 ) , , Y ( N H ) . Then the likelihood ratio for Gaussian vector Y can be determined as [21]
Λ = det K ξ det ( K s + K ξ ) exp 1 2 Y * [ K ξ 1 ( K σ + K ξ ) 1 ] Y ,
where K ξ is the covariance matrix of a random vector Y of the frequency components of the signal in the case of a hypothesis H 0 , and K σ + K ξ is the covariance matrix of the vector in the case of an alternative H 1 . Assuming noise independence at various hydrophones, covariance matrices can be represented in a block form
K ξ = K O O . . . O O K O . . . O . . . . . . . . . . . O O O . . . K , K σ = K s 11 K s 12 . . . . . K s 1 N F K s 21 K s 22 . . . . . K s 2 N F . . . . . . . . . . . . . K s N F 1 K s N F 2 . . . K s N F N F ,
where K is the covariance matrix of a noise which is the same on each of the frequency channels of the antenna array processor, and K s I J is the Toeplitz covariance matrix of the vector signal s ( f ) from an object with elements k s , ( l , k ) f ( i ) = E [ s ( f i + l Δ u ) s ( f i + k Δ u + i Δ f ) ] , where Δ f = 1 / Δ t , Δ u = 1 / Δ τ and O is the square zero matrix. For simplicity we assume that signal s is stationary. Then the covariance matrix of signal s can be represented as K σ = σ s 2 R s , where R s is the normalized covariance matrix, and σ s 2 is the variance of the signal from the object.

2.3. Non-Detection Probability of UUV under Passive Surveillance at a Small Signal/Noise Ratio

The Hermitian form in the likelihood ratio Equation (4) is reduced to
Y * [ K ξ 1 ( K σ + K ξ ) 1 ] Y = Y * ( K ξ 1 K σ K ξ 1 ( I + K σ K ξ 1 ) 1 Y ,
which allows in the case of a small signal/noise ratio to significantly simplify this expression, bringing it to the form
Q ( Y ) = Y * ( K ξ 1 K σ K ξ 1 ) Y .
Then in the far detection zone the likelihood ratio is approximated as a function of the statistics [22]
Q = k = 1 N H f = 1 N F Y ( k ) * ( f ) W ( f ) Y ( k ) ,
where W ( f ) = K ξ 1 ( f ) R s ( f ) K ξ 1 ( f ) .
In this case, the likelihood ratio is a monotonically non-decreasing function of statistics Q and there is a uniformly the most powerful criterion for testing the hypothesis H 0 against H 1 . This criterion is to compare the statistics Q from Equation (5) with the threshold h chosen from the condition that the probability of false alarm equals to a given number α : P ( Q > h | H 0 ) = α .
By virtue of the central limit theorem the probability distribution of the statistics in Equation (5) is approximately normal with expectation E [ Q | H 0 ] and variance D [ Q | H 0 ] in the case of the hypothesis H 0 (there is no useful signal) and with expectation E [ Q | H 1 ] and variance D [ Q | H 1 ] in the case of the alternative H 1 . When calculating the UUV probability of detection it is assumed that the bearing on the UUV is known. In this case, the probability of UUV being undetected in the next cycle is obtained as
P ( Q h | H 1 ) = Φ D [ Q | H 0 ] D [ Q | H 1 ] Φ 1 ( 1 α ) E [ Q | H 1 ] E [ Q | H 0 ] D [ Q | H 1 ] ,
where Φ is a function of the standard normal distribution Φ ( x ) = 1 2 π x exp ( t 2 / 2 ) d t .
Due to Equation (5) the next expressions for distribution of statistics Q moments are valid
E [ Q | H 1 ] E [ Q | H 0 ] = f = 1 N F tr [ W ( f ) σ s 2 R s ( f ) ] ,
D [ Q | H 0 ] = 2 f = 1 N F tr [ W ( f ) K ξ ( f ) ] 2 ,
D [ Q | H 1 ] = 2 f = 1 N F tr [ W ( f ) ( σ s 2 R s ( f ) + K ξ ( f ) ) ] 2 .
Taking into account Equations (7) – (9) the Formula (6) is representable in the form
P ( Q h | H 1 ) = Φ Φ 1 ( 1 α ) f = 1 N F tr [ W ( f ) K ξ ( f ) ] 2 f = 1 N F tr W ( f ) ( σ s 2 R s ( f ) + K ξ ( f ) ) 2 f = 1 N F tr [ W ( f ) σ s 2 R s ( f ) ] 2 f = 1 N F tr [ W ( f ) ( σ s 2 R s ( f ) + K ξ ( f ) ) ] 2 .
In the absence of information about covariances between hydrophones we accept K ξ ( f ) = σ ξ 2 I , R s ( f ) = I (I is identity matrix), and then
P ( Q h | H 1 ) = Φ σ ξ 2 Φ 1 ( 1 α ) σ s 2 + σ ξ 2 σ s 2 N F N H ( σ s 2 + σ ξ 2 ) 2 .
Finally, the UUV non-detection probability on the trajectory is equal (with a small ratio signal/noise)
P nd = j P ( Q j h | H 1 ) = j Φ σ ξ 2 ( j ) Φ 1 ( 1 α ) σ s 2 ( j ) + σ ξ 2 ( j ) σ s 2 ( j ) N F N H 2 ( σ s 2 ( j ) + σ ξ 2 ( j ) ) .
The next lemma is valid.
Lemma 1.
On the i-th cycle of observation non-detection probability of UUV under passive surveillance at a small signal/noise ratio can be approximately formulated as
P nd i = 1 α Φ Φ 1 ( 1 α ) · Φ 1 ( 1 α ) + N F N H 2 σ s 2 ( i ) σ ξ 2 ( i ) .
Proof. 
Choose the non-detection probability of the form Equation (10) and consider it at a small signal/noise ratio
P nd = Φ σ ξ 2 Φ 1 ( 1 α ) σ s 2 + σ ξ 2 σ s 2 N F N H ( σ s 2 + σ ξ 2 ) 2 = Φ Φ 1 ( 1 α ) Φ 1 ( 1 α ) + N F N H 2 σ s 2 σ ξ 2 + o σ s 2 σ ξ 2 .
Taylor series expansion with respect to a small signal/noise parameter leads Equation (12) to the form
P nd = Φ Φ 1 ( 1 α ) Φ Φ 1 ( 1 α ) · Φ 1 ( 1 α ) + N F N H 2 σ s 2 σ ξ 2 + o σ s 2 σ ξ 2 ,
which is simplified to an expression P nd = 1 α Φ Φ 1 ( 1 α ) · Φ 1 ( 1 α ) + N F N H 2 σ s 2 σ ξ 2 + o σ s 2 σ ξ 2 .  □
The total probability of UUV detection formally corresponds to the probability of occurrence of a detection event at least once in a series of N observations and for independent events (observations) is calculated by the formula P d = 1 i = 1 N P nd i , or, if you introduce the concept of “risk”,
R = i = 1 N R i ,
where R i = ln P nd i is the risk for the i-th observation segment. Given Equation (12), for enough small α Formula (13) takes the form
R = α N + Φ Φ 1 ( 1 α ) · Φ 1 ( 1 α ) + N F N H 2 · i = 1 N σ s 2 ( i ) σ ξ 2 ( i ) .
Multiplying and dividing the last expression by Δ T (tact duration) and assuming that T 0 = N Δ T (UUV time on the route), we obtain
R = α T 0 Δ T + Φ Φ 1 ( 1 α ) · Φ 1 ( 1 α ) + N F N H 2 · 1 Δ T i = 1 N σ s 2 ( i ) σ ξ 2 ( i ) Δ T .
The last sum is represented as an integral, which we call the threat functional [4,5] in the problem of UUV route planning for the case of passive sonar
R = 0 T 0 σ s 2 ( t ) σ ξ 2 ( t ) d t .
This conclusion coincides with the result given in Reference [3] in the case of one sonar for
σ s 2 = σ 0 2 υ j υ j υ 0 υ 0 μ r 0 2 r 2 γ and σ ξ 2 ( t ) = c o n s t .
with the non-detection probability in the form
P nd = j F n χ 1 α , ξ 2 1 + σ 0 2 υ j υ j υ 0 υ 0 μ r 0 2 σ ξ 2 r j 2 γ ,
where F n is χ 2 – probability distribution with n degrees of freedom, α is a false alarm probability, γ – attenuation coefficient, r j is the distance from UUV to sonar at j tact, starting from the moment of appearance of UUV on the trajectory, and υ j is a constant speed of UUV at this tact, σ 0 , σ ξ , μ , r 0 , υ 0 are some model parameters. The number of factors in the product is equal to the number N of tacts when moving UUV along the trajectory.
To use the Formula (14) for calculations, it is necessary to ensure the smallness of the first term and to estimate the value of the multiplier standing before the sign of the sum in the second term. The dependence G ( α ) = Φ Φ 1 ( 1 α ) · Φ 1 ( 1 α ) + 1 2 of this multiplier on the probability of a false alarm is shown in Figure 1. Moreover, for the path planning task, it is not required to know the exact values of the information processing parameters included in expression Equation (14) because they are not included in Equation (15).

2.4. Non-Detection Probability of UUV under Active Surveillance

Consider the case of an active location, when the observation model has the form
x ( f ) = δ · s ( f ) + ξ ( f ) , f = 1 , , N F ,
D [ Q | H 0 ] = D [ Q | H 1 ] = 4 s * ( f ) K ξ 1 ( f ) s ( f ) ,
where x ( f ) , s ( f ) , ξ ( f ) are Gaussian complex input signal, useful signal and noise, respectively, after FFT conversion. The meaning of δ is the same. In this case, the statistics for comparing with the threshold is as follows
Q = f = 1 N F [ s * ( f ) K ξ 1 ( f ) x ( f ) + x * ( f ) K ξ 1 ( f ) s ( f ) ] ,
where K ξ is the covariance matrix of noise vector. Statistics Equation (18) is linear in observations, P ( T h | H 1 ) has a normal distribution and the non-detection probability on the observation cycle after sending the probing signal is written in the form of Equation (8), but here
E [ Q | H 0 ] = 0 , E [ Q | H 1 ] = 2 s * ( f ) K ξ 1 ( f ) s ( f ) ,
and hence
P ( Q h | H 1 ) = Φ Φ 1 ( 1 α ) 1 s * ( f ) K ξ 1 ( f ) s ( f ) .
In the absence of information about covariances between hydrophones the probability of non-detection at one sending of the probing signal is equal to
P ( Q h | H 1 ) = Φ Φ 1 ( 1 α ) 1 s * ( f ) s ( f ) s * ( f ) s ( f ) σ n 2 σ ξ 2 .
The number of factors in the product is equal to the number of cycles during the passage of the entire trajectory of UV. As in Equation (11), the non-detection probability on the trajectory in active mode is the product of all observation cycles on the trajectory
P nd = j P ( Q j h | H 1 ) = j Φ Φ 1 ( 1 α ) 1 s * ( f ) s ( f ) s * ( f ) s ( f ) σ n 2 σ ξ 2 .
It should be noted that in Formulas (11) and (20), the variance of the useful signal is a function not only of the distance r to the object, but also of the attenuation coefficient γ when the acoustic wave propagates in a stratified medium.
Choose the non-detection probability of the form Equation (20) and consider it at a small signal/noise ratio with the aid of Taylor series. Then next formula is valid. Like Formula (15), summing up all the cycles of observation, we obtain the treat functional part of active mode equal to
R = 0 T σ ξ ( t ) s f * ( t ) s f ( t ) d t .
The treat functional Equation (15) or (21) on a segment of the trajectory has as input parameters the data of sonar systems, including their location (coordinates and parameters of detection active or passive mode, orientation of antenna, etc.) and calculated for these values of the ratio signal/noise reference source (its speed and the direction of sonar), the values of latitude and longitude start and end points of the segment, the speed of the UUV.

3. Path Planing Problem

3.1. About Risk Functional

The path planning problem for object moving in a threat environment will be determined as the problem of calculus of variations of the risk functional Equation (15). Due to Equation (16), after omitting the constants the expression under integral depends on instantaneous level of signal S ( t ) , received by the sonar [1]
σ s 2 ( t ) σ ξ 2 ( t ) S ( t ) .
This signal itself depends on the receiving diagram of the sensor and the radiation pattern of the object as well as properties of the marine environment
S = v μ r k G ( φ ) γ g ( β ) ,
where multiplier G ( φ ) is responsible for diagram of sensor antenna, g ( β ) is a radiation pattern of the moving object, r is the current distance between sensor and evading object, v – absolute instant velocity of the object, γ – signal saturation factor in water. The geometric meaning of angles ψ and φ is as follows. Here ψ is the angle of rotation of object’s velocity vector and φ is the angle of rotation of radius vector as shown in Figure 2. Angle ψ φ = β is the angle in triangle built from radial v r and transversal v φ velocities of the object, for example, the angle between velocity of the object and its projection on radius vector as shown in Figure 3.The exponents k and μ characterize the physical field used for detection. Depending on values of k and μ this can be magnetic, thermal, acoustic or electromagnetic fields.
Moreover, the risk R is the integral value of this signal, so the criterion of optimization Equation (15) is a function of phase coordinates of the object and qualities of the sonar and the object itself:
R = 0 T 0 v μ r k G ( φ ) γ g ( β ) d t .
We consider sonar antenna diagram to be homogeneous, so G ( φ ) 1 , and there is no additional signal attenuation or gain in the environment so γ = 1 .
We study the case of k = μ , namely μ = 2 for acoustic field in underwater environment. Non-uniform radiation pattern of the object can be described as
g ( β ) = F φ ˙ r r ˙ .
The example of radiation pattern is presented in Figure 4.

3.2. Mathematical Statement of the Problem

Therefore we can formulate the optimal path planning problem.
Problem 1.
It is required to find such trajectory ( r * ( t ) , φ * ( t ) ) , which minimizes the functional
R = 0 T 0 v r μ F r φ ˙ r ˙ d t ,
where v is a velocity of the object, r is the distance between the sensor and the object. Boundary conditions are
r ( 0 ) = x A , r ( T 0 ) = r B , φ ( 0 ) = φ A , φ ( T 0 ) = φ B .
Time T 0 of moving on route from point A to B is fixed. The detection system consists of one static sonar placed in the origin of Cartesian coordinate system with X axis passing through point A. The polar coordinate system is used for solution simplicity.

3.3. Solution of the Path Planing Problem

Lemma 2.
Substitution of variable ρ = ln r brings functional Equation (24) to the form
R ( ρ , ρ ˙ , φ , φ ˙ , t ) = 0 T 0 ρ ˙ 2 + φ ˙ 2 μ / 2 F φ ˙ ρ ˙ d t .
Proof of lemma 2 is given in the Appendix A.
Instead of solving the original Problem 1 according to Lemma 2 it is necessary to solve a two point boundary value variational problem on the minimum of the functional Equation (25).
Problem 2.
It is required to find the trajectory ( ρ * ( t ) , φ * ( t ) ) , which minimizes the functional
R ( ρ , ρ ˙ , φ , φ ˙ , t ) = 0 T 0 S ( ρ , ρ ˙ , φ , φ ˙ , t ) d t = 0 T 0 ρ ˙ 2 + φ ˙ 2 μ / 2 F φ ˙ ρ ˙ d t min ρ ( · ) , φ ( · ) .
with boundary conditions
ρ ( 0 ) = ρ A , ρ ( T 0 ) = ρ B , φ ( 0 ) = φ A , φ ( T 0 ) = φ B .
The following lemma holds.
Lemma 3.
The lagrangian S ( ρ , ρ ˙ , φ , φ ˙ , t ) has a constant value S * along the extremal trajectory ( ρ * ( t ) , φ * ( t ) ) .
Proof. 
Indeed, function S ( ρ , φ , ρ ˙ , φ ˙ , t ) = ρ ˙ 2 + φ ˙ 2 μ / 2 F η , where η = φ ˙ ρ ˙ , does not explicitly depend on variable t. Hence the value of generalized energy H = ρ ˙ S ρ ˙ + φ ˙ S φ ˙ S is a constant along the extremal trajectory ( ρ * ( t ) , φ * ( t ) ) . The calculation in the last expression gives a chain of equalities
H = ρ ˙ ρ ˙ μ ρ ˙ 2 + φ ˙ 2 μ / 2 1 F η + φ ˙ φ ˙ μ ρ ˙ 2 + φ ˙ 2 μ / 2 1 F η + + ρ ˙ ρ ˙ 2 + φ ˙ 2 μ / 2 F η φ ˙ ρ ˙ 2 + φ ˙ ρ ˙ 2 + φ ˙ 2 μ / 2 F η 1 ρ ˙ ρ ˙ 2 + φ ˙ 2 μ / 2 F η = ( μ 1 ) S = ( μ 1 ) S * .
In the case of μ = 1 the problem degenerates and requires additional exploration. □
Theorem 1.
Suppose that 0 < F 1 < F ( η ) < F 2 for all η R 1 is a twice continuously differentiated function of η, where F 1 , F 2 are some constant values, and ρ ¨ ( t ) , φ ¨ ( t ) exist and are continuous functions of t. Then the extremal trajectory satisfies the following system of equations
ρ ˙ = c o n s t , φ ˙ = c o n s t .
Proof. 
The Euler-Lagrange equations for the variational problem Equation (26) are
d d t S ρ ˙ ( ρ , φ , ρ ˙ , φ ˙ , t ) + S ρ ( ρ , φ , ρ ˙ , φ ˙ , t ) = 0 , d d t S φ ˙ ( ρ , φ , ρ ˙ , φ ˙ , t ) + S φ ( ρ , φ , ρ ˙ , φ ˙ , t ) = 0 ,
where S ( ρ , φ , ρ ˙ , φ ˙ , t ) = ρ ˙ 2 + φ ˙ 2 μ / 2 F φ ˙ ρ ˙ .
After substituting the functional S into system Equation (28) and due to S φ = 0 , S ρ = 0 , we have
μ ρ ˙ ρ ˙ 2 + φ ˙ 2 μ / 2 1 F ( η ) ρ ˙ 2 + φ ˙ 2 μ / 2 F ( η ) φ ˙ ρ ˙ 2 = C 1 , μ φ ˙ ρ ˙ 2 + φ ˙ 2 μ / 2 1 F ( η ) + ρ ˙ 2 + φ ˙ 2 μ / 2 F ( η ) 1 ρ ˙ = C 2 .
Here C 1 , C 2 are some constant values, which are first integrals of system Equation (28) as well as S * . After multiplying first Equation (29) on ρ ˙ , second – on φ ˙ and summing, so on after multiplying first Equation (29) on ρ ˙ , second – on φ ˙ and summing, we have system
C 1 ρ ˙ + C 2 φ ˙ = μ S * , C 2 ρ ˙ C 1 φ ˙ = F ( η ) ( η 2 + 1 ) ρ ˙ 2 + φ ˙ 2 μ / 2 .
The implementation the condition of theorem F > F 1 > 0 and substitution the S * into second Equation (30) give
C 1 ρ ˙ + C 2 φ ˙ = μ S * , C 2 ρ ˙ C 1 φ ˙ = ln F ( η ) ( η 2 + 1 ) S * .
Dividing the second equation from Equation (31) on the first and substituting η = φ ˙ ρ ˙ the equation with respect to variable η one can obtain
ln F ( η ) = C 2 C 1 η C 1 + C 2 η μ η 2 + 1 .
It means that left and right sides of Equation (32) equal to each other at some fixed points η * . From the linearity on C 1 , C 2 system Equation (31) follows its solvability at any right-hand side. Due to fixed value η * and left side of Equation (31) the statement of theorem follows. □
The general form of optimal trajectory can be obtained.
Lemma 4.
Let S ( ρ , ρ ˙ , φ , φ ˙ , t ) = ρ ˙ 2 + φ ˙ 2 g β η , g ( β ) – thrice continuously differentiated function of β, then Hessian matrix H equals
H = 2 g ( β ) 2 g ( β ) φ ˙ ρ ˙ ρ ˙ 2 + φ ˙ 2 + g ( β ) φ ˙ 2 ρ ˙ 2 + φ ˙ 2 g ( β ) ρ ˙ 2 φ ˙ 2 ρ ˙ 2 + φ ˙ 2 g ( β ) φ ˙ ρ ˙ ρ ˙ 2 + φ ˙ 2 , g ( β ) ρ ˙ 2 φ ˙ 2 ρ ˙ 2 + φ ˙ 2 g ( β ) φ ˙ ρ ˙ ρ ˙ 2 + φ ˙ 2 2 g ( β ) + 2 g ( β ) φ ˙ ρ ˙ ρ ˙ 2 + φ ˙ 2 + g ( β ) ρ ˙ 2 ρ ˙ 2 + φ ˙ 2
with
det H = 4 g 2 ( β ) + 2 g ( β ) g ( β ) g 2 ( β ) .
Proof. 
After calculating the first partial derivatives of S on ρ ˙ , φ ˙ , using equality β = arctan φ ˙ ρ ˙ , one can get
S ρ ˙ = 2 ρ ˙ g ( β ) φ ˙ g ( β ) , S φ ˙ = 2 φ ˙ g ( β ) + ρ ˙ g ( β ) .
Then we can calculate the second partial derivatives of S on ρ ˙ , φ ˙ and obtain Equation (33). Computing the determinant of the Hessian matrix gives Equation (34). □
Theorem 2.
Let us suppose that conditions of theorem 1, lemmas 3 and 4 is fulfilled, and det   H > 0 for all values β. The optimal trajectory satisfying Equation (27) gives the strong minimum to the risk functional Equation (25).
Proof. 
First of all, it is required to check the Legandre conditions. It means that Hessian matrix is positively defined. Indeed second order minor coincides with det H which is strictly positive. Among first order minors H 11 and H 22 at list one of them is positive because both values are fixed on the optimal trajectory and their sum equals
H 11 + H 22 = 4 g ( β ) + g ( β ) = 4 g 2 ( β ) + det H + g 2 ( β ) 2 g ( β ) > 0 .
Hence both values H 11 and H 22 are strictly positive too.
The Jacobin conditions have the form
d d t H 11 ρ ˙ + H 12 φ ˙ = 0 , d d t H 21 ρ ˙ + H 22 φ ˙ = 0 ,
because S ρ ρ ˙ = 0 , S φ ρ ˙ = 0 , S ρ φ ˙ = 0 , S φ φ ˙ = 0 . The Equation (36) take the form
d d t S ρ ˙ = 0 , d d t S φ ˙ = 0 ,
which coincides with explicit form of Equation (28) and leads to Equation (29). It means that the sufficient conditions of strong minimum of risk functional Equation (25) is fulfilled [23]. □
Corollary 1.
According to the theorems 1 and 2 the optimal trajectory has the form of logarithmic spiral.
r ( t ) = r A exp t T 0 ln r B r A , φ ( t ) = φ A + φ B φ A T 0 t .
The equation of optimal trajectory of the UUV on the plane is
r ( φ ) = r A exp φ φ A φ B φ A ln r B r A .
Lemma 5.
The functional value Equation (25) on the optimal trajectory Equation (38) equals
R * = 1 T 0 ( ρ B ρ A ) 2 + φ B φ A 2 g ( β * ) ,
where β * = arctan φ B φ A ρ B ρ A , and depends on boundary conditions only.
The proof of lemma is given in Appendix A.
The theorems above guarantee that optimal trajectory of the object is logarithmic spiral. However, it is unclear, whether this trajectory must consist of one segment or several and have points of switching along the route. To answer this question let us compare the values of the risk functional in two cases. In the first, object moves from A straight to B, and in second - from A to C and then to B. In first case risk R A B * , according to Lemma 5, equals
R A B * = ( ρ B ρ A ) 2 + ( φ B φ A ) 2 T 0 g arctan φ B φ A ρ B ρ A .
The risk on the trajectory consisting of two segments is given in the next Lemma.
Lemma 6.
Let g ( β ) = g ( β ) = g ( π β ) for all 0 β 2 π . The minimal value of risk on the two-segment trajectory consequently passing through the points A, C, B during time interval T 0 equals
a) in the case of 0 β m < β *
R A C * + R C B * = ( ρ B ρ A ) 2 T 0 cos 2 β m g ( β m ) ,
b) in the case of β * < β m π / 2
R A C * + R C B * = ( φ B φ A ) 2 T 0 sin 2 β m g ( β m ) ,
c) in the case of β m = β *
R A C * + R C B * = R A B * = ( ρ B ρ A ) 2 T 0 cos 2 β * g ( β * ) = ( φ B φ A ) 2 T 0 sin 2 β * g ( β * ) ,
where β m = arctan φ C φ A ρ C ρ A = arctan φ B φ C ρ B ρ C and
ρ C = ρ A + ρ B + ( φ B φ A ) cot β m 2 , φ C = φ A + φ B + ( ρ B ρ A ) tan β m 2 .
The proof of Lemma 6 is given in Appendix A.
Due to the fact that real acoustic radiation patterns of UUV have more complex shapes, Lemma 6 provides a simple way to check the type of optimal trajectory. Indeed, if in one of the cases of Lemma 6, R A C * + R C B * < R A B * , then the logarithmic spiral directly connecting the points A, B is not optimal and two-segment trajectory is preferable in a sense of risk functional value.

4. Discussion of the Results

In previous articles the similar problem without radiation pattern was considered. The risk functional has a form
R = 0 T 0 v μ r 2 d t min ( v ( · ) , r ( · ) ) .
In Reference [1], it was proven that optimal trajectory and velocity in the case of μ = 2 for underwater environment, considered in the current article, are the same as Equation (38). Generally speaking, this is a non-trivial fact. However, the optimal risk value in Reference [1] equals
R = 1 T 0 ( ρ B ρ A ) 2 + φ B φ A 2 .
Comparing this formula with Equation (39), one can see that taking into account heterogeneous radiation pattern of the moving object reduces risk value, as g ( β ) , being normalized for comparison by the meaning max ( g ( β ) ) , is less than 1. Then the risk value Equation (39) is less than the one in Reference [1].
Matlab procedure has been developed to simulate and validate found analytical solution. Figure 5 and Figure 6 show results of this simulation. In each figure left picture shows the chosen radiation pattern and right picture shows extremal trajectories, obtained using this pattern: path A C 1 B represents case a) of the Lemma 6, A C 2 B – case b) and A B – case c) respectively. As a result numerical and analytical solutions have been found to coincide with each other that supports Lemma 6.
The values of risk functional and time intervals have been calculated. In the first example for case a) T 1 = 8.8566 , R A C 1 * = 0.078529 , T 2 = 11.1434 , R C 1 B * = 0.062401 , R A C 1 B * = 0.13909 , for case b) T 1 = 11.1434 , R A C 2 * = 0.078529 , T 2 = 8.8566 , R C 2 B * = 0.067223 , R A C 2 B * = 0.13909 , for case c) R A B * = 0.14739 . One can see that R A C 1 B * = R A C 2 B * . Also it is clear that R A C 1 * = R C 2 B * and R C 1 B * = R A C 2 * due to geometry of placement points C 1 , C 2 on plane, which are defined by appropriate choice of radiation pattern.
This is also fair for the second example, where for case a): T 1 = 6.7286 , R A C 1 = 0.079755 , T 2 = 13.2714 , R C 1 B * = 0.062401 , R A C 1 B * = 0.17911 , for case b): T 1 = 13.2714 , R A C 2 * = 0.10141 , T 2 = 6.7286 , R C 2 B * = 0.079755 , R A C 2 B * = 0.17911 , for case c): R A B * = 0.19675 .
In both examples, R A B * > R A C 1 B * , that is, two-segment route has a less risk of detection than the one of the simple straight route. Thus this solution is different from results of Reference [1] and presents an advantage in the sense of risk functional minimization. Whereas in Reference [1], due to velocity optimization risk value on the optimal path was reduced by 40 % in average, now due to radiation pattern risk has been reduced by factor g ( β * ) max ( g ( β ) ) up to value min ( g ( β ) ) max ( g ( β ) ) . In both examples the maximum primary acoustic radiation of UUV while object moves along the trajectory A B falls in the direction of SSS or, in other words, g ( β * ) = max ( g ( β ) ) . Therefore, under other boundary conditions, the risk functional reduction will be significantly greater. This presents an advantage of new solution in the sense of risk functional minimization. Moreover, in both examples R A B * > R A C 1 B * , that is, two-segment route has a less risk of detection than the one of the simple straight route (risk reduction is by 6% and 8% respectively), that is the result described analytically in Lemma 6.
Now let us suppose that non-uniform radiation pattern of the object is described as
g ( β ) = K 1 + K 2 cos 2 β .
Coefficients K 1 and K 2 define the character of radiation and K 1 + K 2 = 1 . The example of this radiation pattern is presented in Figure 4 for K 1 = 0.25 , K 2 = 0.75 . The functional value Equation (25) on the optimal trajectory equals
R * = 1 T 0 ln 2 r B r A + K 1 2 φ B φ A 2
and depends on boundary conditions only. In this case according to Lemma 4 det H = 4 K 1 ( K 1 + K 2 ) = 4 K 1 > 0 and Theorem 2 can be reformulated as follows.
Theorem 3.
The optimal trajectory in the form Equation (37) gives the global minimum to the risk functional Equation (25).
Proof. 
Indeed, the variation of functional Equation (25) has a form
R ( ρ + δ ρ , ρ ˙ + δ ρ ˙ , φ + δ φ , φ ˙ + δ φ ˙ , t ) R ( ρ , ρ ˙ , φ , φ ˙ , t ) = = 2 ρ ˙ δ ρ 0 T 0 + φ ˙ δ φ 0 T 0 2 0 T 0 ( ρ ¨ δ ρ + φ ¨ δ φ ) d t + + 0 T 0 ( δ ρ 2 + K 1 δ φ 2 ) d t = 0 T 0 ( δ ρ 2 + K 1 δ φ 2 ) d t > 0 ,
where δ ρ , δ φ are variations of respective coordinates and smooth enough functions of time. The first and second summands are zeros due to fixed boundary conditions for variations, the third summand equals zero due to fulfilled Euler-Lagrange equations. The rest is positive as an integral of a weighted sum of squares of functions. Hence any variation of optimal trajectory enlarges the value of risk functional. □

5. Conclusions

Above, for simplicity, it was assumed that in the detection process of a UUV in passive mode using a linear antenna, bearing θ on the UUV is known. In fact, the bearing search for the target is carried out by additional optimization of statistics from observations, each of which depends on its direction θ to the target in the range ( π / 2 < θ < π / 2 ) . This means that the entire range of angles is divided into a finite number of angles (directions) θ m , m = 1 , M . For each one it is necessary to solve the detection problem, that is, to build observation statistics depending on the bearing θ m and then calculate and compare the corresponding detection probabilities. This procedure significantly increases the number of calculations. Therefore, in the future, an optimization method in the statistics space will be proposed, after which the probability of detection will be calculated only once.
When overcoming a particular network-centric system, the risk functional may consist of a weighted sum of the functions related to different search means. The UUV route planning problem in this case is reduced for example to a two-point variational problem or an optimal control problem in which the control variables enter into the permanent dispersion of the signal.

Author Contributions

Conceptualization, A.A.G.; methodology, A.A.G. and A.V.D.; software, V.P.Y. and P.V.L.; validation, V.P.Y.; formal analysis, A.A.G., A.V.D., P.V.L. and M.E.S.; investigation, A.A.G., V.P.Y. and P.V.L.; writing–original draft preparation, A.A.G., A.V.D., P.V.L. and M.E.S.; writing–review and editing, A.A.G., P.V.L., A.V.D., M.E.S.; visualization, V.P.Y. and P.V.L.; supervision, A.A.G.; project administration, A.A.G.; funding acquisition, A.A.G. All authors have read and agreed to the published version of the manuscript.

Funding

This paper was partially supported by Programm of Basic Research of RAS.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
UUVUnmanned underwater vehicle
UAVUnmanned aerial vehicle
SSSStationary sonar system
FFTFast Fourier transform

Appendix A. Proofs

Proof of Lemma 2
In polar coordinates ( r , φ ) the projections of velocity are
v r = d r d t , v φ = r d φ d t .
As one can see tangent of angle β equals
tan β = v φ v r = r d φ d r .
Let us perform the variable transformation, introducing ρ = ln r . Then Equation (A2) will become
tan β = d φ d ρ .
Then cos β can be written as
cos 2 β = 1 tan 2 β + 1 = d ρ 2 d φ 2 + d 2 ρ = ρ ˙ 2 ρ ˙ 2 + φ ˙ 2 .
The first part of functional Equation (24) is
v 2 r 2 = v r 2 + v φ 2 r 2 = r ˙ 2 r 2 + φ ˙ 2 .
Considering the new variable ρ , the last formula becomes
v 2 r 2 = ρ ˙ 2 + φ ˙ 2 .
After substituting Equation (A4) into Equation (24) the risk functional takes a form Equation (25). □
Proof of Lemma 5. 
To obtain velocity law depending from time let us substitute Equation (37) into Equation (A1):
v r ( t ) = r A T 0 ln r B r A exp t T 0 ln r B r A , v φ ( t ) = r A T 0 φ B φ A exp t T 0 ln r B r A .
Therefore the full velocity of the moving object while moving on the optimal trajectory changes according to law
v ( t ) = r A T 0 exp t T 0 ln r B r A ln 2 r B r A + φ B φ A 2 .
Then, since the derivatives of ρ and φ are
ρ ˙ = 1 T 0 ln r B r A , φ ˙ = 1 T 0 φ B φ A ,
one can easily obtain Equation (39). □
Proof of Lemma 6. 
The values of risks on each segment are calculated as follows
R A C * = ( ρ C ρ A ) 2 + ( φ C φ A ) 2 T 1 g arctan φ C φ A ρ C ρ A = a T 1 g ( β 1 ) , R C B * = ( ρ B ρ C ) 2 + ( φ B φ C ) 2 T 2 g arctan φ B φ C ρ B ρ C = b T 2 g ( β 2 ) ,
where
a = ( ρ C ρ A ) 2 + ( φ C φ A ) 2 , b = ( ρ B ρ C ) 2 + ( φ B φ C ) 2 ,
and
T 1 + T 2 = T .
Now we have to minimize the sum of R A C * + R C B * . Firstly, let us find optimal times T 1 and T 2 :
R A C * + R C B * = a T 1 + b T 2 min T 1 , T 2 .
Using the condition Equation (A7), this equation takes a form
R A C * + R C B * = a T T 2 + b T 2 .
To find the value T 2 that minimizes this sum, let us differentiate it by variable T 2 :
a ( T T 2 ) 2 b T 2 2 = 0 .
Is is easy to find
T 2 = T 1 + a b .
Thus T 1 equals
T 1 = T T 2 = T 1 + b a .
According to the lemma conditions we have
β 1 = β 2 = β m .
Now it is possible to use β m as a known value
φ C φ A ρ C ρ A = tan β m , φ B φ C ρ B ρ C = tan β m ,
One can express ρ C and φ C from this system:
φ C = φ A + φ B + ( ρ B ρ A ) tan β m 2 , ρ C = ρ A + ρ B + ( φ B φ A ) cot β m 2 ,
After substituting Equation (A15) into Equation (A6) variables a and b take a form
a = ( ( ρ B ρ A ) sin β m + ( φ B φ A ) cos β m ) 2 sin 2 2 β m , b = ( ( ρ B ρ A ) sin β m ( φ B φ A ) cos β m ) 2 sin 2 2 β m ,
Now it is possible to rewrite Equation (A9), using Equations (A16), (A12) and (A11) to obtain
R A C * = ( ( ρ B ρ A ) sin β m + ( φ B φ A ) cos β m ) 2 ( 1 + | ( ρ B ρ A ) sin β m ( φ B φ A ) cos β m ( ρ B ρ A ) sin β m + ( φ B φ A ) cos β m | ) sin 2 2 β m T g ( β m ) , R C B * = ( ( ρ B ρ A ) sin β m ( φ B φ A ) cos β m ) 2 ( 1 | ( ρ B ρ A ) sin β m + ( φ B φ A ) cos β m ( ρ B ρ A ) sin β m ( φ B φ A ) cos β m | ) sin 2 2 β m T g ( β m ) ,
As φ B φ A ρ B ρ A = tan β * , simplifying the equation above one can get the statement of the lemma. □

References

  1. Galyaev, A.A.; Maslov, E.P. Optimization of a mobile object evasion laws from detection. J. Comput. Syst. Sci. Int. 2010, 49, 560–569. [Google Scholar] [CrossRef]
  2. Kabamba, P.; Meerkov, S.; Zeitz, F. Optimal Path Planning for Unmanned Combat Aerial Vehicles to Defeat Radar Tracking. J. Guid. Control Dyn. 2006, 29, 279–288. [Google Scholar] [CrossRef]
  3. Sysoev, L.P. Criterion of detection probability on trajectory in the problem of object motion control in threat environment. Control Probl. 2010, 6, 65–72. [Google Scholar]
  4. Dogan, A.; Zengin, U. Unmanned Aerial Vehicle Dynamic-Target Pursuit by Using Probabilistic Threat Exposure Map. J. Guid. Control Dyn. 2006, 29, 723–732. [Google Scholar] [CrossRef]
  5. Galyaev, A.A.; Maslov, E.P. Optimization of the Law of Moving Object Evasion from Detection under Constraints. Autom. Remote Control 2012, 73, 992–1004. [Google Scholar] [CrossRef]
  6. Zabarankin, M.; Uryasev, S.; Pardalos, P. Optimal Risk Path Algorithms Cooperative Control and Optimization. In Cooperative Control and Optimization; Springer: Boston, MA, USA, 2002; Volume 66, pp. 271–303. [Google Scholar]
  7. Sidhu, H.; Mercer, G.; Sexton, M. Optimal trajectories in a threat environment. J. Battlef. Technol. 2006, 9, 33–39. [Google Scholar]
  8. Pachter, L.S.; Pachter, M. Optimal path for avoiding a radiating source. In Proceedings of the 40 IEEE Conference on Decision and Control (Cat. No.01CH37228), Orlando, FL, USA, 4–7 December 2001; pp. 3581–3686. [Google Scholar]
  9. Causa, F.; Fasano, G.; Grassi, M. Multi-UAV Path Planning for Autonomous Missions in Mixed GNSS Coverage Scenarios. Sensors 2018, 18, 4188. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  10. Guo, S.; Zhang, X.; Zheng, Y.; Du, Y. An Autonomous Path Planning Model for Unmanned Ships Based on Deep Reinforcement Learning. Sensors 2020, 20, 426. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  11. Wen, Z.W.; Li, M.K.; Wang, L.J. Path Planning for UUV in Dynamic Environment. In Proceedings of the 2016 9th International Symposium on Computational Intelligence and Design (ISCID), Hangzhou, China, 10–11 December 2016; pp. 211–215. [Google Scholar]
  12. Cai, W.; Zhang, M.; Zheng, Y.R. Task Assignment and Path Planning for Multiple Autonomous Underwater Vehicles Using 3D Dubins Curves. Sensors 2017, 17, 1607. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  13. Panda, M.; Das, B.; Subudhi, B.; Pati, B.B. A Comprehensive Review of Path Planning Algorithms for Autonomous Underwater Vehicles. Int. J. Autom. Comput. 2020. [Google Scholar] [CrossRef] [Green Version]
  14. Ma, S.; Wang, Y.; Zou, N.; Liang, G. A Broadband Beamformer Suitable for UUV to Detect the Tones Radiated from Marine Vessels. Sensors 2018, 18, 2928. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  15. Shaikin, M.E. On statistical risk funstional in a control problem for an object moving in a conflict environment. J. Comput. Syst. Sci. Int. 2011, 1, 22–31. [Google Scholar]
  16. Andreev, K.V.; Rubinovich, E.Y. Moving observer trajectory control by angular measurements in tracking problem. Autom. Remote Control 2016, 77, 106–129. [Google Scholar] [CrossRef]
  17. Galyaev, A.A.; Lysenko, P.V. Evasion of moving object from single detector at given velocity. Control Probl. 2020, 1, 83–91. [Google Scholar]
  18. Galyaev, A.A. On the detection functional in motion of an object in a threat environment. Autom. Remote Control 2010, 71, 634–639. [Google Scholar] [CrossRef]
  19. Sidhu, H.; Mercer, G. Two continuous methods for determining a minimal risk path through a minefield. Anziam. J. 2006, 48, 293–306. [Google Scholar]
  20. Otnes, R.K.; Enochson, L. Applied Time Series Analysis; John Wiley and Sons: New York, NY, USA, 1978. [Google Scholar]
  21. Lehman, E.L. Testing Statistical Hypotheses; Wiley: New York, NY, USA, 1986. [Google Scholar]
  22. Monzingo, R.A.; Miller, T.W. Introd. Adapt. Arrays; John Wiley Interscience Publication: New York, NY, USA, 1986. [Google Scholar]
  23. Alekseev, V.M.; Galeev, E.M.; Tikhomirov, V.M. Collection of optimization problems; Fizmatlit: Moscow, Russia, 2005. [Google Scholar]
Figure 1. Dependence G ( α ) .
Figure 1. Dependence G ( α ) .
Sensors 20 02076 g001
Figure 2. The moving object in the Cartesian coordinate system with sensor S.
Figure 2. The moving object in the Cartesian coordinate system with sensor S.
Sensors 20 02076 g002
Figure 3. Rectangular triangle of velocity vectors v , v r and v φ .
Figure 3. Rectangular triangle of velocity vectors v , v r and v φ .
Sensors 20 02076 g003
Figure 4. Radiation pattern of the object.
Figure 4. Radiation pattern of the object.
Sensors 20 02076 g004
Figure 5. Radiation pattern (left) and extremal paths (right).
Figure 5. Radiation pattern (left) and extremal paths (right).
Sensors 20 02076 g005
Figure 6. Radiation pattern (left) and extremal paths (right).
Figure 6. Radiation pattern (left) and extremal paths (right).
Sensors 20 02076 g006

Share and Cite

MDPI and ACS Style

Galyaev, A.A.; Dobrovidov, A.V.; Lysenko, P.V.; Shaikin, M.E.; Yakhno, V.P. Path Planning in Threat Environment for UUV with Non-Uniform Radiation Pattern. Sensors 2020, 20, 2076. https://doi.org/10.3390/s20072076

AMA Style

Galyaev AA, Dobrovidov AV, Lysenko PV, Shaikin ME, Yakhno VP. Path Planning in Threat Environment for UUV with Non-Uniform Radiation Pattern. Sensors. 2020; 20(7):2076. https://doi.org/10.3390/s20072076

Chicago/Turabian Style

Galyaev, Andrey A., Alexander V. Dobrovidov, Pavel V. Lysenko, Mikhail E. Shaikin, and Victor P. Yakhno. 2020. "Path Planning in Threat Environment for UUV with Non-Uniform Radiation Pattern" Sensors 20, no. 7: 2076. https://doi.org/10.3390/s20072076

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop