Decentralized State Estimation Algorithm of Centralized Equivalent Precision for Formation Flying Spacecrafts Based on Junction Tree

Abstract EN

As centralized state estimation algorithms for formation flying spacecraft would suffer from high computational burdens when the scale of the formation increases, it is necessary to develop decentralized algorithms.

To the state of the art, most decentralized algorithms for formation flying are derived from centralized EKF by simplification and decoupling, rendering suboptimal estimations.

In this paper, typical decentralized state estimation algorithms are reviewed, and a new scheme for decentralized algorithms is proposed.

In the new solution, the system is modeled as a dynamic Bayesian network (DBN).

A probabilistic graphical method named junction tree (JT) is used to analyze the hidden distributed structure of the DBNs.

Inference on JT is a decentralized form of centralized Bayesian estimation (BE), which is a modularized three-step procedure of receiving messages, collecting evidences, and generating messages.

As KF is a special case of BE, the new solution based on JT is equivalent in precision to centralized KF in theory.

A cooperative navigation example of a three-satellite formation is used to test the decentralized algorithms.

Simulation results indicate that JT has the best precision among all current decentralized algorithms.