TECHNICAL PAPERS
Jan 15, 2011

Attacking Satellite Path Planning Based on Genetic Algorithm

Publication: Journal of Aerospace Engineering
Volume 25, Issue 1

Abstract

In the space attack defensive system, a satellite is usually used to attack another satellite. To approach the target satellite successfully, path planning is very important for the attacking satellite, especially when the defensive system of the target satellite is composed of formation flying small satellites. This paper presents an environment model that is established on the relative orbit model of small satellites and changed into a static model for path planning. A genetic algorithm is used to find the optimal path. The coding rules, fitness function, and three genetic operators are designed in turn. The fitness function is found by considering region constraint, safe constraint, shortest length constraint, and crooked degree constraint. The simulation results show that the optimal path can be found with good stability and convergence, and the optimal path could satisfy requirements of security and the shortest path well.

Get full access to this article

View all available purchase options and get full access to this article.

References

Ahuja, R., Magnanti, T., and Orlin, J. (1993). Network flows theory, algorithms, and applications, Prentice Hall, Upper Saddle River, NJ, 108–112.
Barraquand, J., and Latombe, J.-C. (1990). “A Monte-Carlo algorithm for path planning with many degrees of freedom.” Proc., IEEE Int. Conf. Rob. Autom., New York, 1712–1717.
Bruinsma, S. L. (2007). “Storm-time equatorial density enhancements observed by CHAMP and GRACE.” J. Spacecr. Rockets, 44(6), 1154–1159.
Canny, J. (1985). “A voronoi method for the piano-moves problem.” Proc., IEEE Int. Conf. Rob. Autom., New York, 530–535.
Chen, G., and Shen, L. (2001). “Genetic path planning algorithm for complex environment path planning.” Robot, 23(1), 40–45 (in Chinese).
Chen, D. Z., Szczerba, R. J., and Uhran, J. J., Jr. (1997). “A framed-quadtree approach for determining Euclidean shortest paths in a 2-D environment.” IEEE Trans. Rob. Autom., 13(5), 668–681.
Choi, K.-J., Yoon-Kwon, H., Dae Sun, H., Won Jee, C., and I1-Hwan, P. (2005). “Optimization of cooperative motion for humanoid robots using a genetic algorithm.” Proc. SPIE, 6042(60423Q), 1–6.
Christos, A. C., and Griffin, G. (1992). “Path planning for a mobile robot.” IEEE Trans. Syst. Man Cybern., 22(2), 318–322.
Forrest, S. (1993). “Genetic algorithms: Principles of nature selection applied to computation.” Science, 261(5123), 872–878.
Gondhalekar, A. C., Petrov, E. P., and Imregun, M. (2009). “Parameters identification for nonlinear dynamic systems via genetic algorithm optimization.” J. Comput. Nonlinear Dynam., 4(4), 1–9.
Kavralu, L. E., Svestka, P., latombe, J.-C., and Overmars, M. H. (1996). “Probabilistic roadmaps for path planning in high-dimensional configuration spaces.” IEEE Trans. Rob. Autom., 12(4), 566–580.
Liu, T.-K., Chen, C.-H., and Tsai, S.-E. (2007). “Optimization on robot arm machining by using genetic algorithms.” Proc. SPIE, 6794(679431), 1–6.
Liu, Y., and Suguru, A. (1994). “Computation of the tangent graph of polygonal obstacles by moving-line processing.” IEEE Trans. Rob. Autom., 10(6), 823–830.
Machula, M. F., and Sandhoo, G. S. (2005). “Rendezvous and docking for space exploration.” Proc., 1st Space Exploration Conf., AIAA, Reston, VA, 2005–2716.
Meng, X., Zhao, Y., and Xue, Q. (2008). “Application of genetic algorithm in path planning.” Comp. Eng., 34(16), 215–220 (in Chinese).
Oussama, Khatib (1986). “Real-time obstacle avoidance for manipulators and mobile robots.” Int. J. Rob. Res., 5(1), 90–98.
Sabol, C., Burns, R., and Melaughlin, C. A. (1999). “Satellite formation flying design and evolution.” Proc., AAS/AIAA Space Flight Mechanics Meeting, San Diego, 265–284.
Sabol, C., Burns, R., and Mclaughlin, C. A. (2001). “Satellite formation flying design and evolution.” J. Spacecr. Rockets, 38(2), 270–278.
Svestka, P., and Overmars, M. H. (1998). “Coordinated path planning for multiple robots.” Rob. Autom. Syst., 23(3), 125–152.
Vadali, S. R., Vaddi, S. S., Naik, K., and Alfriend, K. T. (2001). “Control of satellite formations.” Proc., AIAA Guidance, Navigation, and Control Conf. and Exhibit, Reston, VA, 2001–4028.
Yu, S., Liang, Z., and Li, H. (2008). “Immune genetic algorithm based path planning for mobile robot.” Robot Technics, 24(1), 257–259 (in Chinese).
Zhang, R., Zhang, G., and Gu, G. (1998). “Local path planning of a mobile robot using genetic algorithm.” Proc., Part of the SPIE Conf. on Robotic and Semi-Robotic Ground Vehicle Technology, Vol. 3366, Orlando, FL, 195–200.

Information & Authors

Information

Published In

Go to Journal of Aerospace Engineering
Journal of Aerospace Engineering
Volume 25Issue 1January 2012
Pages: 32 - 38

History

Received: Sep 19, 2009
Accepted: Jan 13, 2011
Published online: Jan 15, 2011
Published in print: Jan 1, 2012

Permissions

Request permissions for this article.

Authors

Affiliations

Sun Zhao-wei
Professor, Research Center of Satellite Technology, Harbin Institute of Technology, Harbin 15001, China.
Research Center of Satellite Technology, Harbin Institute of Technology, Harbin 15001, China (corresponding author). E-mail: [email protected]
Zhong Wei-chao [email protected]
Research Center of Satellite Technology, Harbin Institute of Technology, Harbin 15001, China. E-mail: [email protected]
Wu Xian-de
Research Center of Satellite Technology, Harbin Institute of Technology, Harbin 15001, China.

Metrics & Citations

Metrics

Citations

Download citation

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited by

View Options

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share