Flatness-based Near Optimal Guidance

Abstract

An optimal explicit guidance law that maximizes terminal velocity is developed for the reentry of a vehicle to a fixed target. The equations of motion are reduced with differential flatness approach and acceleration commands are related to the parameters of trajectory. An optimal trajectory is determined by solving a real-coded genetic algorithm. For online trajectory generation, optimal trajectory is approximated. The approximated trajectory is compared with the pure proportional navigation and genetic algorithm solutions. The near optimal terminal velocity solution compares very well with these solutions. The approach robustness is examined by Monte Carlo simulation. Other advantages such as trajectory representation with minimum parameters, applicability to any reentry vehicle configuration and any control scheme, and Time-to-Go independency make this guidance approach more favorable.

Keywords

• reentry
• explicit guidance
• differential flatness
• optimal guidance
• genetic algorithm