Yongsheng Xiao, Lizhen Huang and Jianjiang Zhou
The purpose of this paper is to solve the azimuth sensitivity of a high-resolution range profile (HRRP), which is one of the biggest obstacles faced by a radar automatic target…
Abstract
Purpose
The purpose of this paper is to solve the azimuth sensitivity of a high-resolution range profile (HRRP), which is one of the biggest obstacles faced by a radar automatic target recognition (RATR) system.
Design/methodology/approach
Aimed at addressing the shortcomings of the equal angular-sector segmentation based on the scatterer model, an adaptive angular-sector segmentation is proposed on the basis of grey incidence analysis (GIA).
Findings
The main conclusions reached are as follows. First, the adaptive angular-sector segmentation in terms of GIA is suitable for RATR based on the HRRP; and, second, the adaptive angular-sector segmentation based on the type-B degree of grey incidence model is better than the Deng-Si degree of grey incidence model and the degree of grey slope incidence model.
Practical implications
The outcome obtained in this paper can be selected for the RATR application.
Originality/value
This paper has been built on the basis of previous research achievements, and a new RATR method of adaptive angular-sector segmentation is presented based on the GIA.
Details
Keywords
Kai Li, Cheng Zhu, Jianjiang Wang and Junhui Gao
With burgeoning interest in the low-altitude economy, applications of long-endurance unmanned aerial vehicles (LE-UAVs) have increased in remote logistics distribution. Given…
Abstract
Purpose
With burgeoning interest in the low-altitude economy, applications of long-endurance unmanned aerial vehicles (LE-UAVs) have increased in remote logistics distribution. Given LE-UAVs’ advantages of wide coverage, strong versatility and low cost, in addition to logistics distribution, they are widely used in military reconnaissance, communication relay, disaster monitoring and other activities. With limited autonomous intelligence, LE-UAVs require regular periodic and non-periodic control from ground control resources (GCRs) during flights and mission execution. However, the lack of GCRs significantly restricts the applications of LE-UAVs in parallel.
Design/methodology/approach
We consider the constraints of GCRs, investigating an integrated optimization problem of multi-LE-UAV mission planning and GCR allocation (Multi-U&G IOP). The problem integrates GCR allocation into traditional multi-UAV cooperative mission planning. The coupling decision of mission planning and GCR allocation enlarges the decision space and adds complexities to the problem’s structure. Through characterizing the problem, this study establishes a mixed integer linear programming (MILP) model for the integrated optimization problem. To solve the problem, we develop a three-stage iterative optimization algorithm combining a hybrid genetic algorithm with local search-variable neighborhood decent, heuristic conflict elimination and post-optimization of GCR allocation.
Findings
Numerical experimental results show that our developed algorithm can solve the problem efficiently and exceeds the solution performance of the solver CPLEX. For small-scale instances, our algorithm can obtain optimal solutions in less time than CPLEX. For large-scale instances, our algorithm produces better results in one hour than CPLEX does. Implementing our approach allows efficient coordination of multiple UAVs, enabling faster mission completion with a minimal number of GCRs.
Originality/value
Drawing on the interplay between LE-UAVs and GCRs and considering the practical applications of LE-UAVs, we propose the Multi-U&G IOP problem. We formulate this problem as a MILP model aiming to minimize the maximum task completion time (makespan). Furthermore, we present a relaxation model for this problem. To efficiently address the MILP model, we develop a three-stage iterative optimization algorithm. Subsequently, we verify the efficacy of our algorithm through extensive experimentation across various scenarios.
Details
Keywords
Dongmei Han, Wen Wang, Suyuan Luo, Weiguo Fan and Songxin Wang
This paper aims to apply vector space model (VSM)-PCR model to compute the similarity of Fault zone ontology semantics, which verified the feasibility and effectiveness of the…
Abstract
Purpose
This paper aims to apply vector space model (VSM)-PCR model to compute the similarity of Fault zone ontology semantics, which verified the feasibility and effectiveness of the application of VSM-PCR method in uncertainty mapping of ontologies.
Design/methodology/approach
The authors first define the concept of uncertainty ontology and then propose the method of ontology mapping. The proposed method fully considers the properties of ontology in measuring the similarity of concept. It expands the single VSM of concept meaning or instance set to the “meaning, properties, instance” three-dimensional VSM and uses membership degree or correlation to express the level of uncertainty.
Findings
It provides a relatively better accuracy which verified the feasibility and effectiveness of VSM-PCR method in treating the uncertainty mapping of ontology.
Research limitations/implications
The future work will focus on exploring the similarity measure and combinational methods in every dimension.
Originality/value
This paper presents an uncertain mapping method of ontology concept based on three-dimensional combination weighted VSM, namely, VSM-PCR. It expands the single VSM of concept meaning or instance set to the “meaning, properties, instance” three-dimensional VSM. The model uses membership degree or correlation which is used to express the degree of uncertainty; as a result, a three-dimensional VSM is obtained. The authors finally provide an example to verify the feasibility and effectiveness of VSM-PCR method in treating the uncertainty mapping of ontology.