MATCHED PROCESSORS FOR QUANTIZED CONTROL - A PRACTICAL PARALLEL-PROCESSING APPROACH

Deterministic 'quantized control' problems are investigated from a novel and often computationally feasible 'matched processors'(MPs) perspective. It is noted that a bank of independent MPs, each matched to an admissible decision sequence, can evaluate, given the state and remaining duration, the dynamic performance cost-to-go values corresponding to a suitably selected 'small' subset of all admissible decision sequences. By choosing the best admissible decision sequence in this subset and using its first decision at each stage a computationally feasible and generally sub-optimum MP control scheme is produced. This scheme is found to be ideally suited for very-large-scale integration. It is demonstrated that the proposed scheme performs quite well in two experimental examples.