๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A chebyshev polynomial method for optimal control with state constraints

โœ Scribed by Jacques Vlassenbroeck

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
661 KB
Volume
24
Category
Article
ISSN
0005-1098

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Optimal control of network flows with co
Optimal control of network flows with convex cost and state constraints
โœ A. T. Ernst; C. J. Goh ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 275 KB ๐Ÿ‘ 1 views

Consider a network in which a commodity #ows at a variable rate across the arcs in order to meet supply/demand at the nodes. The aim is to optimally control the rate of #ow such that a convex objective functional is minimized. This is an optimal control problem with a large number of states, and wit

Sufficient conditions for optimal contro
Sufficient conditions for optimal control problems with mixed constraints
โœ E. Galewska; A. Nowakowski ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 117 KB

## Abstract In this paper we derive sufficient conditions for optimal control problems with mixed control and state constraints by applying a dual approach to the dynamic programming. These conditions guarantee that a relative minimum is achieved. We seek an optimal pair in the class of those admis