Autonomous trajectory planning for space vehicles with a Newton–Kantorovich/convex programming approach

Autonomous trajectory planning for space vehicles with a Newton–Kantorovich/convex programming... Space maneuverings of the space vehicle require the capability of onboard trajectory planning. Convex programming based optimization strategy gets much attention in the design of trajectory planning methods with deterministic convergence properties. Due to the nonlinear dynamics, space-trajectory planning problems are always non-convex and difficult to be solved by the convex programming approach directly. This paper presents a Newton–Kantorovich/convex programming (N–K/CP) approach, based on the combination of the convex programming and the Newton–Kantorovich (N–K) method, to solve the nonlinear and non-convex space-trajectory planning problem. This trajectory planning problem is formulated as a nonlinear optimal control problem. By linearization and relaxation techniques, the nonlinear optimal control problem is convexified as a convex programming problem, which can be solved efficiently with convex programming solvers. For the linearized convex optimization problem, N–K method is introduced to design an iterative solving algorithm, the solution of which approximates the original trajectory planning problem with high accuracy. The convergence of the proposed N–K/CP approach is proved, and the effectiveness is demonstrated by numerical experiments and comparisons with other state-of-the-art methods. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Nonlinear Dynamics Springer Journals

Autonomous trajectory planning for space vehicles with a Newton–Kantorovich/convex programming approach

Loading next page...
 
/lp/springer_journal/autonomous-trajectory-planning-for-space-vehicles-with-a-newton-HtvPfsWVNg
Publisher
Springer Netherlands
Copyright
Copyright © 2017 by Springer Science+Business Media B.V.
Subject
Engineering; Vibration, Dynamical Systems, Control; Classical Mechanics; Mechanical Engineering; Automotive Engineering
ISSN
0924-090X
eISSN
1573-269X
D.O.I.
10.1007/s11071-017-3626-7
Publisher site
See Article on Publisher Site

Abstract

Space maneuverings of the space vehicle require the capability of onboard trajectory planning. Convex programming based optimization strategy gets much attention in the design of trajectory planning methods with deterministic convergence properties. Due to the nonlinear dynamics, space-trajectory planning problems are always non-convex and difficult to be solved by the convex programming approach directly. This paper presents a Newton–Kantorovich/convex programming (N–K/CP) approach, based on the combination of the convex programming and the Newton–Kantorovich (N–K) method, to solve the nonlinear and non-convex space-trajectory planning problem. This trajectory planning problem is formulated as a nonlinear optimal control problem. By linearization and relaxation techniques, the nonlinear optimal control problem is convexified as a convex programming problem, which can be solved efficiently with convex programming solvers. For the linearized convex optimization problem, N–K method is introduced to design an iterative solving algorithm, the solution of which approximates the original trajectory planning problem with high accuracy. The convergence of the proposed N–K/CP approach is proved, and the effectiveness is demonstrated by numerical experiments and comparisons with other state-of-the-art methods.

Journal

Nonlinear DynamicsSpringer Journals

Published: Jun 30, 2017

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off