Matched processors for quantized control: A practical parallel-processing approach
The purpose of the paper is to show how quantized control problems can be investigated from a novel and computationally feasible matched processors perspective. It is noted that a bank of independent matched processors, each matched to a unique admissible decision sequence, can evaluate, given the state and remaining duration, the set of dynamic performance cost-to-go values corresponding to all admissible decision sequences. An optimum matched processor control scheme is produced by choosing the admissible decision sequence with the smallest cost-to-go and using its first decision at each stage. The above scheme is ideally suited for very-large-scale integration. Two experimental examples are given. The paper is well organized and written and highly suggested to those involved in the area of the corresponding interest.
- Computation of quantized controls using differential dynamic programming
- scientific article; zbMATH DE number 3435336 (Why is no real title available?)
- scientific article; zbMATH DE number 3346257 (Why is no real title available?)
- Optimal Trajectories for Multidimensional Nonlinear Processes by Iterated Dynamic Programming
- Some Types of Optimal Control of Stochastic Systems
- Suboptimal regulator design of linear systems with quantized controls
This page was built for publication: Matched processors for quantized control: A practical parallel-processing approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3731472)