1967
DOI: 10.1007/bf02235508
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic programming and an inverse problem in transport theory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
108
0
4

Year Published

1987
1987
2017
2017

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 84 publications
(112 citation statements)
references
References 3 publications
0
108
0
4
Order By: Relevance
“…The difficulty in solving the HJB equation in large-scale systems (like our microgrid) was known to Bellman itself, which coined the term 'curse-of-dimensionality' [19]: in order to overcome such difficulties, the PCAO (Parametrized Cognitive Adaptive Optimization) algorithm parametrizes the solution of the HJB equation (6) as V * (x) = z (x)Pz(x) and the optimal control strategy via u * = − 1 2 B ∂V * ∂ x , P is a positive definite matrix. More details for the function z(·) can be found in [20], [21]: in our specific microgrid case we found that a linear transformation z(x) = x is sufficient to achieve important improvements (as demonstrated in Section V).…”
Section: A Pcao Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…The difficulty in solving the HJB equation in large-scale systems (like our microgrid) was known to Bellman itself, which coined the term 'curse-of-dimensionality' [19]: in order to overcome such difficulties, the PCAO (Parametrized Cognitive Adaptive Optimization) algorithm parametrizes the solution of the HJB equation (6) as V * (x) = z (x)Pz(x) and the optimal control strategy via u * = − 1 2 B ∂V * ∂ x , P is a positive definite matrix. More details for the function z(·) can be found in [20], [21]: in our specific microgrid case we found that a linear transformation z(x) = x is sufficient to achieve important improvements (as demonstrated in Section V).…”
Section: A Pcao Algorithmmentioning
confidence: 99%
“…With such parametrization, the problem of solving the HJB equation is recast as the problem of finding the matrix P (and thus the strategy u) that better approaches the solution of the HJB equation. The PCAO algorithm defines the closeto-optimality index (mutated for the principle of optimality [19])…”
Section: A Pcao Algorithmmentioning
confidence: 99%
“…7 The formulation of Bellman functions in continuous time follows from taking limits of the associated discrete-period functional equations, presented e.g. in Bellman and Kalaba (1965). Derivations are straightforward; for a standard application reference which has had great influence on the labor market literature, and where also a simple derivation is offered, see Shapiro and Stiglitz (1984).…”
Section: The Basic Model Frameworkmentioning
confidence: 99%
“…The use of value functions of the Bellman type (see Bellman and Kalaba (1965)) in continuous time is by now widespread in economics, in particular within theoretical and empirical labor market analysis, see e.g. Mortensen and Pissardies (1999), Pissarides (2000) and van den Berg (2003).…”
Section: Introductionmentioning
confidence: 99%
“…The coefficient sequence estimate h(p) corresponding to any given point ~1 on the residual efficiency frontier then solves a problem of the form 'minimize c,,,(i) with respect to 6 subject to ~~(6) = constant', and can be derived sequentially by means of recurrence relations which have the familiar Riccati equation form. This is hardly surprising; it has been known for decades [Bellman and Kalaba (1965)] that linear-quadratic minimization leads to recurrence relations of this type. Tucci (1990) introduces independence and normality restrictions for the model discrepancy terms under which these FLS recurrence relations for generating any particular estimate 6(p) along the frontier can be given a Kalman filter interpretation.…”
mentioning
confidence: 99%