𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A differential dynamic programming algorithm for differential games

✍ Scribed by Theodore B. Trafalis; Thomas L. Morin

Publisher
John Wiley and Sons
Year
2001
Tongue
English
Weight
172 KB
Volume
22
Category
Article
ISSN
0143-2087

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Reach and Bound algorithm for acyclic
A Reach and Bound algorithm for acyclic dynamic-programming networks
✍ Matthew D. Bailey; Robert L. Smith; Jeffrey M. Alden πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 111 KB

## Abstract Node pruning is a commonly used technique for solution acceleration in a dynamic‐programming network. In pruning, nodes are adaptively removed from the dynamic programming network when they are determined not to lie on an optimal path. We introduce an Ρ‐pruning condition that extends pr

A Parallel Adaptive Coupling Algorithm f
A Parallel Adaptive Coupling Algorithm for Systems of Differential Equations
✍ M. Garbey; D. Tromeur-Dervout πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 224 KB

In this paper we address the challenge of metacomputing with two distant parallel computers linked by a slow network and running the numerical approximation of two sets of coupled PDEs. Several software tools are available for coupling codes, and large-scale computing on a network of parallel comput