Astrodynamics最新文献_第4页

Real-time autonomous guidance generation around small bodies via Sequential Convex Programming 基于序贯凸规划的小体实时自主制导生成

IF 6.5 1区物理与天体物理

Astrodynamics Pub Date : 2026-03-11 DOI: 10.1007/s42064-025-0281-5

Enrico Belloni, Michèle Lavagna

{"title":"Real-time autonomous guidance generation around small bodies via Sequential Convex Programming","authors":"Enrico Belloni, Michèle Lavagna","doi":"10.1007/s42064-025-0281-5","DOIUrl":"10.1007/s42064-025-0281-5","url":null,"abstract":"<div><p>This paper introduces a novel approach to real-time convex guidance generation for spacecraft navigating in proximity to small celestial bodies, such as asteroids or small moons. The proposed method leverages Sequential Convex Programming (SCP) techniques to model and navigate irregular gravity fields encountered near these bodies, addressing the strong nonlinearities by iteratively refining a convex guidance sub-problem. The key contribution is the development of an adaptive algorithm that autonomously determines the optimal time of flight and dynamically adjusts to the gravitational environment, enabling spacecraft to autonomously generate robust guidance trajectories in real time including a non-convex collision avoidance constraint. The algorithm is developed in library-free C code to be ready for real-time embedded implementation and gain a realistic understanding on possible onboard application. The efficacy of the proposed method is validated for both asteroids and small moons through numerical simulations including sliding-mode close-loop control, showcasing high accuracy, computational efficiency, and flexibility to different environments.</p><div><figure><div><div><picture><source><img></source></picture><span>The alternative text for this image may have been generated using AI.</span></div></div></figure></div></div>","PeriodicalId":52291,"journal":{"name":"Astrodynamics","volume":"10 2","pages":"319 - 337"},"PeriodicalIF":6.5,"publicationDate":"2026-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147751219","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Finite-time fault-tolerant consensus control for multiple solar sail formation flying around heliocentric inclined elliptic displaced orbits 绕日心倾斜椭圆轨道飞行的多太阳帆编队有限时间容错一致性控制

IF 6.5 1区物理与天体物理

Astrodynamics Pub Date : 2026-03-11 DOI: 10.1007/s42064-025-0272-6

Lei Liu, Jinguo Liu, Xin Zhang

{"title":"Finite-time fault-tolerant consensus control for multiple solar sail formation flying around heliocentric inclined elliptic displaced orbits","authors":"Lei Liu, Jinguo Liu, Xin Zhang","doi":"10.1007/s42064-025-0272-6","DOIUrl":"10.1007/s42064-025-0272-6","url":null,"abstract":"<div><p>This paper studies solar sail heliocentric inclined elliptic displaced orbits (HIEDOs) with the application of reflectivity control devices (RCDs). In the solar sail HIEDO, the angle between the line from the Sun to the focus and the elliptic orbital plane is variable. A novel method is given to solve the sail attitude angles and the state of RCDs to achieve HIEDOs. Furthermore, this paper analyzes the problem of multiple solar sail formation flying (MSSFF) around HIEDOs, which consists of a chief and multiple deputies. The chief moves in an HIEDO and does not need to obtain the information from the deputies. The deputies need to receive the information from the chief, and an undirected connected graph is adopted to represent the information exchange structure between the deputies. Considering the convergence speed and reliability of the solar sail formation system, an innovative finite-time fault-tolerant distributed coordinated control scheme is devised. Under this control scheme, the deputies can consistently converge to the expected solar sail formation configuration within a finite time, even in the presence of the actuator effectiveness faults within a certain range. Finally, an example is used to verify the validity of the designed control scheme.</p><div><figure><div><div><picture><source><img></source></picture><span>The alternative text for this image may have been generated using AI.</span></div></div></figure></div></div>","PeriodicalId":52291,"journal":{"name":"Astrodynamics","volume":"10 2","pages":"219 - 237"},"PeriodicalIF":6.5,"publicationDate":"2026-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147751145","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Trajectory design for comet 67P/Churyumov–Gerasimenko mission: Multiple gravity assist analysis using Tisserand Graph 彗星67P/ Churyumov-Gerasimenko任务的轨道设计：使用Tisserand Graph的多重重力辅助分析

IF 6.5 1区物理与天体物理

Astrodynamics Pub Date : 2026-03-11 DOI: 10.1007/s42064-025-0275-3

Zhuojin Li, Yangxin Wang, Vsevolod Koryanov

{"title":"Trajectory design for comet 67P/Churyumov–Gerasimenko mission: Multiple gravity assist analysis using Tisserand Graph","authors":"Zhuojin Li, Yangxin Wang, Vsevolod Koryanov","doi":"10.1007/s42064-025-0275-3","DOIUrl":"10.1007/s42064-025-0275-3","url":null,"abstract":"<div><p>Optimizing interplanetary trajectories is critical for advancing deep space exploration, as it minimizes energy requirements and facilitates efficient orbital insertions. This study presents a mission trajectory model to comet 67P/Churyumov–Gerasimenko, employing a two-step approach that combines the Tisserand Graph (TG) method with a Genetic Algorithm (GA). In the first step, the complex mixed-integer nonlinear programming (MINLP) problem is simplified into a combinatorial search using a TG-based Depth-Limited Tree Search (DLTS) algorithm, significantly narrowing the search space for initial guesses. Subsequently, the solution is refined through accelerated optimization with a GA. To address the fixed terminal phase constraint at comet 67P, a reverse-search strategy for launch windows reformulates the problem into a non-linear programming framework with one fixed and one free endpoint. As a result, 11 feasible trajectory scenarios to comet 67P within the next 15 years were found, validated across four launch vehicle options. To further minimize fuel consumption, the study adopts fuel consumption as the performance index and applies a continuation method to verify the feasibility of these transfers under various Hall thruster models for low-thrust propulsion. The proposed approach thus provides a validated, fuel-efficient set of trajectory options, significantly enhancing planning flexibility for comet 67P exploration in upcoming decades.</p><div><figure><div><div><picture><source><img></source></picture><span>The alternative text for this image may have been generated using AI.</span></div></div></figure></div></div>","PeriodicalId":52291,"journal":{"name":"Astrodynamics","volume":"10 2","pages":"239 - 259"},"PeriodicalIF":6.5,"publicationDate":"2026-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147751144","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Differential corrections algorithm for initial orbit determination in the cislunar region using angle-only measurements 仅使用角度测量的地月区域初始轨道确定的微分修正算法

IF 8.1 1区物理与天体物理

Astrodynamics Pub Date : 2026-03-11 DOI: 10.1007/s42064-026-0302-z

Seur Gi Jo, Brian Baker-McEvilly, David Canales

{"title":"Differential corrections algorithm for initial orbit determination in the cislunar region using angle-only measurements","authors":"Seur Gi Jo, Brian Baker-McEvilly, David Canales","doi":"10.1007/s42064-026-0302-z","DOIUrl":"10.1007/s42064-026-0302-z","url":null,"abstract":"<div><p>As space traffic continues to increase in the cislunar region, accurately determining the trajectories of objects operating within this domain becomes critical. However, due to the combined gravitational influences of the Earth and Moon, orbital dynamics in this region are highly nonlinear and often exhibit chaotic behavior, posing significant challenges for trajectory determination. Many existing methods attempt to address this complexity using machine learning models, advanced optimization techniques, or sensors that directly measure distance to the target, approaches that often increase computational burden and system complexity. This work presents a novel initial orbit determination (IOD) algorithm for cislunar objects based solely on three angle-only measurements taken at three discrete times. The core methodology builds upon a differential corrections framework which iteratively refines the target’s trajectory to satisfy line-of-sight constraints. Numerical simulations show that the algorithm achieves accurate IOD with minimal observational data. Its simplicity and efficiency make it well suited for onboard implementation in resource-constrained cislunar missions, owing to its lightweight correction scheme and limited data requirements.</p><div><figure><div><div><picture><source><img></source></picture></div></div></figure></div></div>","PeriodicalId":52291,"journal":{"name":"Astrodynamics","volume":"10 4","pages":"685 - 703"},"PeriodicalIF":8.1,"publicationDate":"2026-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148719086","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Augmented Lagrangian methods for handling terminal constraints in spacecraft trajectory optimization 处理航天器轨迹优化中末端约束的增广拉格朗日方法

IF 6.5 1区物理与天体物理

Astrodynamics Pub Date : 2026-02-24 DOI: 10.1007/s42064-025-0287-z

Bryn N. Fanger, Ryan P. Russell

{"title":"Augmented Lagrangian methods for handling terminal constraints in spacecraft trajectory optimization","authors":"Bryn N. Fanger, Ryan P. Russell","doi":"10.1007/s42064-025-0287-z","DOIUrl":"10.1007/s42064-025-0287-z","url":null,"abstract":"<div><p>Augmented Lagrangian methods are well-established for terminal constraint-handling but implementation varies significantly in practice. A new system-level algorithm is developed using combinations of first- versus second-order Lagrange multiplier (LM) updates, fixed versus variable LM step sizes, inner- versus outer-loop schemes for LM updates, penalty-only versus split versus concurrent LM and penalty multiplier updates, and exact versus inexact convergence criteria. Each component is combined to create twenty-two submethods that are applied to ten diverse spacecraft trajectory optimization problems with up to ten revolutions and both bang-bang and smooth thrusting profiles. Performance results indicate all submethods can be successful with varying degrees of tuning, but differ in ideal applications. Second-order inner-loop methods with step size management perform the best, but outer-loop methods with step size management and inexact convergence are more robust to tuning parameters.</p><div><figure><div><div><picture><source><img></source></picture></div></div></figure></div></div>","PeriodicalId":52291,"journal":{"name":"Astrodynamics","volume":"10 1","pages":"179 - 197"},"PeriodicalIF":6.5,"publicationDate":"2026-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s42064-025-0287-z.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147341333","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Minimum admissible region for orbit determination: Theory and applications 轨道确定的最小允许区域：理论和应用

IF 8.1 1区物理与天体物理

Astrodynamics Pub Date : 2026-02-24 DOI: 10.1007/s42064-025-0295-3

Shuailong Zhao, Jinyan Xue, Liang Yao, Yasheng Zhang, Xuefeng Tao

引用次数: 0

Multi-target spacecraft mission design using convex optimization and binary integer programming 基于凸优化和二进制整数规划的航天器多目标任务设计

IF 6.5 1区物理与天体物理

Astrodynamics Pub Date : 2026-02-24 DOI: 10.1007/s42064-025-0274-4

Jack Yarndley, Harry Holt, Roberto Armellin

{"title":"Multi-target spacecraft mission design using convex optimization and binary integer programming","authors":"Jack Yarndley, Harry Holt, Roberto Armellin","doi":"10.1007/s42064-025-0274-4","DOIUrl":"10.1007/s42064-025-0274-4","url":null,"abstract":"<div><p>The optimal design of multi-target rendezvous and flyby missions is challenging due to the combination of traditional spacecraft trajectory optimization and high-dimensional combinatorial problems. The typical approach to these problems generally requires large-scale global search techniques or simplified approximations relying on large amounts of manual labour to be performant. However, global search techniques are generally difficult to use in time- or cost-constrained scenarios due to their computational expense. This work proposes a novel combination of computationally efficient stages which work together to form a nested global optimization approach for multi-target mission design. The multi-target problem is split into seperate combinatorial and optimal control subproblems, which are recursively solved: the combinatorial problem using a novel Binary Integer Programming (BIP) formulation with fixed rendezvous timings obtaining optimal rendezvous ordering, and the optimal control problem with an adaptive-mesh Sequential Convex Programming (SCP) formulation obtaining optimal rendezvous timings for a fixed rendezvous ordering. These stages work recursively in tandem to improve the inputs to each subsequent stage until convergence is obtained. This methodology is demonstrated to offer state-of-the-art performance when applied to the Global Trajectory Optimization Competition 12 (GTOC 12) problem, to which several new best-known solutions are found.</p><div><figure><div><div><picture><source><img></source></picture></div></div></figure></div></div>","PeriodicalId":52291,"journal":{"name":"Astrodynamics","volume":"10 1","pages":"139 - 163"},"PeriodicalIF":6.5,"publicationDate":"2026-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s42064-025-0274-4.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147341334","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Trajectory design for optical on-orbit inspection missions in geostationary Earth orbit 地球静止轨道光学在轨检测任务的轨迹设计

IF 8.1 1区物理与天体物理

Astrodynamics Pub Date : 2026-02-24 DOI: 10.1007/s42064-025-0299-8

Caohuo Ban, Yiqiang Zeng, Nan Zhang, Hexi Baoyin

{"title":"Trajectory design for optical on-orbit inspection missions in geostationary Earth orbit","authors":"Caohuo Ban, Yiqiang Zeng, Nan Zhang, Hexi Baoyin","doi":"10.1007/s42064-025-0299-8","DOIUrl":"10.1007/s42064-025-0299-8","url":null,"abstract":"<div><p>This paper presents a novel parametric optimization framework for achieving optical on-orbit inspection missions in geostationary Earth orbit (GEO) while satisfying multiple mission constraints. To better represent real-world scenarios, the effects of perturbations in GEO are examined. Additionally, multiple constraints are incorporated into the problem, including the imaging distance and solar angle, observation duration, time interval of maneuvers, impulse magnitude, and the mission deadline. To address these constraints, we employ parametric methods and propose a novel impulse division and replanning (IDR) method, which forms the basis of the optimization framework to minimize fuel consumption and mission duration. The optimization framework is then solved using the parallel particle swarm optimization (PPSO) algorithm, and its effectiveness is demonstrated through a set of instances. The simulations, which compare the proposed IDR method with the penalty function method of velocity increments (PFV), show improved performance in terms of reduced constraint violations and lower fuel costs.</p><div><figure><div><div><picture><source><img></source></picture></div></div></figure></div></div>","PeriodicalId":52291,"journal":{"name":"Astrodynamics","volume":"10 4","pages":"625 - 637"},"PeriodicalIF":8.1,"publicationDate":"2026-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148719091","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Guidance and control networks with periodic activation functions 具有周期性激活函数的制导和控制网络

IF 6.5 1区物理与天体物理

Astrodynamics Pub Date : 2026-02-16 DOI: 10.1007/s42064-025-0285-1

Sebastien Origer, Dario Izzo

引用次数: 0

Design of natural Lissajous formations with nearly constant baselines 自然利萨尤地层的设计与几乎恒定的基线

IF 6.5 1区物理与天体物理

Astrodynamics Pub Date : 2026-02-16 DOI: 10.1007/s42064-025-0277-1

Sergey P. Trofimov, Maksim G. Shirobokov, Denis G. Perepukhov, Sergey A. Shestakov

引用次数: 0