Maneuver capacity provides crucial information for mission planning of entry vehicles. This paper proposes a method to generate the reachable area at the end points of the entry phase which describes the full directional maneuver capacity of the entry vehicles. This method utilizes the parallel characteristics of differential evolution (DE) and the high accuracy of Chebyshev polynomial interpolation to generate one side of the boundary of the reachable area, while conventional methods only generate one point of the boundary in each run.Furthermore, in order to assess the influence of the vehicle's design parameters on the maneuver capacity, a scoring method with analytic hierarchy process (AHP), which can greatly reduce the evaluation effort, is developed.Index Terms-maneuver capacity, entry vehicle, differential evolution, trajectory optimization, analytic hierarchy process. NOMENCLA TURE CL, CD = lift and drag coefficients, respectively L, D = lift and drag acceleration, respectively, m/s 2 g = gravitational acceleration, m/s 2 m = vehicle's mass, kg r = radial distance from Earth's center to the vehicle, m S = reference area, m 2 v = Earth-relative velocity, m/s Vs = velocity of sound, m/s a, (J = angle of attack and bank angle, respectively, rad y = flight-path angle, rad e, ¢ = longitude and latitude, respectively, rad fJ = gravitational constant, m 3 /s 2 p = density of atmosphere, kg/m 3 If! = velocity heading angle, rad We = self-rotation angular velocity of Earth, rad/s I. INTRODUCTlONT he maneuver capacity of entry vehicles provides critical information in mission planning and the evaluation of vehicle design. There are two types of maneuver for entry vehicles: longitude maneuver and lateral maneuver, which indicate the vehicle's ability to fly in the longitude plane and deviate from the longitude plane, respectively. Reachable the end of the entry phase (also called landing footprint) describes the full directional maneuver capacity of the entry vehicles, i.e., lateral maneuver capacity is depicted at each potential longitude maneuver level in landing footprint.To obtain the boundary of the landing footprint, a series of trajectory optimization problems which have similar formula tions need to be solved. The optimal goal is to maximize the terminal crossrange at each downrange under the path constraints and terminal state constraints. However, the severe nonlinearity on the vehicle's dynamics and various constraints make it unlikely to get the accurate solutions of these problems. Through the simplification of the vehicle's dynamics, approximate solutions of the original optimal control problems are derived by some researchers [1][2][3], in which path constraints are ignored, and the Earth's rotation is omitted, resulting in less accurate and reliable. Saraf[4] provides a rapid landing footprint computation algorithm, which builds an acceleration-based trajectory planner. It also proposes a near-optimal angle of attack control law, while the footprint is not accurate either and the far-side of the boun...