skip to main content


Title: Learning Constrained Corner Node Trajectories of a Tether Net System for Space Debris Capture
The earth’s orbit is becoming increasingly crowded with debris that poses significant safety risks to the operation of existing and new spacecraft and satellites. The active tether-net system, which consists of a flexible net with maneuverable corner nodes, launched from a small autonomous spacecraft, is a promising solution to capturing and disposing of such space debris. The requirement of autonomous operation and the need to generalize over debris scenarios in terms of different rotational rates makes the capture process significantly challenging. The space debris could rotate about multiple axes, which along with sensing/estimation and actuation uncertainties, call for a robust, generalizable approach to guiding the net launch and flight – one that can guarantee robust capture. This paper proposes a decentralized actuation system combined with reinforcement learning based on prior work in designing and controlling this tether-net system. In this new system, four microsatellites with thrusters act as the corner nodes of the net, and can thus help control the flight of the net after launch. The microsatellites pull the net to complete the task of approaching and capturing the space debris. The proposed method uses a reinforcement learning framework that integrates a proximal policy optimization to find the optimal solution based on the dynamics simulation of the net and the MUs in Vortex Studio. The reinforcement learning framework finds the optimal trajectory that is both energy-efficient and ensures a desired level of capture quality  more » « less
Award ID(s):
2128578
PAR ID:
10453051
Author(s) / Creator(s):
; ; ; ;
Date Published:
Journal Name:
AIAA AVIATION 2023 Forum
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Tether-nets deployed from a chaser spacecraft are a promising solution to capturing space debris. The success of the one-shot capture process depends on the net’s structural dynamic properties, attributed to its physical design, and on the ability to perform an optimal launch and closure subject to sensing and actuation uncertainties. Hence, this paper presents a reliability-based optimization framework to simultaneously optimize the net design and its launch and closing actions to minimize the system mass (case 1) or closing time (case 2) while preserving a specified probability of capture success. Success is assessed in terms of a capture quality index and the number of locked node pairs. Gaussian noise is used to model the uncertainties in the dynamics, state estimation, and actuation of the tether-net, which is propagated via Monte Carlo sampling. To account for uncertainties and ensure computational efficiency, given the cost of simulating the tether-net dynamics, Bayesian optimization is used to solve this problem. Optimization results show that the mission success rate in the presence of uncertainties has increased from 75% to over 98%, while the capture completion time has almost halved.

     
    more » « less
  2. Autonomous systems, such as Unmanned Aerial Vehicles (UAVs), are expected to run complex reinforcement learning (RL) models to execute fully autonomous positionnavigation-time tasks within stringent onboard weight and power constraints. We observe that reducing onboard operating voltage can benefit the energy efficiency of both the computation and flight mission, however, it can also result in on-chip bit failures that are detrimental to mission safety and performance. To this end, we propose BERRY, a robust learning framework to improve bit error robustness and energy efficiency for RL-enabled autonomous systems. BERRY supports robust learning, both offline and on-board the UAV, and for the first time, demonstrates the practicality of robust low-voltage operation on UAVs that leads to high energy savings in both compute-level operation and systemlevel quality-of-flight. We perform extensive experiments on 72 autonomous navigation scenarios and demonstrate that BERRY generalizes well across environments, UAVs, autonomy policies, operating voltages and fault patterns, and consistently improves robustness, efficiency and mission performance, achieving up to 15.62% reduction in flight energy, 18.51% increase in the number of successful missions, and 3.43× processing energy reduction. 
    more » « less
  3. One of the most promising solutions to the issue of the increasing amount of space debris orbiting the Earth is net-based Active Debris Removal. For accurate contact detection of thin target geometries with lumped-parameter modeled nets in simulations, many nodes (possibly 10 or more) must be introduced along threads. However, such introduction significantly increases the computational cost of simulations. This work proposes a modeling approach that introduces additional nodes during the deployment phase of the simulation rather than at the beginning to reduce such costs. The approach conserves the net’s total linear momentum and adheres to the work-energy principle when employed mid-simulation. Through both quantitative and qualitative comparisons of nets with and without model switching, this work demonstrates that the methodology does not alter the overall dynamics of the net flight toward the target in a significant way. Capture simulations of a scaled-down Envisat satellite model are performed, where the introduction of model switching results in approx. 2.45 times faster simulation without compromising accuracy in the representation of capture. 
    more » « less
  4. Hypergraphs capture multi-way relationships in data, and they have consequently seen a number of applications in higher-order network analysis, computer vision, geometry processing, and machine learning. In this paper, we develop theoretical foundations for studying the space of hypergraphs using ingredients from optimal transport. By enriching a hypergraph with probability measures on its nodes and hyperedges, as well as relational information capturing local and global structures, we obtain a general and robust framework for studying the collection of all hypergraphs. First, we introduce a hypergraph distance based on the co-optimal transport framework of Redko et al. and study its theoretical properties. Second, we formalize common methods for transforming a hypergraph into a graph as maps between the space of hypergraphs and the space of graphs, and study their functorial properties and Lipschitz bounds. Finally, we demonstrate the versatility of our Hypergraph Co-Optimal Transport (HyperCOT) framework through various examples. 
    more » « less
  5. Tethered capture of space debris is a promising method of Active Debris Removal, but has numerous well-known challenges in the post-capture phase. Control of the system in this phase is complicated by nonlinear dynamics with the potential of chaotic motion, unknown debris parameters, and debris tumbling. The inherent uncertainty present in the system and the need for control often necessitate the estimation of debris states and parameters such that the post-capture system can remain controlled. To this end, a relative distance Proportional-Integral-Derivative control and an Unscented Kalman Filter are implemented during the post-capture phase of an ADR mission. It is assumed that some debris (target) states and properties are unknown to the chaser, requiring the estimation of the attitude, angular rates, and principal moments of inertia of the target. For estimating these states, the UKF uses measurements of the tether tension magnitude and pixel coordinates of feature points on the target provided by a camera mounted on the chaser. Both estimation and control are done simultaneously, simulating online estimation and control of an ADR mission. The PID control was found to maintain safe conditions when using the estimated states in two separate Monte-Carlo simulations, differing in the measurement frequency of the pixel coordinates, while the estimation of the principal moments of inertia of the debris was satisfactory. 
    more » « less