A sequential convex programming method reformulates non-convex spacecraft pointing objectives into convex cardinality minimization problems to maximize science observation time during a comet flyby under dynamics and fault constraints.
Autonomous Trajectory Planning for Rendezvous and Proximity Operations by Conic Optimization
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Empirical comparison finds Mamba with PPO superior to LSTM/GRU and SAC variants for meta-RL tuning of ICCBF class-K functions in cooperative and adversarial spacecraft RPO simulations.
citing papers explorer
-
Optimal Science-time Reorientation Policy for the Comet Interceptor Flyby via Sequential Convex Programming
A sequential convex programming method reformulates non-convex spacecraft pointing objectives into convex cardinality minimization problems to maximize science observation time during a comet flyby under dynamics and fault constraints.
-
Memory-Efficient Meta-Reinforcement Learning for Adaptive Safety-Critical Control in Adversarial Spacecraft Proximity Operations
Empirical comparison finds Mamba with PPO superior to LSTM/GRU and SAC variants for meta-RL tuning of ICCBF class-K functions in cooperative and adversarial spacecraft RPO simulations.