In this paper, we investigate the use of the dynamic programming approach in the solution of the optimal path timing problem in robotics. This problem is computationally feasible because the path constraint reduces the dimension of the state in the problem to two. The Hamilton-Jacobi-Bellman equatio
On the Application of Dynamic Programing to the Determination of Optimal Play in Chess and Checkers
β Scribed by Richard Bellman
- Book ID
- 123658040
- Publisher
- National Academy of Sciences
- Year
- 1965
- Tongue
- English
- Weight
- 178 KB
- Volume
- 53
- Category
- Article
- ISSN
- 0027-8424
- DOI
- 10.2307/72572
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Application of the methods of control theory to industrial problems demands a match of the necessary computational tools to the actual financial constraints. The development of suboptimal control algorithms allows performance gains that were limited in the past to installations with extensive comput
## Corporation This article considers multi-stage processes composed of a sequence of operations in which the outcome of the preceding operations may be used to guide the course of future operations. Examples of such processes can be found in many fields including industrial production, military p