5 November 2018 in Aircraft Engineering and Aerospace Technology
Purpose: This paper aims to propose a constant-gain Kalman Filter algorithm based on the projection method and constant dimension projection, which ensures that the dimension of the observation matrix obtained is maintained when there is a satellite with multiple sensors. Design/methodology/approach: First, a time-invariant observation matrix is determined with the projection method, which does not require the Jacobi matrix to be calculated. Second, the constant-gain matrix replaces the EKF (extended Kalman filter) gain matrix, which requires online computation, considerably improving the stability and real-time properties of the algorithm. Findings: The simulation results indicate that compared to the EKF algorithm, the constant-gain Kalman filter algorithm has a considerably lower computational burden and improved real-time properties and stability without a significant loss of accuracy. The algorithm based on the constant dimension projection has better real-time properties, simpler computations and greater fault tolerance than the conventional EKF algorithm when handling an attitude determination system with three or more star trackers. Originality/value: In satellite attitude determination systems, the constant-gain Kalman Filter algorithm based on the projection method reduces the large computational burden and improve the real-time properties of the EKF algorithm.
2 May 2017 in Aircraft Engineering and Aerospace Technology
Purpose: This paper aims to present a multiple-model adaptive estimator (MMAE) to calibrate the star sensor low frequency error (LFE). The star sensor LFE, which is caused primarily by the periodic thermal distortion, has a great impact on spacecraft attitude determination accuracy. Design/methodology/approach: The unfavorable effect of the LFE can be partly eliminated by using the calibration algorithm based on the augmented Kalman filter (AKF). However, the AKF may be worse than the traditional Kalman filter (KF) in the absence of the LFE. To cope with this problem, the MMAE is applied first time for combining the AKF and the KF in the spacecraft attitude determination system, such that satisfactory performance can be achieved in different operating scenarios. Findings: The convergence of the presented MMAE is demonstrated through a formal derivation. A novel method is proposed to tune the MMAE design parameter, such that the convergence rate of the estimator is increased. It is shown via numerical studies that the presented algorithm outperforms the AKF and the KF. Practical implications: The calibration algorithm is applicable for spacecraft attitude determination. Originality/value: An effective star sensor LFE calibration algorithm based on the MMAE is developed. In addition, a novel method is proposed to increase convergence rate of the estimator.
26 June 2023 in ACM Transactions on Privacy and Security
Recent advances of consensus control have made it significant in multi-agent systems such as in distributed machine learning, distributed multi-vehicle cooperative systems. However, during its application it is crucial to achieve resilience and privacy; specifically, when there are adversary/faulty nodes in a general topology structure, normal agents can also reach consensus while keeping their actual states unobserved. In this article, we modify the state-of-the-art Q-consensus algorithm by introducing predefined noise or well-designed cryptography to guarantee the privacy of each agent state. In the former case, we add specified noise on agent state before it is transmitted to the neighbors and then gradually decrease the value of noise so the exact agent state cannot be evaluated. In the latter one, the Paillier cryptosystem is applied for reconstructing reward function in two consecutive interactions between each pair of neighboring agents. Therefore, multi-agent privacy-preserving resilient consensus (MAPPRC) can be achieved in a general topology structure. Moreover, in the modified version, we reconstruct reward function and credibility function so both convergence rate and stability of the system are improved. The simulation results indicate the algorithms’ tolerance for constant and/or persistent faulty agents as well as their protection of privacy. Compared with the previous studies that consider both resilience and privacy-preserving requirements, the proposed algorithms in this article greatly relax the topological conditions. At the end of the article, to verify the effectiveness of the proposed algorithms, we conduct two sets of experiments, i.e., a smart-car hardware platform consisting of four vehicles and a distributed machine learning platform containing 10 workers and a server.
27 March 2023 in IEEE Transactions on Control of Network Systems
This paper addresses the distributed consensus problem in the presence of faulty nodes. A novel weight learning algorithm is introduced such that neither the network connectivity nor a sequence of history records is required to achieve resilient consensus. The critical idea is to dynamically update the interaction weights among neighbors learnt from their credibility measurement. Basically, we define a reward function that is inversely proportional to the state difference to its neighbor, and then adjust the credibility based on the reward derived at the present step and the previous credibility. In such a way, the interaction weights are updated at every step, which integrates the historic information and degrades the influences from faulty nodes. Four classes of faulty nodes are considered, and both fixed and stochastic topologies are involved in this paper. Furthermore, we apply this novel approach in clock synchronization problem. By updating the logical clock skew and offset via the corresponding weight learning algorithms, respectively, the logical clock synchronization is eventually achieved regardless of faulty nodes. Simulations are provided to illustrate the effectiveness of the strategy.