Math 2.0

Calculus of variations and optimal control; optimization Numerical methods for optimal control Concept

Direct collocation

Summary

Direct collocation is a method of trajectory optimization that turns an optimal control problem into a finite nonlinear program. It represents the state and the control by their values on a time grid. It imposes the differential equation only at chosen collocation points, through a polynomial model of the state on each interval. The cost integral becomes a quadrature sum, and the resulting sparse nonlinear program is solved by a general optimiser. It is "direct" because it discretises first and does not use the maximum principle.

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Collocation_method
About this page
TagT58W34D60G
URIm2://T58W34D60G
Kindconcept
WritingW0 stub
MSC49M37, 49M25, 65L60

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by

Definitions

Special cases