Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Symbolic Transformations of Dynamic Optimization Problems

Författare

Summary, in English

Dynamic optimization problems involving differential-algebraic equation (DAE) systems are traditionally solved while retaining the semi-explicit or implicit form of the DAE. We instead consider symbolically transforming the DAE into an ordinary differential equation (ODE) before solving the optimization problem using a collocation method. We present a method for achieving this, which handles DAE-constrained optimization problems. The method is based on techniques commonly used in Modelica tools for simulation of DAE systems.



The method is evaluated on two industrially relevant benchmark problems. The first is about vehicle-trajectory generation and the second involves startup of power plants. The problems are solved using both the DAE formulation and the ODE formulation and the performance of the two approaches is compared. The ODE formulation is shown to have roughly three times shorter execution time. We also discuss benefits and drawbacks of the two approaches.

Publiceringsår

2014

Språk

Engelska

Sidor

1027-1036

Publikation/Tidskrift/Serie

Proceedings of the 10th International Modelica Conference

Volym

1650-3740

Issue

96

Dokumenttyp

Konferensbidrag

Förlag

Linköping University Electronic Press

Ämne

  • Control Engineering

Conference name

10th International Modelica Conference

Conference date

2014-03-10 - 2014-03-12

Conference place

Lund, Sweden

Status

Published

Projekt

  • LCCC
  • Numerical and Symbolic Algorithms for Dynamic Optimization

Forskningsgrupp

  • ELLIIT
  • LCCC

ISBN/ISSN/Övrigt

  • ISSN: 1650-3686
  • ISBN: 978-91-7519-380-9