Improving Computational Efficiency for Powered Descent Guidance via Transformer-based Tight Constraint Prediction

• URL: http://arxiv.org/abs/2311.05135v2
• Date: Mon, 11 Dec 2023 17:48:21 GMT
• Title: Improving Computational Efficiency for Powered Descent Guidance via Transformer-based Tight Constraint Prediction
• Authors: Julia Briden, Trey Gurga, Breanna Johnson, Abhishek Cauligi, Richard Linares
• Abstract summary: Transformer-based Powered Descent Guidance (T-PDG) is a scalable algorithm for reducing the computational complexity of the direct optimization formulation of the spacecraft powered descent guidance problem. T-PDG uses data from prior runs of trajectory optimization algorithms to train a transformer neural network, which accurately predicts the relationship between problem parameters. A safe and optimal solution is guaranteed by including a feasibility check in T-PDG before returning the final trajectory.
• Score: 1.2074552857379275
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this work, we present Transformer-based Powered Descent Guidance (T-PDG), a scalable algorithm for reducing the computational complexity of the direct optimization formulation of the spacecraft powered descent guidance problem. T-PDG uses data from prior runs of trajectory optimization algorithms to train a transformer neural network, which accurately predicts the relationship between problem parameters and the globally optimal solution for the powered descent guidance problem. The solution is encoded as the set of tight constraints corresponding to the constrained minimum-cost trajectory and the optimal final time of landing. By leveraging the attention mechanism of transformer neural networks, large sequences of time series data can be accurately predicted when given only the spacecraft state and landing site parameters. When applied to the real problem of Mars powered descent guidance, T-PDG reduces the time for computing the 3 degree of freedom fuel-optimal trajectory, when compared to lossless convexification, from an order of 1-8 seconds to less than 500 milliseconds. A safe and optimal solution is guaranteed by including a feasibility check in T-PDG before returning the final trajectory.

Related papers

• DELTAv2: Accelerating Dense 3D Tracking [79.63990337419514]
  We propose a novel algorithm for accelerating dense long-term 3D point tracking in videos.<n>We introduce a coarse-to-fine strategy that begins tracking with a small subset of points and progressively expands the set of tracked trajectories.<n>The newly added trajectories are using a learnable module, which is trained end-to-end alongside the tracking network.
  arXiv  Detail & Related papers  (2025-08-02T03:15:47Z)
• Data-driven Fuzzy Control for Time-Optimal Aggressive Trajectory Following [0.7373617024876725]
  This work presents a data-driven fuzzy controller framework that is guided by a time-optimal trajectory for multicopter tracking problems. A fuzzy controller consisting of a stabilizing controller near hover conditions and an autoregressive moving average (ARMA) controller, trained to mimic the time-optimal aggressive trajectory, is constructed using the Takagi-Sugeno fuzzy framework.
  arXiv  Detail & Related papers  (2025-04-09T00:06:15Z)
• End-to-End Imitation Learning for Optimal Asteroid Proximity Operations [0.0]
  We propose an end-to-end algorithm utilizing neural networks to generate near-optimal control commands from raw sensor data. A hybrid model predictive control (MPC) guided imitation learning controller delivers improvements in computational efficiency over a traditional MPC controller.
  arXiv  Detail & Related papers  (2025-02-03T04:09:20Z)
• Tight Constraint Prediction of Six-Degree-of-Freedom Transformer-based Powered Descent Guidance [1.1254693939127909]
  This work introduces Transformer-based Successive Convexification (T-SCSCx) for efficient six-time magnitude-of divergence times. By learning to predict the set of constraints at the optimal problem's solution, T-SCSCx creates minimal the reduced-size problem with only the tight constraints.
  arXiv  Detail & Related papers  (2025-01-01T19:07:27Z)
• Towards Robust Spacecraft Trajectory Optimization via Transformers [17.073280827888226]
  Future multi-spacecraft missions require robust autonomous optimization capabilities to ensure safe and efficient rendezvous operations. To mitigate this burden, introduced generative Transformer model to provide robust optimal initial guesses. This work extends capabilities of ART to address robustconstrained optimal control problems.
  arXiv  Detail & Related papers  (2024-10-08T00:58:42Z)
• SPARE: Symmetrized Point-to-Plane Distance for Robust Non-Rigid Registration [76.40993825836222]
  We propose SPARE, a novel formulation that utilizes a symmetrized point-to-plane distance for robust non-rigid registration. The proposed method greatly improves the accuracy of non-rigid registration problems and maintains relatively high solution efficiency.
  arXiv  Detail & Related papers  (2024-05-30T15:55:04Z)
• Edge-Enabled Real-time Railway Track Segmentation [0.0]
  We propose an edge-enabled real-time railway track segmentation algorithm. It is optimized to be suitable for edge applications by optimizing the network structure and quantizing the model after training. Experimental results demonstrate that our enhanced algorithm achieves an accuracy level of 83.3%.
  arXiv  Detail & Related papers  (2024-01-21T13:45:52Z)
• Accelerating genetic optimization of nonlinear model predictive control by learning optimal search space size [0.8057006406834467]
  This paper proposes an approach to accelerate the optimization of NMPC by learning optimal space size. The proposed approach was compared on two nonlinear systems and compared with two other-based NMPC approaches.
  arXiv  Detail & Related papers  (2023-05-14T08:10:49Z)
• Correlating sparse sensing for large-scale traffic speed estimation: A Laplacian-enhanced low-rank tensor kriging approach [76.45949280328838]
  We propose a Laplacian enhanced low-rank tensor (LETC) framework featuring both lowrankness and multi-temporal correlations for large-scale traffic speed kriging. We then design an efficient solution algorithm via several effective numeric techniques to scale up the proposed model to network-wide kriging.
  arXiv  Detail & Related papers  (2022-10-21T07:25:57Z)
• Truncated tensor Schatten p-norm based approach for spatiotemporal traffic data imputation with complicated missing patterns [77.34726150561087]
  We introduce four complicated missing patterns, including missing and three fiber-like missing cases according to the mode-drivenn fibers. Despite nonity of the objective function in our model, we derive the optimal solutions by integrating alternating data-mputation method of multipliers.
  arXiv  Detail & Related papers  (2022-05-19T08:37:56Z)
• Feasible Low-thrust Trajectory Identification via a Deep Neural Network Classifier [1.5076964620370268]
  This work proposes a deep neural network (DNN) to accurately identify feasible low thrust transfer prior to the optimization process. The DNN-classifier achieves an overall accuracy of 97.9%, which has the best performance among the tested algorithms.
  arXiv  Detail & Related papers  (2022-02-10T11:34:37Z)
• Distributed stochastic optimization with large delays [59.95552973784946]
  One of the most widely used methods for solving large-scale optimization problems is distributed asynchronous gradient descent (DASGD) We show that DASGD converges to a global optimal implementation model under same delay assumptions.
  arXiv  Detail & Related papers  (2021-07-06T21:59:49Z)
• JUMBO: Scalable Multi-task Bayesian Optimization using Offline Data [86.8949732640035]
  We propose JUMBO, an MBO algorithm that sidesteps limitations by querying additional data. We show that it achieves no-regret under conditions analogous to GP-UCB. Empirically, we demonstrate significant performance improvements over existing approaches on two real-world optimization problems.
  arXiv  Detail & Related papers  (2021-06-02T05:03:38Z)
• Boosted Genetic Algorithm using Machine Learning for traffic control optimization [4.642759477873937]
  This paper presents a novel methodology for optimizing the traffic signal timings in signalized urban intersections. With the purpose of producing fast and reliable decisions, we combine the fast running Machine Learning (ML) algorithms and the reliable Genetic Algorithms (GA) We show that the new BGA-ML is much faster than the original GA algorithm and can be successfully applied under non-recurrent incident conditions.
  arXiv  Detail & Related papers  (2021-03-11T00:39:18Z)
• Distributed Multi-agent Meta Learning for Trajectory Design in Wireless Drone Networks [151.27147513363502]
  This paper studies the problem of the trajectory design for a group of energyconstrained drones operating in dynamic wireless network environments. A value based reinforcement learning (VDRL) solution and a metatraining mechanism is proposed.
  arXiv  Detail & Related papers  (2020-12-06T01:30:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.