Maximum Altitude : An Invariant Imbedding
スポンサーリンク
概要
- 論文の詳細を見る
In this paper we solve a continuous non-optimization dynamic programming problem: Maximum Altitude problem. The problem has been originated by R. Bellman. We consider three maximum altitude problems. A complete solution through an invariant imbedding is derived. Each problem accompanies a few typical examples.
- 九州大学の論文
- 2005-08-09
著者
関連論文
- A dual approach in optimizing threshold probabilities
- Dog Chases Rabbit : An Invariant Imbedding
- Maximum Altitude : An Invariant Imbedding