This paper proposes a two-dimensional (2D) angular super-resolution framework for sparse arrays under the single snapshot condition. The azimuth-elevation 2D angular super-resolution model is established, which shows the relationship between the 2D angular super-resolution image and the signal. Using this model, the 2D angular super-resolution problem is transformed into the beyond linear optimization problem. In order to efficiently and accurately address this optimization problem, we propose the sparse multi-layer iterative (SMLI) algorithm based on beyond linear signal processing (BLiSP) theory. During the layered iterative process, the solution region is continuously narrowed. The constructed nonlinear weighting matrix and sparse constraint coefficient enhance the ability to differentiate between the effect of signal and noise in solving the beyond linear optimization problem. Additionally, the nonlinear weighting matrix can be adaptively updated during the solving process, ensuring high-performance angular super-resolution results under different signal-to-noise ratios (SNRs). Experiments confirm the proposed method’s effectiveness and robustness.
With the transformation of user demands in knowledge economy era, traditional knowledge service operation paradigm and implementation countermeasures cannot meet the demand of users. The previous research on knowledge service system is rich in theoretical content, but most of the research only stays on the shallow analysis of the concept and features. There is lack of information available to the construction of knowledge service system framework in details, especially in the academic area. This paper first contributes to the existing body of knowledge service solution, and then combines general knowledge service solution with integrated definition function (IDEF0) models to produce a knowledge service system framework. These IDEF0 models depict the hierarchy within knowledge service purposes and reveal strategies of meeting user demands in academic research. Finally, a prototype system in knowledge service system shows that the proposed framework can provide effective knowledge service for users, which will help to promote quality and satisfaction in knowledge service process.
This paper investigates a specific operational amplifier to overcome the limitations of traditional accelerated degradation testing, particularly issues related to limited data availability and inaccurate modeling. A particle swarm optimization algorithm is employed to design an optimal testing strategy that achieves a balance between model precision, reliability evaluation confidence, and cost-effectiveness. Utilizing the degradation data derived from experimental procedures, a time-scale function is incorporated into the Wiener process to model the nonlinear degradation behavior of the operational amplifier, accounting for the substantial randomness in environmental influences and the uncertainty associated with actual usage conditions. Furthermore, this study proposes a multivariate performance degradation modeling approach utilizing Copula functions to address product failures arising from competing performance parameters. Compared to conventional multivariate normal models, the proposed approach offers distinct advantages in accurately capturing complex nonlinear dependencies among performance parameters, streamlining the modeling process, and improving both flexibility and applicability. In the presented case study, an optimized reliability testing procedure is applied to a specific operational amplifier, followed by degradation modeling and reliability evaluation utilizing the proposed methodology. The results demonstrate that this integrated approach achieves 14.2% cost reduction, providing engineers with a practical framework for designing cost-effective testing programs without compromising assessment accuracy. The proposed methodology not only advances degradation modeling techniques but also offers direct economic benefits for industrial reliability testing applications.
Aerial gravity measurements in polar regions require higher accuracy and stability from satellite navigation systems. The performance of conventional Global Positioning System (GPS) significantly deteriorates as one moves from lower latitudes to polar areas. First, a regional comparative analysis of BeiDou Navigation Satellite System (BDS) and GPS positioning performance in polar regions is conducted. Results indicate that in polar environments, BDS demonstrates certain advantages regarding satellite availability and geometric distribution. Based on this analysis, a method for extracting airborne gravity anomalies using BeiDou signals in polar regions is proposed and improved. The process begins by optimizing BeiDou observation data using an altitude angle weighting method combined with precise ephemeris data. An error correction model is constructed to enhance system adaptability in the polar environment. Following this, high-precision position and acceleration estimation is achieved using the precise point positioning (PPP) technique, integrated with inertial navigation information, to extract aerial gravity anomalies in polar regions accurately. Results from Antarctic aerial gravity measurement experiments indicate that the BDS-based model improves accuracy by 30% compared to GPS under the same conditions.
A communication and navigation constellation which can cover the whole Cislunar space is useful for deep space exploration. In our previous work, we proposed a configuration of navigation constellations arranged in special long-period orbits of Cislunar space. In order to keep the navigation satellites strictly on the accurate nominal orbit, a terminal sliding mode control (TSMC) strategy based on the disturbance observer is proposed. Since the states of navigation satellites cannot be observed directly, a linear extended state observer (LESO) is designed to recover the state as well as estimate solar gravity to assist in spacecraft orbit determination. Then through the TSMC strategy, high-precision control of the spacecraft on special long-period orbits has been achieved. The stability conditions of the observer are deduced, and the stability of the system is proven using Lyapunov stability theory. The simulation results show that during the entire mission cycle of 76 days, the maximum position error is 259.95 m and the minimum is 1.41 m, and the maximum value of the velocity error is 0.08 m/s and the minimum velocity error is 6.15×10−6 m/s. The total velocity increment throughout the entire mission cycle is 30.96 m/s.
The missiles typically require multiple stages tests to improve hit accuracy. The existing estimation methods seldom consider the tests characteristics of multiple stages growth of missile hit accuracy, which bring difficulties to accurately estimate the missile hit accuracy. Considering the different degrees of damage caused by missile hitting the target in different areas, the Dirichlet distribution is selected as the prior distribution of hit accuracy parameters based on the Bayesian method. The sequence constraint relationship between the hit accuracy parameters of each stage test is established, and the Bayesian estimation model of hit accuracy based on multiple stages growth tests is constructed. The Markov chain-Monte Carlo method combined with Gibbs sampling is used to overcome the problem of solving the posterior high-dimensional integral of the model to complete the model solution. The example shows that this method can fuse multiple stages growth tests information compared with the existing single stage test method, which can provide reference for the estimation of missile hit accuracy during the period of research and development.
Antenna arrays have become a popular choice for protecting global navigation satellite system (GNSS) receivers in strong radio frequency interference environments. Environmental nonstationarities, which are caused by fast variations in propagation channels and rapid motion of interfering sources or antenna arrays, cause performance degradation of antenna array receivers. The covariance matrix taper (CMT) has been used to widen the adaptive pattern nulls toward the interference sources in GNSS antenna array receivers to address highly dynamic environments. In this paper, it is verified that the loss of the signal to interference and noise ratio (SINR) caused by a CMT cannot be ignored, and a CMT with a fixed null width cannot work well when the dynamic range of the GNSS array receiver is large. To design the modest null width, a CMT with an adaptive null width for space-time adaptive processing (STAP) is introduced. In the adaptive CMT, the proposed subspace leakage in STAP is used to estimate the required null width. In the simulations, the SINRs of adaptive CMT are always close to the SINRs of the optimal fixed null width in different scenarios, and the average SINRs of the adaptive CMT are even more than 10 dB higher than that of CMT with fixed null width in some scenarios. The adaptive CMT can be widely applied to GNSS antenna array receivers with a large dynamic range.
A low-profile wideband multi-mode circularly polarized (CP) multiple-input-multiple-output (MIMO) antenna with the parasitic metasurface using characteristic mode analysis (CMA) is presented. The single monopole element of MIMO is composed of a transmission line and a branch after slotting on the ground. Structurally, the transmission line forms a 90° shape with the branch, providing favorable conditions for achieving circular polarization. Through CMA, the difference in characteristic angle (CA) at the intersection of the mode significance (MS) is about 90° with their almost consistent radiation directions. The analysis results show that four modes work together to achieve a circular polarization effect. Secondly, after rotating the monopole antenna at three angles (90°, 180°, 270°), a 4-port MIMO antenna is formed, and the results of their ports on the same level are consistent. Finally, the narrow axial ratio bandwidth (ARBW) of MIMO antennas is compensated by adding two rows of parasitic cross-circular metasurfaces. The measured results of the proposed antenna prototyped are in agreement with the simulated ones, demonstrating an impedance bandwidth (IBW) of 84.1% (3.65-8.95 GHz), a 3-dB ARBW of 52.0% (3.7-6.3 GHz), and a peak gain of 5.8 dBic at 4.9 GHz. The antenna achieves a total efficiency ranging from 72.8% to 98.8% across the bandwidth, and its envelope correlation coefficient (ECC) remains below 0.15 throughout the working frequency range.
This paper highlights a Tibetan syllable spelling check method based on memristive computing. Firstly, a rule-based syllable component recognization method is implemented to classify components of syllables into seven types, that is prefix letter, root letter, superscript letter, subscript letter, vowel letter, suffix letter, and farther suffix letter. In order to detect syllable formation errors in Tibetan text, a Tibetan spelling check method is presented based on component recognization by adding mapping principles. Then, a memristor crossbar array with an external control circuit is introduced to make memristive computing for Tibetan spelling check, by analyzing the total current value in a memristor crossbar array to implement rule-based matching and mapping processes. Finally, a stable memristive computing algorithm-based Tibetan spelling check is established. A simulation experiment on the memristor crossbar array demonstrates the stability of our memristive computing-based Tibetan spelling check method. Comparative experiments on 1274 of the most common Tibetan syllables show that the accuracy of our component recognization method is 97.19%, the F1-score of spelling check is 98.58%, beating other rule-based and statistics-based methods in precision and F1-score, demonstrating the accuracy of our method.
Lightweight convolutional neural networks (CNNs) have simple structures but struggle to comprehensively and accurately extract important semantic information from images. While attention mechanisms can enhance CNNs by learning distinctive representations, most existing spatial and hybrid attention methods focus on local regions with extensive parameters, making them unsuitable for lightweight CNNs. In this paper, we propose a self-attention mechanism tailored for lightweight networks, namely the brief self-attention module (BSAM). BSAM consists of the brief spatial attention (BSA) and advanced channel attention blocks. Unlike conventional self-attention methods with many parameters, our BSA block improves the performance of lightweight networks by effectively learning global semantic representations. Moreover, BSAM can be seamlessly integrated into lightweight CNNs for end-to-end training, maintaining the network’s lightweight and mobile characteristics. We validate the effectiveness of the proposed method on image classification tasks using the Food-101, Caltech-256, and Mini-ImageNet datasets.
This paper presents a time-varying formation tracking strategy for multiagent quadrotor operating in hostile or challenging circumstances, where the position constraints become crucial. A decentralized cooperative control scheme is proposed based on barrier Lyapunov functions in conjunction with linear sliding mode control with directed communication among the quadrotors. The consequence of using the proposed control scheme is to provide practical finite time convergence and disturbance rejection while fulfilling position constraints. The practical finite time convergence of the proposed method is shown for multi-input and multi-output (MIMO) multiagent systems via Lyapunov analysis. The capability of the proposed algorithm is investigated for six quadrotors using MATLAB/Simulink. The simulation results demonstrate the intended performance of the proposed formation tracking controller under modeling uncertainties and external disturbances.
This paper investigates the distributed continuous-time aggregative optimization problem for second-order multi-agent systems, where the local cost function is not only related to its own decision variables, but also to the aggregation of the decision variables of all the agents. By using the gradient descent method, the distributed average tracking (DAT) technique and the time-base generator (TBG) technique, a distributed continuous-time aggregative optimization algorithm is proposed. Subsequently, the optimality of the system’s equilibrium point is analyzed, and the convergence of the closed-loop system is proved using the Lyapunov stability theory. Finally, the effectiveness of the proposed algorithm is validated through case studies on multirobot systems and power generation systems.
In target tracking stage, the integrated sensing and communication (ISAC) system needs to estimate various target parameters, such as the angle and range, while ensuring highly reliable communication. This paper proposes a two-stage constant-modulus waveform design. In the transmission waveform covariance matrix (TWCM) optimization stage, we minimize the Cramer-Rao bound (CRB) of joint estimation for two-dimensional direction of arrival (DOA) and complex reflection coefficients under total power constraint, obtaining an optimal TWCM. In the alternating optimization based on Riemannian steepest descent (RSD) stage, under constant modulus property and multi-user interference constraints, minimize the squared Euclidean distance between actual TWCM and optimal TWCM obtained from the TWCM optimization stage. To address the optimization problem, an alternate optimization algorithm based on the RSD method is proposed. Simulation results demonstrate that the proposed waveform design simultaneously achieve reliable communication and multi-target tracking.
Compressive sensing (CS) has been successfully combined with deep-learning neural networks to generate models for image-depth CS. Many existing models face significant limitations, such as their inability to handle tasks with multiple CS ratios and suboptimal performance in image reconstruction. To overcome these challenges, an optimized deep network model, named global multi-attention condition module (GMCM) iterative shrinkage-thresholding algorithm (ISTA)-Net++ is proposed. In this model, the CS ratio of an image is incorporated as a network parameter, enabling the network to effectively handle multiple CS ratio tasks. Additionally, a hybrid attention mechanism is employed to preprocess the reconstructed image for feature extraction and to calculate the image complexity score. These elements are then combined with the CS ratio to jointly predict the parameters and iterative reconstruction steps, which are subsequently broadcast to all iterative stages of the model. Extensive experiments on high- and low-resolution image datasets demonstrate that the proposed GMCM ISTA-Net++ model achieves a superior performance compared to traditional models. Given its flexibility, enhanced reconstruction quality, and adaptability, this model holds significant potential for deployment in resource-constrained mobile image-processing terminals.
Multi-domain competition is developing for disintegrating the component of the opponent’s operational system and winning advantage in decision space. Island air defense is a typical multi-domain security problem, which dramatically increases the complexity of decision-making by considering different factors such as multi-stages decisions, multi-domain settings, imperfection information, and uncertain events. However, current research on island air defense security problems is sparse and lacks consideration of key factors. To provide support for assisting human commanders to take wise decisions in a complex environment, we build a multi-domain multi-state island air defense model and propose responding solving algorithms. We study the whole progress of island air defense and propose a multi-domain, multi-stage imperfection information security game that formulates critical characters in the adversarial scenario of island air defense. In addition, considering a bounded rational opponent’s possible strategies, we propose an opponent-aware Monte Carlo counterfactual regret minimization algorithm for learning a robust defensive strategy in the security game. We evaluate our methods in various adversarial scenarios. The results show that our equilibrium learning method can effectively play against an opponent with bounded rationality and significantly outperform some advanced algorithms.
Traditional optimization algorithms from operations research are not well-suited for addressing the vehicle routing problem (VRP) with a large number of instances and high real-time requirements. Deep reinforcement learning (DRL) introduces a new approach to solving VRP, characterized by its rapid problem-solving capabilities and robust generalization abilities. In the domain of VRP variants, numerous benchmarks are utilized to evaluate the performance of the solving algorithms. However, the limited number of instances in these public benchmarks is insufficient for training DRL algorithms. To address this issue, an effective benchmark augmentation method using distribution derivation is proposed. By modeling the distributions of key VRP variables and estimating their parameters, the method derives distributions closely resembling the original benchmark and subsequently generates a large number of synthetic instances accordingly. The proposed method holds promise for widespread applications across various benchmarks. Experiments on VRP with time windows (VRPTW) and heterogeneous fleet VRP (HFVRP) verify the generalization abilities. The results show that DRL trained using the augmented benchmarks performs much better on public benchmarks than trained using the data customized by the algorithm authors. In addition, the DRL algorithms trained using the augmented benchmarks achieve performance comparable to state-of-the-art algorithms in public benchmarks for various VRP variants while significantly reducing the computation time.
Radar is a core sensing tool in the fields of modern defense, aerospace, and civil monitoring, and its performance improvement has always been a research hotspot in the field of signal processing. However, the traditional radar signal processing system mainly relies on the assumption of linear time-invariant, and its performance is seriously degraded in complex scenes such as low observable target detection, strong mainlobe interference, and non-Gaussian clutter. Therefore, beyond linear processing (BLiP), a new applied research project at the algorithm level, has been paid more and more attention. BLiP focuses on improving the radar performance with the usage of signal processing techniques that go beyond current linear signal processing algorithms. This study addresses the potential for radar performance improvement of BLiP in areas such as waveform adaptive scheduling and design, clutter suppression, adaptive interference cancellation, direction of arrival (DOA) estimation, target detection, high-resolution imaging, and target tracking, and provides an outlook on future trends of BLiP in radar signal processing.
Re-entry gliding vehicles exhibit high maneuverability, making trajectory prediction a key factor in the effectiveness of defense systems. To overcome the limited fitting accuracy of existing methods and their poor adaptability to maneuver mode mutations, a trajectory prediction method is proposed that integrates online maneuver mode identification with dynamic modeling. Characteristic parameters are extracted from tracking data for parameterized modeling, enabling real-time identification of maneuver modes. In addition, a maneuver detection mechanism based on higher-order cumulants is introduced to detect lateral maneuver mutations and optimize the use of historical data. Simulation results show that the proposed method achieves accurate trajectory prediction during the glide phase and maintains high accuracy under maneuver mutations, significantly enhancing the prediction performance of both three-dimensional trajectories and ground tracks.
Bird’s-eye-view (BEV) perception is a core technology for autonomous driving systems. However, existing solutions face the dilemma of high costs associated with multi-modal methods and limited performance of vision-only approaches. To address this issue, this paper proposes a framework named “a lightweight pure visual BEV perception method based on dual distillation of spatial-temporal knowledge”. This framework innovatively designs a lightweight vision-only student model based on ResNet, which leverages a dual distillation mechanism to learn from a powerful teacher model that integrates temporal information from both image and light detection and ranging (LiDAR) modalities. Specifically, we distill efficient multi-modal feature extraction and spatial fusion capabilities from the BEVFusion model, and distill advanced temporal information fusion and spatiotemporal attention mechanisms from the BEVFormer model. This dual distillation strategy enables the student model to achieve perception performance close to that of multi-modal models without relying on LiDAR. Experimental results on the nuScenes dataset demonstrate that the proposed model significantly outperforms classical vision-only algorithms, achieves comparable performance to current state-of-the-art vision-only methods on the nuScenes detection leaderboard in terms of both mean average precision (mAP) and the nuScenes detection score (NDS) metrics, and exhibits notable advantages in inference computational efficiency. Although the proposed dual-teacher paradigm incurs higher offline training costs compared to single-model approaches, it yields a streamlined and highly efficient student model suitable for resource-constrained real-time deployment. This provides an effective pathway toward low-cost, high-performance autonomous driving perception systems.
Automatic modulation classification(AMC) is an essential technique in both civil and military applications. While deep learning has surpassed traditional methods in accuracy, distinguishing high-order modulations remain challenging. Current efforts prioritize complex network designs, neglecting the integration of deep features and tailored feature engineering to reslove high-order ambiguities. Therefore, a multi-feature extraction framework is proposed, which directly concatenates the deep feature extracted by a newly designed lightweight neural network and the proposed spectrum secondary features or de-noised high-order statistical features. The proposed features and lightweight network both demonstrate superior overall accuracy than other competing features or networks. Furthermore, the effectiveness of the feature extraction framework is also validated. The average classification accuracy on high-order modulation sets reaches 67.39% on the RadioML2018.01A dataset, increasing more than 2% compared with the other competitive networks under the framework. The results indicate the effectiveness of the proposed feature extraction framework for its representational ability by combing the deep features with the proposed domain features.
This paper investigates the high-performance control issues of systems affected by time-varying disturbances and measurement noise. Conventionally, active disturbance rejection control (ADRC) is a favorable control strategy to reject unknown disturbances and uncertainties. However, its control performance is limited because standard extended state observer (ESO) struggles to effectively estimate time-varying disturbances. The emergence of high-order ESO (HESO) alleviates the limitation. Unfortunately, it deteriorates the noise suppression capability when the disturbance rejection is enhanced. To tackle this challenge, an improved ADRC with cascade HESO (CHESO) is proposed. A comprehensive theoretical analysis associated with the performance of HESO is given for the first time. The presented analyses provide an intuitive understanding of the performance of HESO. Then, a novel CHESO is developed. The convergence of CHESO is proved via input-to-state stable theory. Extensive frequency domain analyses indicate that CHESO has stronger disturbance rejection and high-frequency noise attenuation performance than ESO and HESO without increasing the observer bandwidth. Comparative simulations conducted on a servo control system validate the effectiveness and preponderance of the proposed method.
This paper addresses a dynamic vehicle routing problem with stochastic requests in a dual-channel distribution center that utilizes shared vehicle resources to serve two types of customers: offline corporate clients (CCs) with fixed and stochastic batch demands, and online individual customers (ICs) with single-unit demands. To manage stochastic batch demands from CCs, this paper proposes three recourse policies under a differentiated resource-sharing scheme: the waiting-tour-based (WTB) policy, the advance-tour-based (ATB) policy, and the advance-customer-based (ACB) policy. These policies differ in their response priorities to random requests and the scope of route reoptimization. The problem is formulated as a two-stage stochastic recourse programming model, where the first stage establishes routes for fixed demands. In the second stage, we construct three stochastic recourse programming models corresponding to the proposed recourse policies. To solve these models, this paper develop rolling horizon algorithms integrated with mathematical programming models or metaheuristic algorithms. Extensive numerical experiments validate the effectiveness of the proposed algorithms and policies. The results indicate that both the ATB and ACB policies lead to cost savings compared to the WTB policy, especially when stochastic demands are urgent and delivery resources are quite limited. Specifically, when the number of ICs is small, the expected total cost savings can exceed 12%, and in some scenarios, savings of over 20% can be achieved. When the number of ICs is large, some scenarios can achieve cost savings exceeding 7%. Furthermore, the ACB policy yields lower costs, fewer worsened ICs, fewer trips, and less vehicle time than the ATB policy.
The application of Dempster-Shafer evidence theory in multi-source information fusion faces some problems including how to determine the weight of evidence in reliability multi-source information fusion, and how to solve the problem of conflict in Dempster-Shafer evidence fusion. In this paper, Jeffreys-Matusita distance function is introduced to establish the reliability index and consistency index, realize the difference measurement between evidence, determine the reliability degree of evidence, and evaluate the consistency difference of evidence. The distance measurement of multi-source information is achieved with the reassigned weight to avoid conflicts at the time of evidence fusion. In the end, the multi-source information fusion in the development of guided munitions is taken as an example to illustrate the conversion methods for expert experience information, component and subsystem information, reliability growth information, and similar product information, respectively. With the field test information, the multi-source reliability information is fused. The applicability and effectiveness of the proposed method are verified by comparing with the existing multi-source information fusion methods.
To address the issue of insufficient radar detection capability caused by the low signal-to-noise ratio of target echoes, a coherent synthesis method for distributed aperture rotating array radar (DARAR) based on two-stage compensation is proposed. Firstly, a parallel control model is employed to uniformly manage the servo subsystems, ensuring consistent rotation across multiple radars. Next, by utilizing prior information such as the distributed system layout and beam pointing, the echo signal undergoes a first-level coarse compensation. Finally, a regional cross-correlation (RCC) method estimates the time and phase parameters within a small-scale range, completing the second-level fine compensation of time and phase and achieving coherent synthesis of multiple rotating array radar echo signals. A system comprising a three-node DARAR is designed, and joint detection experiments targeting unmanned aerial vehicles are conducted. Experimental results demonstrate that the efficiency of coherent synthesis increases by more than 20% under signal-to-noise ratios ranging from 8 dB to 13 dB. The proposed method enables DARAR operation and enhances the detection capability of rotating array radar.
To overcome the limitations of conventional approaches that adopt monolithic architectures and overlook critical dynamic interactions in evaluating combat effectiveness and subsystem contributions within amphibious operations, this paper proposes an integrated framework combining complex system network modeling with dynamic adversarial simulation for evaluating mission-critical system-of-systems (SoS). Specifically, the contribution rate of unmanned aerial vehicles (UAVs) to the amphibious joint landing SoS (AJLSoS) is quantified. Firstly, a standardized network topology model is developed using operation loop theory, systematically characterizing node functionalities and their interdependencies. Secondly, the ideal Lanchester equation is augmented according to the model’s static operational capability, and an amphibious operational simulation model is constructed based on the modified equation, enabling dynamic simulation of force attrition and engagement duration as key performance indicators of AJLSoS. To validate the theoretical framework, a battalion-level amphibious campaign scenario is developed to compute effectiveness metrics across multiple control scenarios and the contribution rate of UAVs to AJLSoS is analyzed. This study not only provides actionable insights for operational mission planning of UAVs in the context of amphibious operations but also demonstrates high adaptability to diverse operational contexts.
The power inversion (PI) algorithm lacks specific constraints on desired signals. Thus, the beampattern has fluctuation in all directions other than the jamming sources. This phenomenon will damage the reception of desired signals. In high signal-to-noise ratio (SNR) application, the desired signal is inevitably suppressed by the PI algorithm, resulting in a deterioration to the out signal-to-interference-and-noise ratio (SINR). This paper proposes an improved PI algorithm based on derivative constraint. Firstly, the proposed method uses subspace projection to extract jamming-free data, the derivative constraint is imposed to the non-jamming data, and subsequently the Lagrange multiplier can be used to calculate the array weight vector. Simulation results demonstrate that, the proposed algorithm in this paper has a higher output SNR, flat gains in non-jamming directions, and applicability of high SINR than the PI algorithm, thus verifying the effectiveness of the algorithm.
To address long-range impulsive orbital pursuit-defense game scenario, characterized by long decision cycles, sparse actions, and misaligned maneuvering times, a multi-agent asynchronous hierarchical reinforcement learning (MA-AHRL) method is proposed. The method considers practical constraints including space perturbations, thrust limitations, fuel consumption limitations, and perceptual capabilities. Firstly, a relative orbital dynamics model is established, and the pursuit-defense game environment is defined, which clarifies the success criteria for the tasks of both the pursuer and the defender. Secondly, an actor-critic network structure integrating long short-term memory (LSTM) networks with an adaptive attention mechanism is designed. The LSTM extracts features from historical interaction data to compensate for the critic network’s inability to access opponent action information during training. The attention mechanism adaptively adjusts the weights of different time steps, thereby enhancing the ability to extract key state features in the game environment. Then, the action network employs a dual-layer decision structure that integrates dynamics, where the high-level policy outputs the maneuver time interval and the low-level policy outputs impulsive actions, effectively reducing training difficulty and improving training efficiency. Finally, the pursuit-defense game is modeled as a partially observable Markov decision process (POMDP), where the action space, state space, observation space, and reward function are explicitly designed. Simulation comparison demonstrates that MA-AHRL can effectively coordinate the competitive relationship between the pursuer and defender while exhibiting excellent training stability. Testing the decision-making networks, both the pursuer and the defender display strong strategic adaptability and real-time decision-making capabilities, fully validating the effectiveness and reliability of the proposed method in this paper.
Supportability simulation analysis has emerged as a cost-effective alternative to physical experimentation for enhancing the logistics capacity of equipment support, especially in complex combat scenarios. However, key issues such as support scheme planning, resource optimization, and comprehensive analysis of the reliability, maintainability, supportability, and testability (RMST) indices are seldom explored in depth. This paper proposes mission-driven methods for equipment supportability analysis and optimization. Firstly, a supportability modeling and optimization framework, along with a mission-driven support activity simulation, is presented to describe the complex interaction between large-scale equipment and resources. Then, an optimization model for resource allocation based on simulation is developed, and a heuristic method is introduced to solve the problem. Fault uncertainty is incorporated into the support activities to integrate the RMST indices of the equipment. A Monte Carlo simulation is then used to comprehensively evaluate these RMST indices. Finally, a numerical example is used to validate the proposed methodology. The experimental results demonstrate that the presented approach successfully performs simulation, analysis, and optimization of the support activity, and the equipment deployment results in 93.29% availability, which can provide reliable decision support for equipment operation and logistics.
The rapid growth in satellite and aerial remote sensing platforms has created a growing need for distributed remote sensing scene classification. Conventional centralized scene classification methods, which involve transmitting remote sensing data to a ground station for processing, encounter limitations in both transmission efficiency and data privacy. Federated learning (FL) has emerged as a promising approach by enabling terminals to collaboratively train models without exchanging raw data. However, the non-independent and identically distributed (Non-IID) nature of remote sensing data significantly impedes FL performance. To address these challenges, a federated framework with feature distillation (FD) (FedFD) is proposed for FL-based remote sensing scene classification. Specifically, FedFD facilitates collaborative training by aggregating model parameters from multiple terminals to the cloud, thereby optimizing a global model. To further alleviate the impact of Non-IID data, an innovative partial feature-sharing strategy based on FD is designed, which divides features into globally shared essential features and locally maintained supplementary features. Moreover, to cope with object and scene scale variation, the squeeze and excitation module and the pyramid pooling module are incorporated into the scene classification network to enhance multiscale feature extraction. Extensive experiments on the Northwestern Polytechical University Remote Sensing Image Scene Classification 45 (NWPU-RESISC45) dataset and University of California, Merced Land Use (UC-Merced) dataset, under varying numbers of terminals and Non-IID levels, validate the effectiveness and scalability of FedFD, and demonstrate its superior performance in FL-based remote sensing scene classification.
When detecting weak targets, radar systems often encounter the interference from complex clutter in the field scene, leading to a high false alarm rate and a low detection rate when the traditional radar methods are employed. To address this issue, this paper proposes a clutter suppression method based on generative adversarial networks (GANs) to improve the detection performance of weak targets. This method designs a clutter identification network based on the characteristics of clutter in the range-Doppler domain. By adopting a divide-and-conquer strategy, a clutter suppression network is selected based on the clutter identification results. This method transforms the clutter suppression process into a mapping problem from the clutter-affected data domain to a clutter-free data domain. Experiments results show that the proposed method achieves a 10% improvement in detection rate in rain clutter scenarios, and reduce the false alarm rate by 90% in ground clutter scenarios.
In order to study the influence of the support device on the energy conversion of the electromagnetic coil launcher, five different material and structure Livermore Software Technology Corporation’s Dynamic Analyzer (LS-DYNA) finite element analysis models are established, including the insulation ring column structure model, non-magnetic ring column structure model, magnetic ring column structure model, non-magnetic half ring column structure model, and magnetic half ring column structure model, to investigate the effect of the support device on the energy conversion of the internal drive coil launcher. In order to obtain the circuit characteristics of the internal drive coil launcher, a mathematical model and Maxwell finite element analysis model of the internal drive coil launcher are established, and the circuit characteristics of the launcher are solved based on the established model. By inputting system circuit data into a supported LS-DYNA finite element analysis model, the internal driving three-dimensional non axisymmetric simulation is completed, which solves the problem of Maxwell simulation software being unable to achieve three-dimensional hollow motion domain. The simulation results show that the peak velocities of the five supported launchers are reduced by 2.5%, 61.9%, 42.1%, 29.9%, and 14.7% respectively compared to the unsupported coil launchers. The results show that the influence of insulation materials on the energy conversion of the launcher can be basically ignored, while the influence of metal materials on the energy conversion of the launcher is significant. The use of magnetic high resistance materials and anti eddy current structures can significantly weaken the influence of metal support devices on the energy conversion of the coil launcher, and improve the launch performance of the coil launcher.
In an aircraft final assembly line (AFAL), the rational scheduling of assembly workers to complete tasks in an orderly manner is crucial for enhancing production efficiency. This paper addresses the multi-skilled worker scheduling problem in the AFAL, where the processing time of each task varies due to the assigned workers’ skill levels, referred to as variable duration. The objective is to minimize the makespan, i.e., the total time required for all workers to complete all tasks. A mixed integer linear programming model is formulated under complex constraints including assembly precedence relations, skill requirements, worker skill capabilities, and workspace capacities. To solve the model effectively, a multi-pass priority rule-based heuristic (MPRH) algorithm is proposed. This algorithm integrates 14 activity priority rules and nine worker priority rules with worker weights. Extensive experiments iteratively the best-performing priority rules, and the most effective rule subsets are integrated through a lightweight multi-pass mechanism to enhance its efficiency. The computational results demonstrate that the MPRH can find high-quality solutions effectively within very short central processing unit central processing unit (CPU) time compared to GUROBI. A case study based on real data obtained from an AFAL confirms the necessity and the feasibility of the approach in practical applications. Sensitivity analyses provide valuable insights to real production scenarios.
During actual high-speed flights, the electromagnetic (EM) properties of aircraft radomes are influenced by dielectric temperature drift, leading to substantial drift in the boresight errors (BSEs) from their room temperature values. However, applying thermal loads to the radome during ground-based EM simulation tests is challenging. This paper presents an EM equivalent physical model (EEPM) for high-speed aircraft radomes that account for the effects of dielectric temperature drift. This is achieved by attaching dielectric slices of specific thicknesses to the outer surface of a room-temperature radome (RTR) to simulate the increase in electrical thickness resulting from high temperatures. This approach enables accurate simulations of the BSEs of high-temperature radomes (HTRs) under high-speed flight conditions. An application example, supported by full-wave numerical calculations and physical testing, demonstrates that the EEPM exhibits substantial improvement in approximating the HTR compared to the RTR, facilitating precise simulations of the BSEs of HTRs during high-speed flights. Overall, the proposed EEPM is anticipated to considerably enhance the alignment between the ground-based simulations of high-speed aircraft guidance systems and their actual flight conditions.
A safe and reliable path planning algorithm is fundamental for unmanned surface vehicles (USVs) to perform autonomous navigation tasks. However, a single global or local planning strategy cannot fully meet the requirements of complex maritime environments. Global planning alone cannot effectively handle dynamic obstacles, while local planning alone may fall into local optima. To address these issues, this paper proposes a multi-dynamic-obstacle avoidance path planning method that integrates an improved A* algorithm with the dynamic window approach (DWA). The traditional A* algorithm often generates paths that are too close to obstacle boundaries and contain excessive turning points, whereas the traditional DWA tends to skirt densely clustered obstacles, resulting in longer routes and insufficient dynamic obstacle avoidance. To overcome these limitations, improved versions of both algorithms are developed. Key points extracted from the optimized A* path are used as intermediate start-destination pairs for the improved DWA, and the weights of the DWA evaluation function are adjusted to achieve effective fusion. Furthermore, a multi-dynamic-obstacle avoidance strategy is designed for complex navigation scenarios. Simulation results demonstrate that the USV can adaptively switch between dynamic obstacle avoidance and path tracking based on obstacle distribution, validating the effectiveness of the proposed method.
In electronic warfare, radar systems are confronted with significant threats within the complex electromagnetic environment, particularly from the prevalent method of blanket jamming that impairs radar’s detection capabilities. Frequency agility is recognized as an effective anti-jamming method against blanket jamming in practice. However, the traditional frequency agility selects the carrier frequency randomly, which highly limits the potential for robust anti-jamming capabilities, despite offering sufficient optimization space to improve the radar performance. This paper proposes an antijamming decision strategy based on the comb gradient-bandits algorithm (CGBA) to optimize decisions for frequency agility radar under blanket jamming conditions. In this strategy, the reward value is defined as the signal to interference plus noise ratio (SINR) of the radar in each training round, and the radar selects the frequency channel with the highest reward value as the new operational channel. The proposed method has dynamic adaptive ability according to the jamming status, which enables the radar to update its frequency channel in real-time. Theoretical analysis and experimental results show that the proposed model improves the radar’s ability to select anti-jamming strategies to a certain extent.
To address the issue of local oscillations in the slime mould algorithm (SMA) during path planning within complex environments, a multi-strategy improved hierarchical guidance SMA (MHGSMA) is introduced to enhance the search performance of SMA. Based on a priori analysis of the early-stage search behavior of slime moulds, a hierarchical method is developed to achieve a more rational division between elite and general populations. While adhering to the inherent search mechanism of SMA, the guidance functions for each population are refined to expand the search scope. Additionally, a greedy selection strategy is incorporated further to enhance the search efficiency and accuracy of the SMA. Simulation experiments for path planning are conducted in four distinct obstacle environments by comparing the MHGSMA, SMA, and hierarchical guided SMA (HG-SMA) for smooth path planning. The analysis of convergence speed, global path length, and accuracy reveals that MHGSMA excels in path planning. In complex environments, it shows improvements of 58.6% and 42% in convergence speed, 9.3% and 6% in path length, and 38.5% and 63.6% in accuracy, significantly enhancing SMA’s search performance. At the same time, under the same conditions, MHGSMA also demonstrates strong competitiveness compared to particle swarm optimization and grey wolf optimizer.
The flight plan of departing from the Earth and rendezvous near the Moon is a preferred strategy for future manned lunar exploration programs. However, significant decision-making challenges arise from diverse lunar insertion schemes during the Earth-Moon transfer process, where optimal energy consumption varies substantially across different orbital regimes. To address these challenges, an intelligent decision-making model employing deep convolutional neural networks (DCNNs) is proposed to select the optimal Earth-Moon transfer scheme, subsequently combine with the lunar rendezvous orbit to formulate an integrated mission profile. Results demonstrate that the intelligent decision-making approach achieves computational efficiency improvements of 3−4 orders of magnitude compared to conventional methods while maintaining comparable accuracy, confirming its practical viability for designing orbit of departing from the Earth and rendezvous near the Moon. This study offers valuable insights for future manned lunar missions and the application of intelligent methods in orbital design.
The semiconductor chip industry has become a bottleneck in China’s industrial development. How to improve efficiency has attracted increasing attention. Effective and efficient scheduling decision is the key to improve production efficiency. Oriented towards the wafer manufacturing of micro-electro-mechanical system (MEMS), a reentrant flexible job-shop scheduling problem with assembly constraints (RFJSSP-AC) is modeled to minimize the makespan and the total energy consumption simultaneously. An improved multi-objective evolutionary algorithm based on decomposition (IMOEA/D) is developed to solve the problem. The proposed IMOEA/D incorporates three key innovations: a hybrid initialization strategy combining heuristic rules with random generation to produce high-quality initial populations; an objective- oriented search strategy for targeted solution optimization; and an energy consumption inverse optimization mechanism for further energy efficiency improvement. Comprehensive comparative experiments demonstrate the effectiveness of the proposed algorithmic components and the exceptional performance for the RFJSSP-AC problem.