Efficient computer implementation of a rule-based three-term controller

An efficient representation of the rule base for a three-term controller is presented. For the case under consideration, the linguistic variables are quantized into r=8 fuzzy subsets, so there are r/sup 3/=512 rules for the three-term controller. According to a previous work, only 91 storage locations for rules are needed using the proposed condensed version for the controller lookup table. This represents about 80% savings in memory storage space. For r>16, the savings in memory is at least 90%.<
>