Compensating for order variation in mesh refinement for direct transcription methods

The numerical theory for Implicit Runge–Kutta methods shows that there can be order reduction when these methods are applied to either stiff or differential algebraic equations. This paper discusses how this theory can be utilized in direct transcription trajectory optimization by modifying a currently used mesh refinement strategy.