Attitude control of a satellite with redundant thrusters

Redundant thrusters are generally used for a reliable attitude control system. Also, redundant thrusters yield a better performance if they are used appropriately. In this paper, the authors propose an efficient redundancy management algorithm to reduce the fuel consumption. The algorithm is based on a linear programming problem which is a constrained optimization problem. For the algorithm, a cost function is defined as a quantity related to the fuel consumption for a maneuver. The independent variables are the thrusters' on-times which are control input variables of a satellite dynamic model. The advantage of the proposed method is verified by numerical examples. The examples show that the proposed method consumes less fuel than an existing method for a given maneuvering command. A sub-optimal algorithm is also discussed for an onboard computation. The proposed algorithm is applied to two maneuvers: move-to-rest and rest-to-rest. This is verified by a numerical simulation.     

Efficient robust AMF using the FRACTA algorithm

The FRACTA algorithm has been shown to be an effective space-time adaptive processing (STAP) methodology for the airborne radar configuration in which there exists nonhomogeneous clutter, jamming, and dense target clusters. Further developments of the FRACTA algorithm are presented here in which the focus is on the robust, efficient implementation of the FRACTA algorithm. Enhancements to the FRACTA algorithm include a censoring stopping mechanism, an alternative data blocking approach for adaptive power residue (APR) censoring, and a fast reiterative censoring (RC) procedure. Furthermore, a coherent processing interval (CPI) segmentation scheme for computing the adaptive weights is presented as an alternative approach to computing the adaptive matched filter (AMF) weight vector that allows for lower sample support and reduced computational complexity. The enhanced FRACTA algorithm, denoted as FRACTA.E, is applied to the KASSPER I challenge datacube which possesses dense ground target clusters that are known to have a significant deleterious effect on standard adaptive matched filtering (AMF) processors. It is shown that the FRACTA.E algorithm outperforms and is considerably more computationally efficient than both the original FRACTA algorithm and the standard sliding window processing (SWP) approach. Furthermore, using the KASSPER I datacube, the FRACTA.E algorithm is shown to have the same detection performance as the clairvoyant algorithm where the exact range-dependent clutter covariance matrices are known.     

CCSDS近地LDPC译码算法研究

针对CCSDS（空间数据系统咨询委员会）推荐的近地LDPC（低密度奇偶校验）码技术进行了研究,建立了和积译码算法、对数似然和积译码算法、最小和译码算法的数学模型,并对上述译码算法的译码复杂度和译码性能进行了仿真分析.分析结果表明,和积译码算法与对数似然和积译码算法的译码性能距离香农限1.2 dB,最小和译码算法的译码性能距离香农限1.45 dB.因此,提出基于最小和译码算法的改进算法——偏移最小和译码算法与归一化最小和译码算法,并分析了这2种译码算法的译码复杂度,同时进行了大量仿真实验.实验结果表明,当偏移因子β=0.15时,偏移最小和译码算法性能达到最优,译码性能距离香农限1.25 dB;当归一化因子α=0.741 2时,归一化译码算法的译码性能达到最优,译码性能距离香农限1.2 dB.归一化译码算法具有优异的译码性能和合理的复杂度,可以遴选作为CCSDSLDPC的译码算法用于工程实现.此外,还研究了迭代次数对译码性能的影响,结果表明,当迭代次数大于10次时,译码性能提升不再明显,故工程实现时迭代次数应设置为10次.     

矩阵数值秩的一种确定方法及其在控制系统中的应用

一、矩阵的数值秩 矩阵秩的确定在现代控制理论中占有重要的地位。在代数理论中,用行列式或特征值来判断矩阵的秩,由于舍入误差的存在,用计算机判断矩阵秩时,这些方法是不完全适用的。     

Sequential Piecewise Recursive Filter for GPS Low-Dynamics Navigation

The design, implementation, and performance of a real-time estimation algorithm, referred to in this paper as the sequential piecewise recursive (SPWR) algorithm, for the global-positioning system (GPS) low-dynamics navigation system is described. The SPWR algorithm for this application was implemented in single precision arithmetic (32 bit, floating point). Numerical results are presented covariance and filter gains at a slower rate than the state measurement update, and it uses U-D factor formulation to perform covariance computations. The SPWR algorithm saves real-time processing requirements without appreciable degradation of filter performance. Another important feature of the SPWR algorithm is that it incorporates pseudorange and delta-range data from each GPS satellite sequentially for navigation solution. The SPWR algorithm, for this application, was implemented in single precision arithmetic (32 bit, floating point). Numerical results are presented.     

求解含调整时间排序问题的混合遗传算法

利用仿真工具将启发式方法与遗传算法相结合,提出了一种求解Job Shop排序问题的混合算法框架,利用启发式规则引导遗传搜索过程,以提高遗传算法的求解效率。在求解过程中,遗传算法仅对每台机器的第1道工序搜索寻优,通过仿真过程安排后续工序,在仿真过程中,利用启发式规则确定工件的加工优先级。在以上框架基础上,针对含调整时间的作业排序问题建立了一种混合算法GA-SPTS,通过与已有算法的比较表明,该算法对这类问题具有很好的求解性能。     

非线性系统中多传感器目标跟踪融合算法研究

 研究了在非线性系统中 ,基于转换坐标卡尔曼滤波器的多传感器目标跟踪融合算法。通过分析得出 :在非线性系统的多传感器目标跟踪中 ,基于转换坐标卡尔曼滤波器 ( CMKF)的分布融合估计基本可以重构中心融合估计。仿真实验也证明了此结论。由此可见分布的 CMKFA是非线性系统中较优的分布融合算法     

Modified Grid Algorithm for Noisy All-Sky Autonomous Star Identification

Grid algorithm is a classical algorithm for all-sky autonomous star identification. However its recognition rate decreases rapidly when the position and magnitude noise increases in the star image. In order to overcome this problem, a modified grid algorithm called the "elastic gray grid algorithm" is proposed. Gray pattern and elastic template matching are introduced into the grid algorithm to enhance its ability to tolerate the position and magnitude noise. Experimental results show that the modified grid algorithm performs better compared with the original one. The elastic gray grid algorithm reached up to a 100% recognition rate under random positional noise in our test bed. Furthermore it increases the original recognition rate from 69.86% to 97%, under the same condition, for both the position and the magnitude noise.     

近地小推力转移轨道的加权组合制导策略

 研究了近地小推力转移轨道的制导问题,给出了一种基于局部最优控制律的自主制导算法。推导出了各改进春分点根数对应的局部最优控制律;通过最优推力分配和目标偏差两个策略,对各局部最优控制律进行动态加权组合,从而有效减少了制导律的设计参数。在此基础上,针对燃料最省转移轨道,定义了一种新的发动机开关函数。采用遗传/逐次二次规划混合优化算法计算了最优制导参数。与传统算法相比,该制导算法是一种闭环制导算法,能够实现飞行器的自主制导,并且制导过程中无需对制导参数进行更新。以地球低轨到高轨的小推力转移为例,采用该方法分别求解了时间和燃料最省转移问题,并与传统算法进行了比较分析。数值结果验证了该算法的有效性。     

Privacy algorithm for cylindrical holographic weapons surveillancesystem

A novel personnel surveillance system has been developed to detect and identify threatening objects, which are undetectable by metal detectors, concealed on the human body. This new system can detect threats which are fabricated with plastic, liquid, metal, or ceramic. It uses millimeter-wave array technology and a cylindrical holographic imaging algorithm to provide full-body, 360-degree coverage of a person in near real-time. This system is ideally suited for mass transportation centers such as airport checkpoints that require high throughput rates and full coverage. Research and development efforts are underway to produce a privacy algorithm that removes the human features from the images while identifying the potential threats. This algorithm locates and segments the threats and places them on a wire-frame humanoid representation. The research areas for this algorithm development include artificial neural networks, image processing, edge detection, and dielectric measurements. This system is operational and results from this test and the privacy algorithm will be discussed in this paper     

Reduction rules-based search algorithm for opportunistic replacement strategy of multiple life-limited parts

The opportunistic replacement of multiple Life-Limited Parts(LLPs) is a problem widely existing in industry.The replacement strategy of LLPs has a great impact on the total maintenance cost to a lot of equipment.This article focuses on finding a quick and effective algorithm for this problem.To improve the algorithm efficiency, six reduction rules are suggested from the perspectives of solution feasibility, determination of the replacement of LLPs, determination of the maintenance occasion and solution optimality.Based on these six reduction rules, a search algorithm is proposed.This search algorithm can identify one or several optimal solutions.A numerical experiment shows that these six reduction rules are effective, and the time consumed by the algorithm is less than 38 s if the total life of equipment is shorter than 55000 and the number of LLPs is less than11.A specific case shows that the algorithm can obtain optimal solutions which are much better than the result of the traditional method in 10 s, and it can provide support for determining tobe-replaced LLPs when determining the maintenance workscope of an aircraft engine.Therefore,the algorithm is applicable to engineering applications concerning opportunistic replacement of multiple LLPs in aircraft engines.     

An LS-TLS-based sequential identification algorithm: Application toan accelerometer

Total least squares (TLS) parameter estimation is an alternative to least squares (LS) estimation when there are errors in both data matrix and observation vector. Especially, when some of the columns, not all, of the data matrix A are free of error, we call it a mixed LS-TLS problem. Accordingly, a sequential algorithm for solving a mixed LS-TLS problem is proposed here. The proposed algorithm employs an efficient algorithm to locate the minimum eigenpair, instead of singular value decomposition (SVD) which is computationally exacting. The proposed algorithm is applied to an accelerometer model to identify error parameters which are very important in inertial navigation systems (INS)     

改进最近邻算法及其在雷达目标识别中的应用

最近邻（Nearest Neighbor,简记NN）算法是一种广泛采用的非参量模式识别方法,其渐近分类错误概率不超过Bayes错误概率的两倍。但NN算法需要存贮的训练样本较多。剪辑最近邻算法通过对训练样本进行预处理,改善了NN分类器的渐近性能,也略减少了设计NN分类器所需要存贮的训练样本,但需要存贮的样本仍然较多。     

车牌识别预处理中的二值化及倾斜矫正算法

车牌识别中的预处理包括图像增强，二值化和噪声去除。由于车牌图像摄取的特殊性，使得车牌在图像中通常是倾斜的，而倾斜的车牌是很难被分割和识别的，因此车牌倾斜矫正已成为车牌识别系统中一个必需解决的问题。给出了基于图像特征线的二值化阈值确定和针对车牌图像的倾斜矫正改进算法，对车牌的水平和垂直方向分别采用了不同的矫正方法，实验结果表明此算法是快速有效的。     

基于导波传播模型的MUSIC损伤识别算法

针对结构健康监测领域的损伤近场定位问题,提出了适用于复合材料结构损伤识别的近场二维多重信号分类（MUSIC）损伤识别算法。该损伤识别算法将导波传播模型引入近场二维MUSIC损伤识别模型,构造损伤散射信号与实验差信号的互相关矩阵,通过信号子空间与噪声子空间正交特性构造近场二维MUSIC空间谱。通过数值仿真和实验验证了所提出的损伤识别算法能够有效地识别复合材料结构损伤位置信息,具有很高的定位精度和分辨率。针对飞机垂直尾翼的加强筋结构对导波传播特性影响较大的问题,提出了分区域监测的损伤检测策略,并利用基于导波传播模型的二维MUSIC空间谱损伤识别算法成功地识别飞机垂直尾翼结构损伤,实现了复杂复合材料结构损伤识别的工程验证。     

一种用于机动目标跟踪的新自适应卡尔曼滤波算法

在“当前”模型的概念下,从工程实现的背景出发,提出了一种用于机动目标跟踪的新自适应卡尔曼滤波算法。基本思想是通过对加速度项引入加权因子来进一步突出“当前”信息的作用,为“当前”模型提供更加准确的“当前”信息。蒙特卡罗模拟结果表明,算法不仅克服了“当前”模型自适应卡尔曼滤波算法的缺陷,而且使跟踪性能得到进一步的提高。     

基于改进蚁群算法的飞机低空突防航路规划

采用蚁群算法实现了飞机低空突防的航路规划，为航路规划问题提供了新的解决思路。并对原始蚁群算法进行了改进，提出了保留最优解、自适应选择策略和自适应信息素调整准则，有效地提高了算法的收敛速度和解的性能。最后用计算机进行了仿真，取得了较好的结果。     

Efficient scheduling algorithm for demand-assigned TDMA satellitesystems

An efficient scheduling algorithm (stations burst plan) for demand-assigned time-division multiple-access (TDMA) satellite network systems is introduced. The total demand for transmitting data through a transponder may exceed the available bit-rate capacity, and a scheduler of the system wishes to utilize the system with minimum changes of slot allocations while maximizing throughputs. By implementing such a burst-plan algorithm, transmission of all demanded data traffic can be completed with minimum unused resources (idle slots). The underlying ideas adopted for the algorithm are that jobs with shorter remaining processing times should have higher priorities and that as many jobs are processed at a time as possible. The algorithm is particularly useful for deriving smooth burst plans for a satellite system with a large number of ground stations     

Maximun Posterion Probability Demodulation of Angle-Modulated Signals

An algorithm is presented for maximum posterior probability (MPP) demodulation of angle-modulated signals. A sampled data version of the problem is considered, in which additive Gaussian noise and Gaussian modulating signal are assumed. The algorithm is a numerical method for solving the nonlinear equations which are necessary conditions for MPP estimation. Results of a simulation of the algorithm are presented and discussed. Improvements in performance with respect to a phaselocked loop appear to stem from use of data before and after the time position of a phase estimate and from optimization of performance at low signal-to-noise ratio (SNR) as well as at high SNR.     

Numerical optimization method for array signal processing

This paper presents a novel and efficient extrema-mapping algorithm, which we call the roller-coaster algorithm. Two versions of the algorithm, the one-dimensional (1-D) and the two-dimensional (2-D) roller-coaster, are developed. Its applicability to array signal processing is demonstrated. We use it to solve a multiple source direction finding problem using multiple signal classification (MUSIC), beamformer, and minimum variance methods, and for antenna array design. The algorithm is based on heuristic assumptions and its properties are not proved. Yet, its performance was tested in many simulated experiments, yielding favorable results