Matched processors for quantized control: A practical parallel-processing approach (Q3731472)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3963684
Language Label Description Also known as
default for all languages
No label defined
    English
    Matched processors for quantized control: A practical parallel-processing approach
    scientific article; zbMATH DE number 3963684

      Statements

      Matched processors for quantized control: A practical parallel-processing approach (English)
      0 references
      0 references
      1985
      0 references
      quantized control
      0 references
      matched processors
      0 references
      dynamic performance cost-to-go values
      0 references
      decision sequences
      0 references
      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.
      0 references

      Identifiers