Increasing complex space missions require launch vehicles to be with greater load-carrying capacity, better orbit injection accuracy and higher reliability. Such demands also cause the increased complexity of the vehicle, leading to a higher probability of fault, especially for the propulsion system. To remedy this issue, an advanced and robust ascent guidance capable of fault-tolerant is critical for the success of mission. Iterative guidance method [1] (IGM) and powered explicit guidance [2] (PEG) are two commonly used methods for the ascent phase of launch vehicles. These two guidance methods work well in the nominal condition and can adapt to many off-nominal conditions [3]. However, they lack of strong adaptive capacity, which cannot guarantee the reliability when the dynamic model or parameters change significantly. Alternatively, numerical approaches based on the optimal control theory may be the better choice. The existing algorithms can be divided into direct methods and indirect methods. Using the indirect methods, the guidance problem is transformed into Hamilton two-point boundary value problems [4] (TPBVP), but the solving process of this Hamilton two-point boundary value problem is complicated and highly sensitive to the initial guess. Using the direct method, the guidance problem is transformed into a nonlinear programming problem [5] (NLP). However, solving such problem is extremely computational intensive, which is difficult to meet the real-time requirement for online application.