Jump to content

Flat pseudospectral method

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Heather1981 (talk | contribs) at 23:54, 15 August 2012. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The flat pseudospectral method is part of the family of the Ross-Fahroo pseudospectral methods introduced by Ross and Fahroo.[1] [2] The method combines the concept of differential flatness[3] with pseudospectral methods to generate outputs in the so-called flat space.


Concept

Because the differentiation matrix, , in a pseudospectral method is square, higher-order derivatives of any polynomial, , can be obtained by powers of ,

where is the pseudospectral variable and is a finite positive integer. By differential flatness, there exists functions a and b such that the state and control variables can be written as,

The combination of these concepts generates the flat pseudospectral method; that is, x and u are written as,

Thus, an optimal control problem can be quickly and easiy transformed to a problem with just the Y pseudospectral variable.

See also

References

  1. ^ Ross, I. M. and Fahroo, F., “Pseudospectral Methods for the Optimal Motion Planning of Differentially Flat Systems,” IEEE Transactions on Automatic Control, Vol.49, No.8, pp.1410-1413, August 2004.
  2. ^ Ross, I. M. and Fahroo, F., “A Unified Framework for Real-Time Optimal Control,” Proceedings of the IEEE Conference on Decision and Control, Maui, HI, December, 2003.
  3. ^ Fliess, M., Lévine, J., Martin, Ph., and Rouchon, P., “Flatness and defect of nonlinear systems: Introductory theory and examples,” International Journal of Control, vol. 61, no. 6, pp. 1327–1361, 1995.