面向快速轨迹优化的通用Birkhoff理论
A Universal Birkhoff Theory for Fast Trajectory Optimization
AI总结:
本文提出基于通用Birkhoff插值的轨迹优化新理论,将条件数从O(N^2)降至O(1),并证明直接与间接Birkhoff方法的数学等价性。
摘要:
在过去二十年中,基于Lagrange插值的伪谱方法在求解轨迹优化问题及其飞行实现方面蓬勃发展。在看似缺乏合理性、偏离这些极为成功方法的背景下,本文提出了一种新的轨迹优化起点。该起点基于最近发展的通用Birkhoff插值概念。新方法对Lagrange理论进行了实质性计算升级,将条件数的快速增长从O(N^2)完全压平至O(1),其中N为网格点数。此外,即使对于非线性、非凸问题,Birkhoff特有的原始-对偶计算也被隔离到一个良态线性系统中。本文是两篇论文中的第一部分。在第一部分中,基于两个假设发展了一套新理论。除这两个假设外,理论推导不对基函数的选择或网格点的选取作任何假设。文中证明了若干余向量映射定理,以建立直接Birkhoff方法与间接Birkhoff方法之间的数学等价性。在本文的第二部分(与Proulx合作)中,证明了Gegenbauer网格的一个特定族满足该理论成立所需的两个假设。第二部分中的数值算例展示了新理论的能力与实用性。
英文摘要:
Over the last two decades, pseudospectral methods based on Lagrange interpolants have flourished in solving trajectory optimization problems and their flight implementations. In a seemingly unjustified departure from these highly successful methods, a new starting point for trajectory optimization is proposed. This starting point is based on the recently-developed concept of universal Birkhoff interpolants. The new approach offers a substantial computational upgrade to the Lagrange theory in completely flattening the rapid growth of the condition numbers from O(N2) to O(1), where N is the number of grid points. In addition, the Birkhoff-specific primal-dual computations are isolated to a well-conditioned linear system even for nonlinear, nonconvex problems. This is part I of a two-part paper. In part I, a new theory is developed on the basis of two hypotheses. Other than these hypotheses, the theoretical development makes no assumptions on the choices of basis functions or the selection of grid points. Several covector mapping theorems are proved to establish the mathematical equivalence between direct and indirect Birkhoff methods. In part II of this paper (with Proulx), it is shown that a select family of Gegenbauer grids satisfy the two hypotheses required for the theory to hold. Numerical examples in part II illustrate the power and utility of the new theory.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。