Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2201.00101

Help | Advanced Search

Computer Science > Robotics

arXiv:2201.00101 (cs)
[Submitted on 1 Jan 2022 ]

Title: Analytical Shaping Method for Low-Thrust Rendezvous Trajectory Using Cubic Spline Functions

Title: 用于使用三次样条函数的低推力交会轨迹的解析造型方法

Authors:Di Wu, Tongxin Zhang, Yuan Zhong, Fanghua Jiang, Junfeng Li
Abstract: Preliminary mission design requires an efficient and accurate approximation to the low-thrust rendezvous trajectories, which might be generally three-dimensional and involve multiple revolutions. In this paper, a new shaping method using cubic spline functions is developed for the analytical approximation, which shows advantages in the optimality and computational efficiency. The rendezvous constraints on the boundary states and transfer time are all satisfied analytically, under the assumption that the boundary conditions and segment numbers of cubic spline functions are designated in advance. Two specific shapes are then formulated according to whether they have free optimization parameters. The shape without free parameters provides an efficient and robust estimation, while the other one allows a subsequent optimization for the satisfaction of additional constraints such as the constraint on the thrust magnitude. Applications of the proposed method in combination with the particle swarm optimization algorithm are discussed through two typical interplanetary rendezvous missions, that is, an inclined multi-revolution trajectory from the Earth to asteroid Dionysus and a multi-rendezvous trajectory of sample return. Simulation examples show that the proposed method is superior to existing methods in terms of providing good estimation for the global search and generating suitable initial guess for the subsequent trajectory optimization.
Abstract: 初步任务设计需要对低推力会合轨迹进行高效且准确的近似,这些轨迹可能是三维的,并涉及多次绕行。 在本文中,开发了一种使用三次样条函数的新造型方法用于解析近似,该方法在最优性和计算效率方面表现出优势。 在假设边界条件和三次样条函数的段数预先指定的情况下,所有关于边界状态和转移时间的会合约束都能被解析地满足。 然后根据是否具有自由优化参数来制定两种特定形状。 没有自由参数的形状提供了高效且稳健的估计,而另一种形状则允许后续优化以满足其他约束条件,例如推力大小的约束。 通过两个典型的星际会合任务,即从地球到小行星Dionysus的倾斜多次绕行轨迹以及样本返回的多次会合轨迹,讨论了所提出方法与粒子群优化算法结合的应用。 仿真示例显示,所提出的方法在为全局搜索提供良好估计以及为后续轨迹优化生成合适的初始猜测方面优于现有方法。
Subjects: Robotics (cs.RO)
Cite as: arXiv:2201.00101 [cs.RO]
  (or arXiv:2201.00101v1 [cs.RO] for this version)
  https://doi.org/10.48550/arXiv.2201.00101
arXiv-issued DOI via DataCite
Related DOI: https://doi.org/10.1016/j.actaastro.2022.01.019
DOI(s) linking to related resources

Submission history

From: Di Wu [view email]
[v1] Sat, 1 Jan 2022 03:02:53 UTC (1,441 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
cs.RO
< prev   |   next >
new | recent | 2022-01
Change to browse by:
cs

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号