首页> 外文期刊>Multibody system dynamics >Symbolic-numeric indirect method for solving Optimal Control Problems for large multibody systems - The time-optimal racing vehicle example
【24h】

Symbolic-numeric indirect method for solving Optimal Control Problems for large multibody systems - The time-optimal racing vehicle example

机译:解决大型多体系统最优控制问题的符号数字间接方法-时间最佳赛车示例

获取原文
获取原文并翻译 | 示例
       

摘要

This work presents a methodological framework, based on an indirect approach, for the automatic generation and numerical solution of Optimal Control Problems (OCP) for mechatronic systems, described by a system of Differential Algebraic Equations (DAEs). The equations of the necessary condition for optimality were derived exploiting the DAEs structure, according to the Calculus of Variation Theory. A collection of symbolic procedures was developed within general-purpose Computer Algebra Software. Those procedures are general and make it possible to generate both OCP equations and their jacobians, once any DAE mathematical model, objective function, boundary conditions and constraints are given. Particular attention has been given to the correct definition of the boundary conditions especially for models described with set of dependent coordinates. The non-linear symbolic equations, their jacobians with the sparsity patterns, generated by the procedures above mentioned, are translated into a C++ source code. A numerical code, based on a Newton Affine Invariant scheme, was also developed to solve the Boundary Value Problems (BVPs) generated by such procedures. The software and methodological framework here presented were successfully applied to the solution of the minimum-lap time problem of a racing motorcycle.
机译:这项工作提出了一种基于间接方法的方法框架,用于机电系统的最优控制问题(OCP)的自动生成和数值求解,该系统由微分代数方程(DAE)系统描述。根据微分理论微积分,利用DAEs结构推导了最优性的必要条件方程。在通用计算机代数软件中开发了一系列符号过程。这些程序很通用,一旦给出任何DAE数学模型,目标函数,边界条件和约束条件,就可以生成OCP方程及其雅可比方程。特别注意边界条件的正确定义,尤其是对于使用一组相关坐标描述的模型。通过上述过程生成的非线性符号方程式及其带有稀疏模式的雅可比式变量被转换为C ++源代码。还开发了基于牛顿仿射不变方案的数字代码来解决由此类过程产生的边值问题(BVP)。此处介绍的软件和方法框架已成功应用于解决赛车摩托车的最小圈时间问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号