Remarks on the application of dynamic programming to the optimal path timing of robot manipulators
β Scribed by A. J. Cahill; M. R. James; J. C. Kieffer; D. Williamson
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 254 KB
- Volume
- 8
- Category
- Article
- ISSN
- 1049-8923
No coin nor oath required. For personal study only.
β¦ Synopsis
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 equation of dynamic programming, a nonlinear first order partial differential equation, is presented and is solved approximately using finite difference methods. Numerical solution of this results in the optimal policy which can then be used to define the optimal path timing by numerical integration. Issues relating to the convergence of the numerical schemes are discussed, and the results are applied to an experimental SCARA manipulator.
π 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