Adaptive Neural Network-based Unscented Kalman Filter for Robust Pose Tracking of Noncooperative Spacecraft
Tae Ha Park, Simone D'Amico

TL;DR
This paper introduces an adaptive neural network-based Unscented Kalman Filter for robust pose estimation of noncooperative spacecraft, combining CNN-based image analysis with online noise tuning for accurate rendezvous navigation.
Contribution
It develops a novel adaptive UKF framework that integrates CNN pose estimation with online process noise adjustment, validated on a new comprehensive rendezvous dataset.
Findings
Achieves sub-decimeter position accuracy
Attains degree-level orientation accuracy
Demonstrates robustness on real robotic testbed images
Abstract
This paper presents a neural network-based Unscented Kalman Filter (UKF) to estimate and track the pose (i.e., position and orientation) of a known, noncooperative, tumbling target spacecraft in a close-proximity rendezvous scenario. The UKF estimates the target's orbit and attitude relative to the servicer based on the pose information provided by a multi-task Convolutional Neural Network (CNN) from incoming monocular images of the target. In order to enable reliable tracking, the process noise covariance matrix of the UKF is tuned online using adaptive state noise compensation which leverages a newly developed closed-form process noise model for relative attitude dynamics. This paper also introduces the Satellite Hardware-In-the-loop Rendezvous Trajectories (SHIRT) dataset to enable comprehensive analyses of the performance and robustness of the proposed pipeline. SHIRT comprises the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInertial Sensor and Navigation · Target Tracking and Data Fusion in Sensor Networks · Space Satellite Systems and Control
