Scaling and Balancing for High-Performance Computation of Optimal Controls

Abstract

It is well-known that proper scaling can increase the efficiency of computational problems. In this paper we define and show that a balancing technique can substantially improve the computational efficiency of optimal control algorithms. We also show that non-canonical scaling and balancing procedures may be used quite effectively to reduce the computational difficulty of some hard problems. These results have been used successfully for several flight and field operations at NASA and DoD. A surprising aspect of our analysis shows that it may be inadvisable to use auto-scaling procedures employed in some software packages. The new results are agnostic to the specifics of the computational method; hence, they can be used to enhance the utility of any existing algorithm or software.

arXiv comment23 pages, 7 figures

References in corpus (1)

• A Review of Pseudospectral Optimal Control: From Theory to Flight

Cited by in corpus (5)

• Dual Quaternion Based Powered Descent Guidance with State-Triggered Constraints
• Deep neural network approximations for the stable manifolds of the Hamilton-Jacobi-Bellman equations
• A Universal Birkhoff Theory for Fast Trajectory Optimization
• Implementations of the Universal Birkhoff Theory for Fast Trajectory Optimization
• Hessians in Birkhoff-Theoretic Trajectory Optimization