Attacking Satellite Path Planning Based on Genetic Algorithm

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.

[1]  S. Vadali,et al.  CONTROL OF SATELLITE FORMATIONS , 2001 .

[2]  Rubo Zhang,et al.  Local path planning of a mobile robot using genetic algorithm , 1998, Defense, Security, and Sensing.

[3]  Danny Ziyi Chen,et al.  A framed-quadtree approach for determining Euclidean shortest paths in a 2-D environment , 1997, IEEE Trans. Robotics Autom..

[4]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[5]  Xue Qing Application of Genetic Algorithm in Path Planning , 2008 .

[6]  Won Jee Chung,et al.  Optimization of cooperative motion for humanoid robots using a genetic algorithm , 2005, ICMIT: Mechatronics and Information Technology.

[7]  J. Forbes,et al.  Storm-Time Equatorial Density Enhancements Observed by CHAMP and GRACE , 2007 .

[8]  M. Imregun,et al.  Parameters Identification for Nonlinear Dynamic Systems Via Genetic Algorithm Optimization , 2009 .

[9]  Paul M. Griffin,et al.  Path planning for a mobile robot , 1992, IEEE Trans. Syst. Man Cybern..

[10]  Jean-Claude Latombe,et al.  A Monte-Carlo algorithm for path planning with many degrees of freedom , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[11]  Lydia E. Kavraki,et al.  Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..

[12]  S Forrest,et al.  Genetic algorithms , 1996, CSUR.

[13]  C. Sabol,et al.  Satellite Formation Flying Design and Evolution , 2001 .

[14]  Mark H. Overmars,et al.  Coordinated path planning for multiple robots , 1998, Robotics Auton. Syst..

[15]  G. S. Sandhoo,et al.  Rendezvous and Docking for Space Exploration , 2005 .

[16]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1986 .

[17]  Suguru Arimoto,et al.  Computation of the tangent graph of polygonal obstacles by moving-line processing , 1994, IEEE Trans. Robotics Autom..

[18]  Tung-Kuan Liu,et al.  Optimization on robot arm machining by using genetic algorithms , 2007, ICMIT: Mechatronics and Information Technology.