Referenced Items are not available for this document.
In this paper, the optimal fuel impulsive time-fixed rendezvous problem is considered. Under some simplifying assumptions, this problem may be recast as a non convex polynomial optimization problem. A numerical solving algorithm using a convex relaxation based on sum-of-squares representation of positive polynomials is proposed. Numerical results are evaluated on the PRISMA technology in-orbit formation flying testbed mission.
Published in:
Decision and Control (CDC), 2010 49th IEEE Conference on
Date of Conference: 15-17 Dec. 2010
- Page(s):
- 352 - 357
- ISSN :
- 0743-1546
- Print ISBN:
- 978-1-4244-7745-6
- INSPEC Accession Number:
- 11848669
- Conference Location :
- Atlanta, GA
- Digital Object Identifier :
- 10.1109/CDC.2010.5717372
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
