Optimal Trajectory Correction Maneuver Design Using the B-Plane Targeting Method for Future Korean Mars Missions
Optimal Trajectory Correction Maneuver (TCM) design algorithm has been developed using the B-plane targeting method for future Korean Mars missions. For every mission phase, trajectory informations can also be obtained using this developed algorithms which are essential to design optimal TCM strateg...
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
The Korean Space Science Society
2005-12-01
|
| Series: | Journal of Astronomy and Space Sciences |
| Subjects: | |
| Online Access: | http://ocean.kisti.re.kr/downfile/volume/kosss/OJOOBS/2005/v22n4/OJOOBS_2005_v22n4_451.pdf |
| Summary: | Optimal Trajectory Correction Maneuver (TCM) design algorithm has been developed using the B-plane targeting method for future Korean Mars missions. For every mission phase, trajectory informations can also be obtained using this developed algorithms which are essential to design optimal TCM strategy. The information were computed under minimum requiring perturbations to design Mars missions. Spacecraft can not be reached at designed aim point because of unexpected trajectory errors, caused by many perturbations and errors due to operating impulsive maneuvers during the cruising phase of missions. To maintain spacecraft's appropriate trajectory and deliver it to the designed aim point, B-plane targeting techniques are needed. A software NPSOL is used to solve this optimization problem, with the performance index of minimizing total amount of TCM's magnitude. And also executing time of maneuvers can be controlled for the user defined maneuver number (1˜5) of TCMs. The constraints, the Mars arrival B-plane boundary conditions, are formulated for the problem. Results of this work show the ability to design and analyze overall Mars missions, from the Earth launch phase to Mars arrival phase including capture orbit status for future Korean Mars missions. |
|---|---|
| ISSN: | 2093-5587 2093-1409 |