Abstract
This paper deals with the concept and application of general three-dimensional (3-D) type-2 fuzzy logic systems in the polar frame (G3DT2FLS). 1 1 Because many acronyms are used in this paper, they are summarized in Table I for the convenience of the reader. We focused on the automatic membership function (MF) Generator, general type-2 polar fuzzy membership, new geometric operators in polar frame, inference consisting of fuzzy 3-D polar rules and antecedents/consequents $\theta$ -slice and $\alpha$ -planes. The cubic smoothing spline is introduced to generate the upper and lower MFs according to the information theory. Three indices of compactness, smoothness, and entropy are employed for tuning of MFs. A measure of ultrafuzziness, min, max, equal, and reduced ultrafuzziness are suggested for the polar method. Additionally, the set theoretic operations of 3-D type-2 fuzzy sets in the polar frame are discussed. We also prove the join, meet, centroid, and type-reduction operations in the polar frame. Several rule sets are given to show the usefulness and complexity of the proposed method. The performance of the partial general 3D polar type-2 fuzzy logic system showed linear growth as the number of rules was increased. Computation time tests showed that the algorithm reduces the computation time by a maximum of 67% compared with discrete MF and is shown by an extreme 98% for the geometric procedure. These results indicate significant improvements in computation time for the spline interpolation over the existing methods.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.