Combined AGADESN with DBSCAN Algorithm for Cluster Target Motion Intention Recognition
In this paper, we consider the problem of motion intention recognition for cluster targets with splitting behaviour and lack of motion prior information. This is a challenge to the classical Bayesian inference based intention recognition algorithms because they rely heavily on a priori knowledge. In order to solve these problems, a joint algorithm of deep echo state network optimized by adaptive genetic algorithm (AGADESN) and DBSCAN clustering algorithm is proposed in this paper. We use improved Olfati-Saber model with direction noise to generate cluster motion and use the cluster motion data to drive AGADESN algorithm to predict cluster destination, which achieves higher destination prediction accuracy than DESN algorithm. We innovatively design the motion similarity distance (MSD) and take the destination prediction output as one of the distance inputs, alleviating the lack of differentiation among different cluster targets caused by only relying on speed and position distance at the early stage of cluster motion. Based on the MSD, DBSCAN clustering algorithm is used to identify clusters in the field of view to determine whether splitting behaviour occurs. Simulation results demonstrate the effectiveness of the proposed algorithm in cluster target motion intention recognition and its superiority over DESN algorithm and DBSCAN algorithm only based on speed and position distance.
In recent years, the recognition and prediction of the moving intention of cluster targets have attracted extensive attention. Cluster target intention recognition and prediction refers to the automatic evaluation and prediction of a certain goal or plan to be achieved by the cluster target in the region. It is an important function of situation analysis and belongs to the high-level processing part of the data fusion system . At present, UAV cluster has been used in environmental detection, target tracking, and other aspects and has also been widely used in several recent regional conflicts. Solving the problem of cluster intention recognition would help better solve the problems of UAV cluster control [2, 3], target tracking , path planning [5, 6], etc. In particular, in UAV path planning, it is very important to effectively infer the intention of UAV clusters to solve the coverage path planning problem [7, 8]. However, due to the difficulty of modeling cluster trajectory, the lack of prior information about the motion and the existence of multiple motion patterns such as splitting and merging, it is difficult to recognize cluster motion intention. In addition, some clusters have strong autonomous ability, obvious heterogeneous characteristics and automatic path planning ability, which brings more difficulties to the recognition of cluster motion intention [9, 10].
In order to solve these problems, it is necessary to establish a reasonable collaborative motion model of cluster targets. A pioneering study by Reynolds  demonstrated that cluster motion follows three basic collaborative rules: separation, speed matching, and aggregation. A similar approach is proposed by Vicsek et al. , who believed that the collaborative motion comes from adjusting the speed of cluster members to the average speed in their neighbourhood. Other studies have focused on the dynamic behaviour of clusters. For example, Couzin et al.  attempted to explain the clustering phenomenon under effective guidance and group decision-making. However, clusters described only by three basic collaborative rules are prone to fracture due to the dispersion of member positions. On the basis of the basic rules, Olfati-Saber  designed and added the virtual leader in order to solve the problem of cluster fracture. However, the assumption in the basic Olfati-Saber model that the virtual leader information is accurate all the time is too idealistic. Considering the difficulty of virtual leader information acquisition in the actual cluster movement process, Gaussian noise with time-varying variance is introduced to make the cluster cooperative motion model more realistic.
Traditional cluster target intention recognition mainly relies on Bayesian network inference framework . Bayesian reasoning has the advantages of dealing with the inherent uncertainty of sensor data and the inherent semantic fuzziness of intention recognition, supporting the relearning of reasoning network parameters [16, 17]. In order to overcome the problem of aircraft carrier group target intention reasoning in multidomain operations and multientity hierarchical, Bayesian network is used by Qiao et al. . However, model-driven Bayesian reasoning inevitably needs to use the prior statistical information of the target, which is usually difficult for us to obtain. Especially in the military field, the random, sudden, and unknown maneuver of enemy UAV cluster targets further increase the difficulty of obtaining prior information.
In recent decades, sensor and computer technology have promoted the rapid development of big data processing. In particular, deep learning and neural networks have made many impressive advances and have excellent performance in intention recognition [19, 20]. In order to recognize and predict the motion intention of cluster targets, the data-driven neural network method needs to use the target motion sequence information. Echo state network (ESN) is widely used in time series prediction because of its simple structure and efficient training . However, the motion sequence information of cluster targets is more complex, and the prediction ability of ESN is insufficient. Accordingly, some scholars have proposed a deep echo state network (DESN) model [22, 23].
In this paper, we divide cluster target intention recognition into two parts: destination prediction and cluster identification. Song et al.  used DESN to predict taxi destination. However, in order to achieve the lowest learning error, arbitrarily set network parameters may not guarantee the best training results of DESN. Chen and Zhang and Lu et al. [25, 26], respectively, used grey wolf algorithm and genetic algorithm (GA) to optimize DESN parameters. However, in the process of application, we find that DESN optimized by GA converges slowly, and the parameter optimization result after convergence is not ideal. Accordingly, we further develop the optimization process of GA and propose a genetic algorithm with adaptive mutation rate  to optimize DESN.
In terms of cluster identification, Snidaro et al. used the evidence reasoning algorithm in D-S evidence theory, with the help of prior knowledge and multisensor detection information, to complete the identifying and clustering of targets. Oxenham et al.  extracted the situation elements of Bayesian network and used data mining to achieve target clustering. However, due to the small size of the cluster target members, under the existing detection conditions, the members attribute information is difficult to obtain. Moreover, the cluster motion prior information is difficult to obtain, so traditional clustering algorithm is still one of the most effective cluster identification algorithms.
Clustering algorithms mainly include data-based clustering algorithms and parameter-likelihood-based clustering algorithms . Data-based clustering algorithms include hierarchical clustering  and partitioned clustering such as k-means estimator . Density-based noise application spatial clustering (DBSCAN) is a typical data-based clustering algorithm [33, 34], which can be used to solve the clustering problem with uncertain data. However, when the distance between target members is close, the performance of DBSCAN algorithm decreases. This paper defines a new distance measure based on destination prediction, which is called motion similarity distance (MSD). At this distance, DBSCAN algorithm is applied to cluster identification, and a good clustering effect is achieved.
A joint algorithm of AGADESN and DBSCAN is proposed to solve the problem of cluster target motion intention recognition under the condition of lack of motion prior information and cluster splitting. The main contributions of this paper are described as follows: (1)The direction noise with time-varying variance is introduced to improve the virtual leader. Under the framework of Olfati-Saber model, a more practical cluster target collaborative motion model is proposed. The proposed algorithm takes into account the source of command information when the cluster is moving, describes the process of gradually reducing the noise in the moving direction as the cluster approaches the destination, and considers the compensation of the cluster speed for the noise interference(2)The adaptive mutation rate is introduced into the genetic algorithm, and the adaptive genetic algorithm with faster iteration speed is used to optimize the parameters of the DESN. The AGADESN algorithm is proposed(3)Based on the cluster motion model proposed in this paper, the cluster motion trajectory dataset for training and test is established, and under the sliding window structure, the cluster motion destination is predicted by using AGADESN model. Experimental results show that our algorithm improves the correct prediction ratio of basic DESN algorithm by 8.39%.(4)A new distance measure MSD is proposed, which combines the predicted destination distance with the position distance and speed distance, and the DBSCAN algorithm is used to identify the cluster to judge the splitting behaviour on the MSD. The experimental results show that the DBSCAN algorithm using MSD can quickly identify the clusters in the sensor field of view and has stronger robustness when the number of clusters changes.
The rest of this paper is organized as follows. In Section 2, improved Olfati-Saber is used to describe the cluster collaborative motion. In Section 3, we introduce the joint algorithm of motion intention recognition. Section 4 analyses the generated cluster motion trajectory and gives the results and discussion of the motion intention recognition simulation experiment. Section 5 summarizes the paper.
2. Cluster Collaborative Motion Model
2.1. Fundamentals of the Olfati-Saber Model
The Olfati-Saber cluster collaborative motion model adds a virtual leader on the basis of the three cluster collaborative motion principles of separation, speed matching and aggregation. All members of the cluster can obtain the position and speed information of the virtual leader. After simplifying the cluster members into the particle model, at time , the Olfati-Saber model describes the motion of member as follows:
where and are the position and speed vectors of member at time , respectively. is the control input of member at time . According to the principle of cluster collaborative motion proposed by Olfati-Saber model, is designed as follows:
where is the separation and aggregation control input, which is used to adjust the spacing between members to avoid collisions between members. is the speed matching control input, which ensures the information transmission within the cluster, makes the cluster topology have weak connectivity, and realizes the gradual consistency of the members’ speed. is the control input of the virtual leader, which is used to plan the overall motion path of the cluster.
The description of is shown as follows:
where represents the σ-norm, and its calculation method is shown as follows:
Here, the fixed parameter is .
denotes the σ-norm distance between member and member . represents the set of members in the neighbourhood of member that can interact with member . Neighborhood can be selected according to different metrics, and widely used distance metrics include Euclidean distance and topological distance [35, 36].
represents the potential energy function, which needs to meet the requirements of continuity, differentiability, and nonnegativity, and its magnitude is related to the distance between the two members. represents the gradient of the potential energy function, so as to convert the potential energy into the separation and aggregation control input.
The form of is defined as follows:
where is the expected distance between members after the member speed converges. is the transformation form of σ-norm distance of and .
is the potential force function between members. When the distance between member and member is less than the distance threshold, there is repulsive force between them to prevent collision. Otherwise, there is an attractive force to promote the cluster aggregation. The expression of is as follows:
where is the finite cut-off point, and . represents the maximum distance that information interaction can occur between members. is the smooth scalar function with a value range of [0, 1] . The introduction of makes the potential force have limited extreme values and makes the spatial adjacency matrix smoother, which is defined as follows:
is a nonuniform s-shaped function, expressed as follows:
To ensure , the parameters in the Equation (8) need to meet and .
The description of is shown as follows:
And forms the spatial adjacency matrix.
The description of is shown as follows:
where and are the coefficient of the virtual leader, and only the position matching or speed matching between the cluster members and the virtual leader can be considered in the assignment process to make or .
2.2. Virtual Leader Model with Direction Noise
In this paper, during the motion of the cluster to the destination, the position of the virtual leader at each time is taken as the center of the cluster. So, the position matching parameter . Considering only the speed matching with the virtual leader, the speed magnitude and direction vector of the virtual leader at time are given as follows:
where represents the total time for the cluster to move to the destination. represents the position of the virtual leader at time , that is, the position of the cluster center. indicates the destination location at time . is the speed compensation parameter, which meets . is the motion direction of the virtual leader at time . Because there is noise when obtaining ; it is a random variable.
Generally, as the cluster approaches the destination, the more accurately the cluster detects the position information of the destination, the smaller the noise of direction would be. Therefore, we model as a Gaussian distribution that obeys time-varying variance, that is, . Where is the accurate direction and is its time-varying variance, which is defined as follows:
where is the noise variance control coefficient.
Due to the influence of noise, the speed of the virtual leader moving to the destination is always a component of , so it is necessary to add the coefficient to compensate. The is related to , and . The mean value of noise is compensated, so the following results can be obtained by solving .
Generally, the value of is very small to guarantee . When this is true, . According to Equation (15), as the virtual leader approaches the destination, approaches 0 and approaches 1.
3. Cluster Motion Intention Recognition Method
3.1. Intention Recognition Process
Because splitting or merging behavior would occur in the process of cluster moving to the destination, we divide the cluster target motion intention recognition into two parts: destination prediction and cluster identification. We would use the deep echo state network optimized by adaptive genetic algorithm (AGADESN) and DBSCAN clustering algorithm to solve the above two problems. The method process is shown in Figure 1.
As shown in Figure 1, we use the improved Olfati-Saber model with direction noise to generate a cluster motion trajectory dataset, which is divided into two parts: training dataset and test dataset. The datasets are input into AGADESN. The training dataset is used for network training and parameter optimization, and the test dataset is used for destination prediction. The destination prediction output and the predicted destination distance are generated through this process. The predicted destination distance, position distance, and speed distance of the test set are fused to produce the motion similarity distance (MSD). Based on the MSD, the DBSCAN algorithm is used to cluster the targets, and the cluster identification output is generated. The specific operation steps of intention recognition method would be described in the next section.
3.2. Destination Prediction Based on AGADESN
3.2.1. Method of Destination Prediction by DESN
Because the target trajectory is constantly updated to the destination in the process of target motion, we need to obtain multiple destination predictions at different stages of the trajectory. To this end, we design a 1-dimensional sliding window structure, as shown in Figure 2. The sliding window length is , and each sliding length is . The first prediction starts when the obtained trajectory length meets the sliding window length. When the update length of track points meets the sliding length, the sliding window updates the training and test data for the second prediction. If the target trajectory update ends after the mth prediction, all destination predictions are completed on the whole trajectory.
The DESN structure used for each prediction is shown in Figure 3. DESN combines echo state network (ESN) with deep learning idea, and adds multiple reservoir structures as hidden layers on the basis of ESN, so that DESN can map more complex time series characteristics.
The working mechanism of DESN is as follows. During the mth prediction, the external data enters the input layer and enters reservoir 1 after being weighted by the input weight . The state of reservoir 1 at the previous time is weighted by the weight and summed with the received weighted external input. After the activation function, a new state is generated as the state of reservoir 1 at the current time, and the state is used as the input of reservoir 2. After repeating the above work process, the state of the last reservoir is obtained. The set of all reservoir states is recorded as , and the output is generated by the activation function after the output layer is affected by the output weight. Among them, the maximum number of layers is called depth, and the network requires a total of neurons.
In Equation (16), taking the reservoir as an example, and represent the input weight and reservoir weight, respectively. represents the noise of the reservoir, and is the input data. is the updated reservoir state, and is the weighted input data of the reservoir. In Equation (17), represents the external input data. In Equation (18), represents the leakage parameter of the reservoir , and . represents the activation function. Generally, is selected as the hyperbolic tangent function. In Equation (19), represents the output data, and is the output weight. represents the activation function of the output layer, and is usually selected.
DESN’s training and test process are as follows. The training process of the mth prediction is essentially the training of the output weight matrix . Firstly, the network parameters are initialized, and the random algorithm is used to generate the input weight , reservoir weight , and noise of the DESN, which remain unchanged during the training process. Secondly, if the trajectory sequence is of targets in the sliding window at the mth prediction, the trajectory sequence of the target is as follows:
Divide into training sample and test sample . Input the training sample one by one, so as to obtain all reservoir state matrices . Finally, calculate the training output weight . If the destination prediction position output corresponding to the training sample is , the output weight of the DESN for destination prediction can be obtained according to Equation (21).
where represents a small positive number , and represents the identity matrix. Among them, the destination prediction of the target i is as follows:
represents the predicted destination position of the th trajectory sample at time . After the training, input the test sample to test the learning effect of the DESN, which can output the destination prediction according to Equation (19) under the trained output weight .
3.2.2. Optimization of DESN Parameters by Adaptive Genetic Algorithm
DESN has reliable time series prediction ability. However, like other deep learning algorithms, its prediction effect is limited by the selection of parameters. The parameters that have the greatest impact on the effect of the algorithm include the number of reservoirs , the number of reservoir nodes , and the spectral radius . is one of the most important central parameters representing the reservoir weight matrix.
In order to solve the problem of choosing DESN parameters, we use an adaptive genetic algorithm (AGA) with variable mutation rate to optimize the parameters. Compared with traditional genetic algorithm, it can avoid premature convergence and fall into local optimization. The mutation rate of the AGA uses pseudoderivative to consider the time that GA stays at a certain point. The longer the algorithm stays at the local optimal value, the greater the possibility of mutation.
Taking the mth prediction as an example, firstly, the parameters of the DESN model are chromosome encoded to correspond to the genetic operator of the AGA. The encoded chromosome of DESN model parameters is as follows:
Secondly, the fitness function is established to guide the search process of AGA. The design of fitness function affects the convergence speed and prediction accuracy of the algorithm. Generally, the fitness function is converted from the error function of DESN model. For the DESN model, the destination prediction error is naturally regarded as the fitness function. Therefore, the corresponding fitness function of the mth prediction is as follows:
where represents the average prediction error of destination position when chromosome is the DESN model parameter.
Finally, according to the chromosome and fitness function established by AGADESN model, the best chromosome is selected through adaptive genetic operation. In the model, the selection operation  and crossover operation  are consistent with the traditional GA. In the mutation operation, the adaptive mutation rate based on the derivative of fitness function to generation is as follows:
where is the adaptive mutation rate, and sigmoid function is defined as follows:
where is defined as follows:
Here, represents the current generation, and represents the oldest generation with the same optimal fitness. , thus, is inversely related to the derivative of the fitness function with respect to generation.
The implementation steps of AGADESN are shown in Figure 4.
As the figure shows, the specific steps are as follows:
Step 1. Input training data, initialize DESN model parameters , , and .
Step 2. Encode the parameters of DESN model and initialize the chromosomes in the population.
Step 3. The best chromosome is selected by genetic manipulation and fitness evaluation.
Step 4. Decode the optimal chromosome to obtain the optimal parameters of the DESN model.
Step 5. Input training data and train DESN model weight .
Step 6. Input test data to obtain destination prediction results.
3.3. Cluster Identification Based on DBSCAN
3.3.1. Definition of Motion Similarity Distance
According to the cluster collaborative motion model, in the process of moving towards the destination, the members of the same cluster are close to each other and have similar speed vectors, which are the basis for us to cluster the target to identify the cluster. However, a fact that may be ignored is that the same cluster members also have similar destination position predictions, which provide additional information for us to identify clusters.
In 2-dimensional case, the motion state vector of target at time is , and the prediction value of destination is . Due to the sliding window structure, there may be more than one predicted value of the track point at time t, so is the mean value of all predicted values, as shown in Equation (28).
where Z is the number of destination position predicted values at the track point at time t. represents the th predicted value.
We define a new distance measure, which is called motion similarity distance (MSD). The MSD between member and member is shown in Equation (29).
Among them, , , and are the speed distance, position distance, and predicted destination distance, respectively. The weight represents the importance of different distances, and . , , and are the standard deviation of the corresponding distance. The distances are calculated as follows:
where describes the expected distance of members. describes the extended range of destinations.
3.3.2. Principle of DBSCAN Cluster Identification
DBSCAN is an effective density-based clustering algorithm, which can describe the density of data distribution, and then identify clusters of arbitrary shape and effectively distinguish noise points. DBSCAN algorithm sets a field with a radius of Eps around each target data point. If the number of other target data points in a target field reaches the set threshold MinPts, it is considered that the target belongs to the cluster and is the core point. If there are no other target data points in the neighborhood of a target, the target is considered to be a noise point. If there are target data points in the target field, but the number of data points does not meet MinPts, it is considered that the target is a boundary point. Figure 5 shows the schematic diagram of the DBSCAN algorithm.
As shown in Figure 5, the radius of the circle is the clustering radius Eps and set . It can be seen from the figure that the number of data points in the neighborhood of targets (2, 3, 4, 5, and 6) is greater than o they are core points. There are only points 2 in the neighborhood of data point 1, so point 1 is a boundary point. There are no other targets in the neighborhood of data point 7, so it is a noise point. We can obtain that (1, 2, 3, 4, 5, and 6) belong to the same cluster. The DBSCAN algorithm flow is as follows:
4. Experiments and Results
4.1. Generate Datasets
In order to verify the effectiveness of the algorithm proposed in this paper, we generate a cluster cooperative motion simulation dataset based on the improved Olfati-Saber model. This algorithm uses the combination of AGADESN and DBSCAN algorithms to identify the motion intention of cluster targets. The total number of targets in the field of view is .Targets are released in the range of , and the initial speed in both and directions is 0 m/s. The number of clusters is random, but there are at least 3 targets in a cluster, that is, the number of clusters in the field of view is . Total movement time , and sampling interval . 5 destinations are set to form a destination set, and the position of each destination is shown in Table 1.
In the simulation, the destination of the cluster motion is randomly determined and can be changed during the cluster motion, but in order to ensure the stability of the trajectory, the destination can be changed again only after the destination is determined for the first time or changed for at least 25 s.
Set the Olfati-Saber model parameters and , then the corresponding . Set parameter , select and , then the corresponding and . Only consider the speed collaboration with the virtual leader, and set the parameters , , and . Set the noise variance control coefficient .
Under the above simulation conditions, 100 cluster motion scenes are generated, and a total of 1500 tracks are obtained; 80% of which are used for training and 20% for test. The generated dataset is shown in Figure 6.
As can be seen from Figures 7 and 8, the motion of each target is chaotic at the initial stage of release. With the mutual cooperation of the targets in the same cluster, the speed of the targets in the same cluster gradually tends to be the same, and three different clusters are gradually formed. Around 33 s, the cluster moving towards destination D1 splits and gradually forms cluster C2 and C3. After C2 changes the destination and moves for a period of time, it changes the destination to D1 again and arrives. C3 finally arrives at D3. At about 66 s, the clusters moving towards destination D4 splits and gradually forms cluster C4 and C5. C4 and C5 finally arrive at D4 and D5, respectively. In the late stage of target motion, the speed of each target in the same cluster tends to be consistent, and the trajectory is gradually parallel, and the cluster forms a stable structure. It can also be found from Figure 8 that due to the time-varying variance of the direction noise, the mean value of the noise at the initial time is large, and the trajectory has great instability. As the target approaches the destination, the mean value of the noise approaches 0, and the cluster speed is smoother.
4.2. Destination Prediction Results
In order to verify the superiority of the proposed algorithm, we use the algorithm in this paper, the DESN algorithm optimized by genetic algorithm (GADESN) and the DESN algorithm to predict the destination of cluster targets, respectively. Set the sliding window length , and each sliding length , then times of destination prediction is required to make the sliding window traverse the whole trajectory. The calculation method of is as follows:
The root mean square error (RMSE) is used to evaluate the prediction performance of the AGADESN model, which is defined as follows:
Under the above sliding window setting,
Set reservoir leakage parameters . The number of reservoirs , the number of neurons in each reservoir, and the spectral radius are given by AGA in AGADESN algorithm and by GA in GADESN algorithm. In the DESN algorithm, we set , , and . Taking the 46th prediction as an example, the iteration trajectory of the AGA and the GA are shown in the following figure.
It can be seen from Figure 9 that the fitness value of the adaptive genetic algorithm has converged when iterating to generation 46, with a fitness value of 42.6, and the genetic algorithm has converged when iterating to generation 74, with a fitness value of 48.3. Adaptive genetic algorithm has faster convergence speed and better fitness value, so AGADESN model has faster iteration speed and better prediction accuracy.
The destination position prediction RMSE of the cluster in Figure 7 is shown in the following figure.
It can be seen from Figure 10 that as the cluster approaches the destination, although the destination position prediction RMSE of AGADESN algorithm fluctuates, on the whole, RMSE tends to decrease gradually. The RMSE of all clusters can be reduced to less than 100 m before the end of the motion. Since there is no destination change in C4, the algorithm can determine the destination very early and maintain RMSE at a low level. When the destination of C2 changes again in the late stage of motion, the algorithm can also quickly catch the new destination, and the RMSE gradually decreases.
In the figure, the circle with the destination as the center and 300 m as the radius can distinguish different destinations in the destination set, which is called the destination range. Generally, if the destination set is known, we do not need to get the accurate destination prediction position of the target, but only need to specify which destination range the predicted value is in to determine the destination. If the mean value of all the destination position predicted values on a certain trajectory point is within the range of the real destination, we call the prediction on this trajectory point the correct prediction. Under the above definition, the condition for correct prediction in this experiment is that the mean absolute error (MAE) of all predicted values at a certain trajectory point is no more than 300 m. The MAE() is defined as follows:
Figure 11 gives the average RMSE of destination position prediction for all cluster in the test set by the AGADESN, GADESN, and DESN algorithms.
RMSE is computed differently from MAE and according to holder inequality, there always holds . Therefore, the RMSE threshold for correct prediction is always not less than the destination range. But without knowing how optimistic the predicted value is, we take the RMSE threshold of the correct prediction to be its lower bound 300 m, as indicated by the red dotted line in the figure.
Figure 11 shows that in the initial stage, before the target destination changes, all 3 algorithms can predict the approximate position of the destination. Comparatively, AGADESN algorithm achieves the correct prediction at 12 s, which is 8 s earlier than GADESN algorithm. Some of the targets change their destinations around 30 s and 50 s; the RMSE of 3 algorithms increases, and after recognizing the new destinations, the RMSE returns to a lower level. After a second destination change maneuver of targets occurs, the AGADESN algorithm achieves more stably correct predictions in 55 s, whereas the GADESN and DESN algorithms need 70 s. The AGADESN algorithm has a better effect, both in terms of prediction accuracy and in the time to achieve the correct prediction.
In the whole process of target motion, the correct prediction proportion of destinations of all clusters in the test set is shown in Figure 12.
In Figure 12, we plot the proportion of correct predictions of destinations for the test set clusters at 5 s intervals. It is known from the figure that the AGADESN algorithm can correctly predict about 40% of the cases when no destination change occurs. When the destination of the cluster motion is changed, the proportion of correct predictions decreases for 3 algorithms. However, the proportion of correct predictions improves faster for the AGADESN algorithm after 55 s. Throughout the trajectory, the proportion of correct predictions by the AGADESN algorithm proposed in this paper is generally higher than that by the other comparison algorithms, increasing by 8.39% the proportion of correct predictions by the DESN algorithm.
4.3. Cluster Identification Results
To demonstrate the effectiveness of DBSCAN algorithm based on the motion similarity distance proposed in this paper for cluster identification, we set the distance parameters , , , , and after obtaining the destination position predictions. Solving for the , , and distances for each moment of target 1 and target 7 belonging to different clusters are shown in Figure 13. Among them, target 1 belongs to ; initial destination is , and final destination is after 33 s. Target 7 belongs to ; initial destination is , and final destination is after 32 s.
It is known from Figure 13 that the initial moment, because the target release point is concentrated, the two targets are relatively close together, and the speed difference is not great, so that the and of the two targets are both smaller in the motion early stage. But because the predicted destinations of the two targets are quite different, the distance difference is obvious in the motion early stage. In the motion late stage, after the two targets turning, the distance starts to decrease due to the closer distances between the and . But and distances increase. Thus, the MSD defined in this paper, which fuses the , , and distances, can effectively compensate for the main time of action of the three distances, such that targets belonging to different clusters have large distances consistently throughout the motion.
Set DBSCAN algorithm parameters ; , and . Clusters are identified throughout using the DBSCAN algorithm based on the MSD, and Figure 14 shows the cluster identification results for in the motion early stage; in the splitting stage, and in the motion late stage.
In the early stage of cluster motion, the release area of cluster is small, and the target belonging to the same cluster has not completed speed collaboration. Because the MSD integrates position, speed, and predicted destination distances, the result of cluster identification has crossover in the position plane. When , different clusters begin to differentiate in the field of view of the sensor. When cluster splits, different cluster positions are far away from each other, so the algorithm in this paper can easily distinguish different clusters and effectively identify the newly born clusters. In the late stage of cluster motion, the algorithm can maintain the accuracy of cluster identification, but when clusters and arrive at at the same time, the algorithm identifies and as the same cluster. This is because the speed distance when the cluster arrives at the destination plays a major role in distinguishing clusters, and the contribution of the speed distance to the MSD decreases when the predicted destination distance is introduced, which has an impact on the identification result. But on the other hand, if two clusters arrive at the same destination at the same time, whether the two clusters merge or not would not affect our further decision.
Figure 15 shows the comparison of cluster identification results by DBSCAN algorithm based on the proposed MSD and based on only position and speed fusion distance (PSD), where the DBSCAN algorithm based on the PSD is set to .
As can be seen from Figure 15, at the initial stage of cluster motion, due to the small distance difference between targets, the identification results of DBSCAN algorithm are often inaccurate. When the target is splitting, the identification result lags behind the time of splitting and fluctuates. By comparison, DBSCAN algorithm based on the MSD has higher identification accuracy and stability than that only considering position and speed distance. Especially in the initial stage of cluster motion, the introduction of the predicted destination distance significantly makes up for the deficiency of only considering position and speed distance.
4.4.1. Selection of Eps
The selection of Eps has an impact on DBSCAN algorithm. In order to evaluate the significance of Eps influence, we increase Eps from 0.01 to 1 with the step size of 0.01, and set appropriate distance parameters for all cluster scenarios in the test set to conduct cluster identification experiments. The correct identification probability of cluster number is shown in Figure 16.
As can be seen from Figure 16, although Eps can be set arbitrarily within [0.01, 1), the DBSCAN algorithm can obtain a good correct identification probability under any Eps. However, with the increase of Eps, the probability still shows a process of first increasing and then decreasing. When Eps is set in (0.3, 0.4), the correct identification probability is the highest. The analysis shows that Eps setting value is related to a variety of factors and is most closely related to the distance between clusters during the whole motion of clusters. When clusters are close to each other, if Eps is set too small, members in the same cluster may be considered as belonging to different clusters, resulting in a large number of identified clusters. On the contrary, if Eps is set too large, the number of identified clusters may be less. Therefore, for the whole process of cluster motion, the adaptive setting of Eps can achieve the best cluster identification effect.
4.4.2. Algorithm Runtime Evaluation
Figure 17 shows the training time of AGADESN algorithm for each destination prediction. It can be seen from Figure 17 that the average training time for each prediction of AGADESN algorithm is 607 s, of which the iteration time for adaptive genetic algorithm is 83 s, and the time for DESN training is 524 s. It can be seen that because the adaptive genetic algorithm embeds the DESN training process, the algorithm needs to calculate the DESN training error in each iteration, so the DESN training time accounts for the main part of the AGADESN algorithm training time. This also leads to the long training time of the algorithm. The adaptive genetic algorithm proposed in the paper uses adaptive mutation rate, and its genetic operation iteration time is short. Comparing the training time of each destination prediction, it can be seen that when the target is maneuvering, the time required for algorithm training increases because the destination position is unknown after maneuvering. When the target approaches the destination, the cluster moves straight toward the destination with less noise, and the algorithm training time is reduced.
Figure 18 shows the average recognition time of our algorithm for the cluster intention in a single test scenario. The average time of intention recognition of the trained network in a single scene is 0.1221s, including 0.0988 s for destination prediction and 0.0233 s for cluster identification. It can be seen from Figure 18 that the algorithm has a fast intention recognition speed for 15 targets in a single test scenario, and the destination prediction time accounts for the main part of the algorithm’s running time. Because DBSCAN algorithm has no deep structure, it has higher efficiency. Its clustering identification speed is fast and can meet the real-time requirements.
From the above analysis, it can be seen that the trained network can quickly identify the cluster motion intention, which makes the algorithm applicable to the prediction of large-scale cluster motion intention. However, because AGADESN algorithm directly uses the training error of DESN as the fitness evaluation function in the training process, it takes a long time for a single iteration of AGADESN, which makes the algorithm unable to meet the requirements of online real-time training, which limits the training speed of the algorithm in large-scale data sets.
4.4.3. Exploration of Further Improving the Accuracy of Intention Recognition
In this paper, in order to accurately simulate more the cluster motion, we introduce the motion direction noise with time-varying variance on the basis of the basic Olfati-Saber model. However, the cluster motion trajectory noise makes the relationship between the motion characteristics and the destination more unclear, which has a negative impact on the prediction of the cluster motion destination. In order to alleviate the interference of noise and extract more motion features related to the destination, we try to decompose the cluster motion trajectory signal by using the variational mode decomposition (VMD) algorithm . Due to the independence of different modality data, it is possible to further improve the accuracy of destination prediction by inputting different modality data into the circular convolution attention network to fuse different features for destination prediction .
We define the motion similarity distance and introduce the destination prediction distance into the position speed distance to judge whether multiple targets belong to the same cluster, which achieves better cluster recognition effect. However, when the cluster splits, the effect of DBSCAN algorithm in identifying clusters fluctuates and lags, which brings challenges to the real-time performance of the algorithm. During the experiment, we realize that the improvement of the clustering identification effect is essentially due to the introduction of additional information (destination information). Therefore, in order to improve the real-time performance of the cluster recognition algorithm, further information mining of the cluster motion trajectory is needed.
In terms of hardware, we can use infrared, photoelectric and other sensors to obtain the multidimensional information of the target, but we must propose better feature selection and fusion algorithms. Chen et al.  proposed two deep learning frameworks to explore and preserve the temporal and spatial information of EEG signals in a cascade or parallel manner and achieved good results in human intention recognition, which is enlightening to us. The basis of cluster identification is that targets with similar features should have a greater probability of being neighbours. We can use more complex convolutional neural networks to explore the local structure of clusters and integrate it into the selection of joint features . Secondly, the cluster identification should be carried out in a more adaptive way, using an adaptive loss function to enhance the robustness to system noise, which may be caused by wrong destination prediction or by abnormal parameter values of DBSCAN algorithm.
In this paper, we propose a joint algorithm of AGADESN algorithm and DBSCAN clustering algorithm for motion intention recognition of cluster targets. It can simultaneously predict the moving destination of cluster targets and identify clusters in the field of view. The improved Olfati-Saber model is used to generate cluster motion, which takes into account the accuracy of destination information acquired by cluster targets, and introduces the motion direction noise with time-varying variance. In the intention prediction algorithm, we introduce the adaptive mutation rate to optimize genetic algorithm and use adaptive genetic algorithm to optimize DESN parameters. The optimized DESN is used for destination prediction of cluster targets, and a more accurate prediction effect is achieved. The prediction output information provides input for the innovatively designed MSD. Based on the MSD, we identify clusters within the field of view under the DBSCAN framework to judge in real-time whether target splitting behavior occurs, which is more robust than the DBSCAN algorithm considering only the position and speed distance. In future work, we may improve the clustering algorithm to reduce the required parameters, further improving the cluster identification performance.
The data used to support the findings of this study are available from the corresponding author upon request.
Conflicts of Interest
We declare that we have no financial and personal relationships with other people or organizations that can inappropriately influence our work.
This work was supported by the National Natural Science Foundation of China under Grant No. 61703424.
E. L. Martin, L. H. David, and L. James, Handbook of Multi-Sensor Data Fusion: Theory and Practice, CRC press, 2017.
F. Ge, K. Li, Y. Han, W. Xu, and Y. A. Wang, “Path planning of UAV for oilfield inspections in a three-dimensional dynamic environment with moving obstacles based on an improved pigeon-inspired optimization algorithm,” Applied Intelligence, vol. 50, no. 9, pp. 2800–2817, 2020.View at: Publisher Site | Google Scholar
X. B. Guo, Z. Wang, and W. D. Hu, “Information fusion with Bayesian networks for target recognition,” Acta Simulata Systematica Sinica, vol. 17, no. 9, pp. 2713–2716, 2005.View at: Google Scholar
D. Qiao, Y. Liang, C. Ma et al., “Recognition and prediction of group target intention in multi-domain operations,” Systems Engineering and Electronics, pp. 1–12, 2021.View at: Google Scholar
J. MacQueen, “Some methods for classification and analysis of multivariate observations,” in Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability, pp. 281–297, Berkeley, USA, 1967.View at: Google Scholar
M. Ester, H. P. Kriegel, J. Sander, and X. W. Xu, “A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise,” in Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, Portland, OR, USA, 1996.View at: Google Scholar
M. Ballerini, N. Cabibbo, R. Candelier et al., “Interaction ruling animal collective behavior depends on topological rather than metric distance: evidence from a field study,” Proceedings of the National Academy of Sciences of the United States of America, vol. 105, no. 4, pp. 1232–1237, 2008.View at: Publisher Site | Google Scholar
C. Guo, “Optimization of support vector machine time series forecast model based on genetic algorithm,” Chinese Journal of Scientific Instrument, vol. 9, pp. 1080–1084, 2006.View at: Google Scholar
X. Yan, R. Gong, and Q. Zhang, “Application of SVM optimized by genetic algorithm in short-term wind speed prediction,” Power System Protection and Control, vol. 44, no. 9, pp. 38–42, 2016.View at: Google Scholar