This paper proposes an alternate interpretation of the traditional lookup table controller via the Center Average De-fuzzier (CAD) in Fuzzy Set Theory with a set of Disjoint Block Pulse Membership Functions (DBPMFs). Further, a new Heaviside Search Algorithm (HSA) is also proposed to implement the Fuzzy Lookup Table Controller (FLTC) in a more efficient way. The computation complexity of our new HSA is O (Σ R i), where R i is the number of membership functions for i th input variable in FLTC. Whereas the average computational complexity in traditional Linear Search Algorithm (LSA) is O ((π R i)/2). In comparison with LSA, the HSA also reduces the complexity of coding significantly in the same order as the comparison of computation complexities between HSA and LSA. The balancing of Inverted Pendulum System (IPS) is adopted as the benchmark to show the feasibility and efficiency of this new FLTC and HSA.
|期刊||IOP Conference Series: Materials Science and Engineering|
|出版狀態||Published - 1 十月 2018|
|事件||2018 3rd International Conference on Automation, Control and Robotics Engineering, CACRE 2018 - Chengdu, China|
持續時間: 19 七月 2018 → 22 七月 2018