scispace - formally typeset
Search or ask a question

Showing papers on "Fuzzy logic published in 1996"


Journal ArticleDOI
TL;DR: The point of this note is that fuzzy logic plays a pivotal role in CW and vice-versa and, as an approximation, fuzzy logic may be equated to CW.
Abstract: As its name suggests, computing with words (CW) is a methodology in which words are used in place of numbers for computing and reasoning. The point of this note is that fuzzy logic plays a pivotal role in CW and vice-versa. Thus, as an approximation, fuzzy logic may be equated to CW. There are two major imperatives for computing with words. First, computing with words is a necessity when the available information is too imprecise to justify the use of numbers, and second, when there is a tolerance for imprecision which can be exploited to achieve tractability, robustness, low solution cost, and better rapport with reality. Exploitation of the tolerance for imprecision is an issue of central importance in CW. In CW, a word is viewed as a label of a granule; that is, a fuzzy set of points drawn together by similarity, with the fuzzy set playing the role of a fuzzy constraint on a variable. The premises are assumed to be expressed as propositions in a natural language. In coming years, computing with words is likely to evolve into a basic methodology in its own right with wide-ranging ramifications on both basic and applied levels.

3,093 citations


Book
20 Aug 1996

2,938 citations


Journal ArticleDOI
TL;DR: The authors represent a nonlinear plant with a Takagi-Sugeno fuzzy model with a model-based fuzzy controller design utilizing the concept of the so-called "parallel distributed compensation" and presents a design methodology for stabilization of a class of nonlinear systems.
Abstract: Presents a design methodology for stabilization of a class of nonlinear systems. First, the authors represent a nonlinear plant with a Takagi-Sugeno fuzzy model. Then a model-based fuzzy controller design utilizing the concept of the so-called "parallel distributed compensation" is employed. The main idea of the controller design is to derive each control rule so as to compensate each rule of a fuzzy system. The design procedure is conceptually simple and natural. Moreover, the stability analysis and control design problems can be reduced to linear matrix inequality (LMI) problems. Therefore, they can be solved efficiently in practice by convex programming techniques for LMIs. The design methodology is illustrated by application to the problem of balancing and swing-up of an inverted pendulum on a cart.

2,534 citations


Book
01 Aug 1996
TL;DR: A simple case in point is the problem of parking a car as discussed by the authors, where the final position of the car is not specified exactly, and if it were specified to within, say, a few millimeters and a fraction of a degree, it would take hours or days of maneuvering and precise measurements of distance and angular position.
Abstract: The past few years have witnessed a rapid growth of interest in a cluster of modes of modeling and computation which may be described collectively as soft computing. The distinguishing characteristic of soft computing is that its primary aims are to achieve tractability, robustness, low cost, and high MIQ (machine intelligence quotient) through an exploitation of the tolerance for imprecision and uncertainty. Thus, in soft computing what is usually sought is an approximate solution to a precisely formulated problem or, more typically, an approximate solution to an imprecisely formulated problem. A simple case in point is the problem of parking a car. Generally, humans can park a car rather easily because the final position of the car is not specified exactly. If it were specified to within, say, a few millimeters and a fraction of a degree, it would take hours or days of maneuvering and precise measurements of distance and angular position to solve the problem. What this simple example points to is the fact that, in general, high precision carries a high cost. The challenge, then, is to exploit the tolerance for imprecision by devising methods of computation which lead to an acceptable solution at low cost. By its nature, soft computing is much closer to human reasoning than the traditional modes of computation. At this juncture, the major components of soft computing are fuzzy logic (FL), neural network theory (NN), and probabilistic reasoning techniques (PR), including genetic algorithms, chaos theory, and part of learning theory. Increasingly, these techniques are used in combination to achieve significant improvement in performance and adaptability. Among the important application areas for soft computing are control systems, expert systems, data compression techniques, image processing, and decision support systems. It may be argued that it is soft computing, rather than the traditional hard computing, that should be viewed as the foundation for artificial intelligence. In the years ahead, this may well become a widely held position.

1,483 citations


Book
22 Oct 1996
TL;DR: Fuzzy rule bases Design methodologies Some mathematical background Approximation capability Exercises POSSIBILITY THEORY Probability and uncertainty Random sets Possibility measures Exercised.
Abstract: THE CONCEPT OF FUZZINESS Examples Mathematical modeling Some operations on fuzzy sets Fuzziness as uncertainty Exercises SOME ALGEBRA OF FUZZY SETS Boolean algebras and lattices Equivalence relations and partitions Composing mappings Isomorphisms and homomorphisms Alpha-cuts Images of alpha-level sets Exercises FUZZY QUANTITIES Fuzzy quantities Fuzzy numbers Fuzzy intervals Exercises LOGICAL ASPECTS OF FUZZY SETS Classical two-valued logic A three-valued logic Fuzzy logic Fuzzy and Lukasiewicz logics Interval-valued fuzzy logic Canonical forms Notes on probabilistic logic Exercises BASIC CONNECTIVES t-norms Generators of t-norms Isomorphisms of t-norms Negations Nilpotent t-norms and negations t-conorms DeMorgan systems Groups and t-norms Interval-valued fuzzy sets Type- fuzzy sets Exercises ADDITIONAL TOPICS ON CONNECTIVES Fuzzy implications Averaging operators Powers of t-norms Sensitivity of connectives Copulas and t-norms Exercises FUZZY RELATIONS Definitions and examples Binary fuzzy relations Operations on fuzzy relations Fuzzy partitions Fuzzy relations as Chu spaces Approximate reasoning Approximate reasoning in expert systems A simple form of generalized modus ponens The compositional rule of inference Exercises UNIVERSAL APPROXIMATION Fuzzy rule bases Design methodologies Some mathematical background Approximation capability Exercises POSSIBILITY THEORY Probability and uncertainty Random sets Possibility measures Exercises PARTIAL KNOWLEDGE Motivation Belief functions and incidence algebras Monotonicity Beliefs, densities, and allocations Belief functions on infinite sets Note on Mobius transforms of set-functions Reasoning with belief functions Decision making using belief functions Rough sets Conditional events Exercises FUZZY MEASURES Motivation and definitions Fuzzy measures and lower probabilities Fuzzy measures in other areas Conditional fuzzy measures Exercises THE CHOQUET INTEGRAL The Lebesgue integral The Sugeno integral The Choquet integral Exercises FUZZY MODELING AND CONTROL Motivation for fuzzy control The methodology of fuzzy control Optimal fuzzy control An analysis of fuzzy control techniques Exercises Bibliography Answers to Selected Exercises Index on>

1,398 citations


Journal ArticleDOI
01 Aug 1996-Synthese
TL;DR: F fuzzy logic is used in this paper to describe an imprecise logical system, FL, in which the truth-values are fuzzy subsets of the unit interval with linguistic labels such as true, false, not true, very true, quite true, not very true and not very false, etc.
Abstract: The term fuzzy logic is used in this paper to describe an imprecise logical system, FL, in which the truth-values are fuzzy subsets of the unit interval with linguistic labels such as true, false, not true, very true, quite true, not very true and not very false, etc. The truth-value set, ℐ, of FL is assumed to be generated by a context-free grammar, with a semantic rule providing a means of computing the meaning of each linguistic truth-value in ℐ as a fuzzy subset of [0, 1]. Since ℐ is not closed under the operations of negation, conjunction, disjunction and implication, the result of an operation on truth-values in ℐ requires, in general, a linguistic approximation by a truth-value in ℐ. As a consequence, the truth tables and the rules of inference in fuzzy logic are (i) inexact and (ii) dependent on the meaning associated with the primary truth-value true as well as the modifiers very, quite, more or less, etc. Approximate reasoning is viewed as a process of approximate solution of a system of relational assignment equations. This process is formulated as a compositional rule of inference which subsumes modus ponens as a special case. A characteristic feature of approximate reasoning is the fuzziness and nonuniqueness of consequents of fuzzy premisses. Simple examples of approximate reasoning are: (a) Most men are vain; Socrates is a man; therefore, it is very likely that Socrates is vain. (b) x is small; x and y are approximately equal; therefore y is more or less small, where italicized words are labels of fuzzy sets.

1,273 citations


Book
25 Apr 1996
TL;DR: In this paper, the authors present a survey of Fuzzy multiple objective decision-making techniques and their application in various aspects of the real world, such as: 1.1 Introduction.2 Goal Programming.
Abstract: 1 Introduction.- 1.1 Objectives of This Study.- 1.2 (Fuzzy) Multiple Objective Decision Making.- 1.3 Classification of (Fuzzy) Multiple Objective Decision Making.- 1.4 Applications of (Fuzzy) Multiple Objective Decision Making.- 1.5 Literature Survey.- 1.6 Fuzzy Sets.- 2 Multiple Objective Decision Making.- 2.1 Introduction.- 2.2 Goal Programming.- 2.2a A Portfolio Selection Problem.- 2.2b An Audit Sampling Problem.- 2.3 Fuzzy Programming.- 2.3.1 Max-Min Approach.- 2.3.1a A Trade Balance Problem.- 2.3.1b A Media Selection Problem.- 2.3.2 Augmented Max-Min Approach.- Example.- 2.3.2a A Trade Balance Problem.- 2.3.2b A Logistics Planning Model.- 2.3.3 Parametric Approach.- Example.- 2.4 Global Criterion Approach.- 2.4.1 Global Criterion Approach.- 2.4.1a A Nutrition Problem.- 2.4.2 TOPSIS for MODM.- 2. .2a A Water Quality Management Problem.- 2.5 Interactive Multiple Objective Decision Making.- 2.5.1 Optimal System Design.- 2.5.1a A Production Planning Problem.- 2.5.2 KSU-STEM.- 2.5.2a A Nutrition Problem.- 2.5.2b A Project Scheduling Problem.- 2.5.3 ISGP-II.- 2.5.3a A Nutrition Problem.- 2.5.3b A Bank Balance Sheet Management Problem.- 2.5.4 Augmented Min-Max Approach.- 2.5.4a A Water Pollution Control Problem.- 2.6 Multiple Objective Linear Fractional Programming.- 2.6.1 Luhandjula's Approach.- Example.- 2.6.2 Lee and Tcha's Approach.- 2.6.2a A Financial Structure Optimization Problem.- 2.7 Multiple Objective Geometric Programming.- Example.- 2.7a A Postal Regulation Problem.- 3 Fuzzy Multiple Objective Decision Making.- 3.1 Fuzzy Goal Programming.- 3.1.1 Fuzzy Goal Programming.- 3.1.1a A Production-Marketing Problem.- 3.1.1b An Optimal Control Problem.- 3.1.1c A Facility Location Problem.- 3.1.2 Preemptive Fuzzy Goal Programming.- Example: The Production-Marketing Problem.- 3.1.3 Interpolated Membership Function.- 3.1.3.1 Hannan's Method.- Example: The Production-Marketing Problem.- 3.1.3.2 Inuiguchi, Ichihashi and Kume's Method.- Example: The Trade Balance Problem.- 3.1.3.3 Yang, Ignizio and Kim's Method.- Example.- 3.1.4 Weighted Additive Model.- 3.1.4.1 Crisp Weights.- 3.1.4.1a Maximin Approach.- Example: The Production-Marketing Problem.- 3.1.4.1b Augmented Maximin Approach.- 3.1.4.1c Supertransitive Approximation.- Example: The Production-Marketing Problem.- 3.1.4.2 Fuzzy Weights.- Example: The Production-Marketing Problem.- 3.1.5 A Preference Structure on Aspiration Levels.- Example: The Production-Marketing Problem.- 3.1.6 Nested Priority.- 3.1.6a A Personnel Selection Problem.- 3.2 Fuzzy Global Criterion.- Example.- 3.3 Interactive Fuzzy Multiple Objective Decision Making.- 3.3.1 Werners's Method.- Example: The Trade Balance Problem.- 3.3.1a An Aggregate Production Planning Problem.- 3.3.2 Lai and Hwang's Method.- 3.3.3 Leung's Method.- Example.- 3.3.4 Fabian, Ciobanu and Stoica's Method.- Example.- 3.3.5 Sasaki, Nakahara, Gen and Ida's Method.- Example.- 3.3.6 Baptistella and Ollero's Method.- 3.3.6a An Optimal Scheduling Problem.- 4 Possibilistic Multiple Objective Decision Making.- 4.1 Introduction.- 4.1.1 Resolution of Imprecise Objective Functions.- 4.1.2 Resolution of Imprecise Constraints.- 4.2 Possibilistic Multiple Objective Decision Making.- 4.2.1 Tanaka and His Col1eragues' Methods.- Example.- 4.2.1.1 Possibilistic Regression.- Example 1.- Example 2.- 4.2.1.2 Possibilistic Group Method of Data Handling.- Example 28.- 4.2.2 Lai and Hwang's Method.- 4.2.3 Negi's Method.- Example.- 4.2.4 Luhandjula's Method.- Example.- 4.2.5 Li and Lee's Method.- Example.- 4.2.6 Wierzchon's Method.- 4.3 Interactive Methods for PMODM.- 4.3.1 Sakawa and Yano's Method.- Example.- 4.3.2 Slowinski's Method.- 4.3.2a A Long-Term Development Planning Problem of a Water Supply System.- 4.3.2b A Land-Use Planning Problem.- 4.3.2c A Farm Structure Optimization Problem.- 4.3.3 Rommelranger's Method.- Example.- 4.4 Hybrid Problems.- 4.4.1 Tanaka, Ichihashi and Asai's Method.- Example.- 4.4.2 Inuiguchi and Ichihashi's Method.- Example.- 4.5 Possibilistic Multiple Objective Linear Fractional Programming.- 4.6 Interactive Possibilistic Regression.- 4.6.1 Crisp Output and Crisp Input.- Example.- 4.6.2 Imprecise Output and Crisp Input.- Example.- 4.6.3 Imprecise Output and Imprecise Input.- Example.- 5 Concluding Remarks.- 5.1 Future Research.- 5.2 Fuzzy Mathematical Programming.- 5.3 Multiple Attribute Decision Making.- 5.4 Fuzzy Multiple Attribute Decision Making.- 5.5 Group Decision Making under Multiple Criteria.- Books, Monographs and Conference Proceedings.- Journal Articles, Technical Reports and Theses.- Appendix: Stochastic Programming.- A.1 Stochastic Programming with a Single Objective Function.- A.1.1 Distribution Problems.- A.1.2 Two-Stage Programming.- A.1.3 Chance-Constrained Programming.- A.2 Stochastic Programming with Multiple Objective Functions.- A.2.1 Distribution Problem.- A.2.2 Goal Programming Problem.- A.2.3 Utility Function Problem.- A.2.4 Interactive Problem.- References.

1,168 citations


Journal ArticleDOI
TL;DR: New stability conditions for a generalized class of uncertain systems are derived from robust control techniques such as quadratic stabilization, H/sup /spl infin// control theory, and linear matrix inequalities.
Abstract: This paper presents stability analysis for a class of uncertain nonlinear systems and a method for designing robust fuzzy controllers to stabilize the uncertain nonlinear systems, First, a stability condition for Takagi and Sugeno's fuzzy model is given in terms of Lyapunov stability theory. Next, new stability conditions for a generalized class of uncertain systems are derived from robust control techniques such as quadratic stabilization, H/sup /spl infin// control theory, and linear matrix inequalities. The derived stability conditions are used to analyze the stability of Takagi and Sugeno's fuzzy control systems with uncertainty which can be regarded as a generalized class of uncertain nonlinear systems, The design method employs the so-called parallel distributed compensation, important issues for the stability analysis and design are remarked. Finally, three design examples of fuzzy controllers for stabilizing nonlinear systems and uncertain nonlinear systems are presented.

1,139 citations


Book
07 Oct 1996

1,047 citations


Journal ArticleDOI
TL;DR: It is shown that fuzzy integrals are able to model interaction between criteria in a flexible way and is one of the aims of this review to disseminate this emerging technology in many industrial fields.

981 citations


Book
01 Jan 1996
TL;DR: This text is the first to combine the study of neural networks and fuzzy systems, their basics and their use, along with symbolic AI methods to build comprehensive artificial intelligence systems.
Abstract: From the Publisher: "Covering the latest issues and achievements, this well documented, precisely presented text is timely and suitable for graduate and upper undergraduate students in knowledge engineering, intelligent systems, AI, neural networks, fuzzy systems, and related areas. The author's goal is to explain the principles of neural networks and fuzzy systems and to demonstrate how they can be applied to building knowledge-based systems for problem solving. Especially useful are the comparisons between different techniques (AI rule-based methods, fuzzy methods, connectionist methods, hybrid systems) used to solve the same or similar problems." -- Anca Ralescu, Associate Professor of Computer Science, University of Cincinnati Neural networks and fuzzy systems are different approaches to introducing human-like reasoning into expert systems. This text is the first to combine the study of these two subjects, their basics and their use, along with symbolic AI methods to build comprehensive artificial intelligence systems. In a clear and accessible style, Kasabov describes rule- based and connectionist techniques and then their combinations, with fuzzy logic included, showing the application of the different techniques to a set of simple prototype problems, which makes comparisons possible. A particularly strong feature of the text is that it is filled with applications in engineering, business, and finance. AI problems that cover most of the application-oriented research in the field (pattern recognition, speech and image processing, classification, planning, optimization, prediction, control, decision making, and game simulations) are discussed and illustrated with concrete examples. Intended both as a text for advanced undergraduate and postgraduate students as well as a reference for researchers in the field of knowledge engineering, Foundations of Neural Networks, Fuzzy Systems, and Knowledge Engineering has chapters structured for various levels of teaching and includes original work by the author along with the classic material. Data sets for the examples in the book as well as an integrated software environment that can be used to solve the problems and do the exercises at the end of each chapter are available free through anonymous ftp.

Book
01 Aug 1996
TL;DR: A fuzzy algorithm is introduced which, though fuzzy rather than precise in nature, may eventually prove to be of use in a wide variety of problems relating to information processing, control, pattern recognition, system identification, artificial intelligence and, more generally, decision processes involving incomplete or uncertain data.
Abstract: Unlike most papers in Information and Control, our note contains no theorems and no proofs. Essentially, its purpose is to introduce a basic concept which, though fuzzy rather than precise in nature, may eventually prove to be of use in a wide variety of problems relating to information processing, control, pattern recognition, system identification, artificial intelligence and, more generally, decision processes involving incomplete or uncertain data. The concept in question will be called a fuzzy algorithm because it may be viewed as a generalization, through the process of fuzzification, of the conventional (nonfuzzy) conception of an algorithm. More specifically, unlike a nonfuzzy deterministic or nondeterministic algorithm (Floyd, 1967), a fuzzy algorithm may contain fuzzy statements, that is, statements containing names of fuzzy sets (Zadeh, 1965), by which we mean classes in which there may be grades of membership intermediate between full membership and nonmembership. To illustrate, fuzzy algorithms may contain fuzzy instructions such as:

Journal ArticleDOI
TL;DR: A theory of fuzzy objects forn-dimensional digital spaces based on a notion of fuzzy connectedness of image elements and algorithms for extracting a specified fuzzy object and for identifying all fuzzy objects present in the image data are presented.

01 Jan 1996
TL;DR: Lotfi Zadeh (1965) introduced fuzzy set theory and fuzzy logic, and promoted these as a way of reasoning about uncertainty in computer systems.
Abstract: Another approach to reasoning about uncertainty, with a different mathematical basis, is fuzzy logic. Brief history: Standard classical (Boolean) logic (Aristotle, c 50BC; Boole, 1854) uses two possible truth values: • A statement may be true (truth value 1) or false (truth value 0) Łukasiewicz logic (early 20th century): three truth values: • 2, 1 and 0 represent, respectively, “true”, “false” and “unknown” or “irrelevant” • This was further extended to an infinite-valued logic, where real numbers in the range [0,1] represent varying degrees of truth. Only of academic interest, until... Lotfi Zadeh (1965) introduced fuzzy set theory and fuzzy logic, and promoted these as a way of reasoning about uncertainty in computer systems.

Book
01 Aug 1996

Book
01 Jan 1996
TL;DR: In this paper, a collection of papers written by the founder of fuzzy set theory, Lotfi A. Zadeh, is presented, which contains virtually all the major ideas in fuzzy set theories, fuzzy logic, and fuzzy systems in their historical context.
Abstract: From the Publisher: This book consists of papers written by the founder of fuzzy set theory, Lotfi A. Zadeh. Since Zadeh is not only the founder of this field but has also been the principal contributor to its development over the last 30 years, the papers contain virtually all the major ideas in fuzzy set theory, fuzzy logic, and fuzzy systems in their historical context.

Proceedings Article
Ronald Fagin1
01 Jan 1996
TL;DR: An algorithm is given, which has been implemented in Garlic, such that if the conjuncts are independent, then with arbitrarily high probability, the total number of elements retrieved in evaluating the query is sublinear in the database size.
Abstract: In a traditional database system, the result of a query is a set of values (those values that satisfy the query). In other data servers, such as a system with queries based on image content, or many text retrieval systems, the result of a query is a sorted list. For example, in the case of a system with queries based on image content, the query might ask for objects that are a particular shade of red, and the result of the query would be a sorted list of objects in the database, sorted by how well the color of the object matches that given in the query. A multimedia system must somehow synthesize both types of queries (those whose result is a set and those whose result is a sorted list) in a consistent manner. In this paper we discuss the solution adopted by Garlic, a multimedia information system being developed at the IBM Almaden Research Center. This solution is based on “graded” (or “fuzzy”) sets. Issues of efficient query evaluation in a multimedia system are very different from those in a traditional database system. This is because the multimedia system receives answers to subqueries from various subsystems, which can be accessed only in limited ways. For the important class of queries that are conjunctions of atomic queries (where each atomic query might be evaluated by a different subsystem), the naive algorithm must retrieve a number of elements that is linear in the database size. In contrast, in this paper an algorithm is given, which has been implemented in Garlic, such that if the conjuncts are independent, then with arbitrarily high probability, the total number of elements retrieved in evaluating the query is sublinear in the database size (in the case of two conjuncts, it is of the order of the square root of the database size). It is also shown that for such queries, the algorithm is optimal. The matching upper and lower bounds are robust, in the sense that they hold under almost any reasonable rule (including the standard min rule of fuzzy logic) for evaluating the conjunction. Finally, we find a query that is provably hard, in the sense that the naive linear algorithm is essentially optimal.

Book
01 Aug 1996
TL;DR: It is shown that under certain conditions a precise control goal can be attained with fuzzy observation and control as long as the observations become sufficiently precise when the goal is approached.
Abstract: A fuzzy mapping from X to Y is a fuzzy set on X × Y. The concept is extended to fuzzy mappings of fuzzy sets on X to Y, fuzzy function and its inverse, fuzzy parametric functions, fuzzy observation, and control. Set theoretical relations are obtained for fuzzy mappings, fuzzy functions, and fuzzy parametric functions. It is shown that under certain conditions a precise control goal can be attained with fuzzy observation and control as long as the observations become sufficiently precise when the goal is approached.

Book
01 Aug 1996
TL;DR: Soft computing as mentioned in this paper is a collection of methodologies that aim to exploit the tolerance for imprecision and uncertainty to achieve tractability, robustness, and low solution cost, and its principal constituents are fuzzy logic, neurocomputing, and probabilistic reasoning.
Abstract: Discusses soft computing, a collection of methodologies that aim to exploit the tolerance for imprecision and uncertainty to achieve tractability, robustness, and low solution cost. Its principal constituents are fuzzy logic, neurocomputing, and probabilistic reasoning. Soft computing is likely to play an increasingly important role in many application areas, including software engineering. The role model for soft computing is the human mind. >

Journal ArticleDOI
TL;DR: Computer simulation results confirm that the effect of both the fuzzy approximation error and external disturbance on the tracking error can be attenuated efficiently by the proposed adaptive fuzzy control algorithm.
Abstract: A fuzzy logic controller equipped with a training (adaptive) algorithm is proposed in this work to achieve H/sup /spl infin// tracking performance for a class of uncertain (model free) nonlinear single-input single-output (SISO) systems with external disturbances. An attempt is also made to create a bridge between two important control design techniques, i.e., H/sup /spl infin// control design and fuzzy control design, so as to supply H/sup /spl infin// control design with more intelligence and fuzzy control design with better performance. The perfect matching of parameters in an adaptive fuzzy logic system is generally deemed impossible. Therefore, a desired tracking performance cannot be guaranteed in the conventional adaptive fuzzy control systems. In this study, the influence of both fuzzy logic approximation error and external disturbance on the tracking error is attenuated to a prescribed level. Both indirect and direct adaptive fuzzy controllers are employed to treat this H/sup /spl infin// tracking problem. The authors' results indicate that arbitrarily small attenuation level can be achieved via the proposed adaptive fuzzy control algorithm if a weighting factor of control variable is adequately chosen. The proposed design method is also useful for the robust tracking control design of the nonlinear systems with external disturbances and a large uncertainty or unknown variation in plant parameters and structures. Furthermore, only smooth control signals are needed via the proposed control designs. Two simulation examples are given finally to illustrate the performance of the proposed methods. Computer simulation results confirm that the effect of both the fuzzy approximation error and external disturbance on the tracking error can be attenuated efficiently by the proposed method.

Book
01 Jan 1996
TL;DR: This book takes a hands-on, desktop-applications approach to the topic of computational intelligence, featuring examples of specific real-world implementations and detailed case studies, with all pertinent code and software included on a floppy disk packaged with the book.
Abstract: Computational intelligence is an emerging field in computer science which combines fuzzy logic, neural networks, and genetic algorithms for a flexible yet powerful approach to scientific computing. Because computational intelligence combines three interrelated, mathematically-based tools, it has a wide variety of applications, from engineering and process control to experts systems. This book takes a hands-on, desktop-applications approach to the topic, featuring examples of specific real-world implementations and detailed case studies, with all pertinent code and software included on a floppy disk packaged with the book. Features: * Concise introduction to the concepts of fuzzy logic, neural networks, and genetic algorithms, and how they relate to one another within the context of computational intelligence. * Computational intellignece applications, including self-organizing feature maps, fuzzy calculator, evolutionary programming, and fuzzy neural networks. * Detailed case studies from engineering (F-16 flight system), systems control (mass transit scheduling), and medicine (appendicitis diagnosis). * Windows floppy disk with both source code and executable, self-contained programs for desktop implementation of all of the book's applications.

Book ChapterDOI
01 Aug 1996
TL;DR: The calculus of fuzzy restrictions is concerned with translation of propositions of various types into relational assignment equations, and the study of transformations of fuzzy Restrictions which are induced by linguistic modifiers, truth-functional modifiers, compositions, projections and other operations.
Abstract: A fuzzy restriction may be visualized as an elastic constraint on the values that may be assigned to a variable In terms of such restrictions, the meaning of a proposition of the form “x is P,” where x is the name of an object and P is a fuzzy set, may be expressed as a relational assignment equation of the form R(A(x)) = P, where A(x) is an implied attribute of x, R is a fuzzy restriction on x, and P is the unary fuzzy relation which is assigned to R For example, “Stella is young ,” where young is a fuzzy subset of the real line, translates into R(Age(Stella))= young The calculus of fuzzy restrictions is concerned, in the main, with (a) translation of propositions of various types into relational assignment equations, and (b) the study of transformations of fuzzy restrictions which are induced by linguistic modifiers, truth-functional modifiers, compositions, projections and other operations An important application of the calculus of fuzzy restrictions relates to what might be called approximate reasoning , that is, a type of reasoning which is neither very exact nor very inexact The main ideas behind this application are outlined and illustrated by examples

Journal ArticleDOI
TL;DR: The state of the art of model-based fault diagnosis in plants of automatic control systems is reviewed, the basic idea of a novel type of diagnostic observer, the so-called knowledge observer, is introduced and some new results of the author's research group are outlined.

Journal ArticleDOI
TL;DR: It has been proved that this method produces more than a fuzzy interval order: it induces a ranking of fuzzy numbers, and extensions to non-normal fuzzy numbers and fuzzy quantities are proposed.

Journal ArticleDOI
11 Mar 1996
TL;DR: The most important methods are reviewed and a novel approach — interdependence in MCDM — is introduced.
Abstract: Multiple criteria decision making (MCDM) shows signs of becoming a maturing field. There are four quite distinct families of methods: (i) the outranking, (ii) the value and utility theory based, (iii) the multiple objective programming, and (iv) group decision and negotiation theory based methods. Fuzzy MCDM has basically been developed along the same lines, although with the help of fuzzy set theory a number of innovations have been made possible; the most important methods are reviewed and a novel approach — interdependence in MCDM — is introduced.

Journal ArticleDOI
TL;DR: Remote sensing is an attractive source of data for land cover mapping applications, and when pixels may have multiple and partial class membership measures of the strength of class membership may be output and, if strongly related to the land cover composition, mapped to represent such fuzzy land cover.
Abstract: Remote sensing is an attractive source of data for land cover mapping applications. Mapping is generally achieved through the application of a conventional statistical classification, which allocates each image pixel to a land cover class. Such approaches are inappropriate for mixed pixels, which contain two or more land cover classes, and a fuzzy classification approach is required. When pixels may have multiple and partial class membership measures of the strength of class membership may be output and, if strongly related to the land cover composition, mapped to represent such fuzzy land cover. This type of representation can be derived by softening the output of a conventional ‘hard’ classification or using a fuzzy classification. The accuracy of the representation provided by a fuzzy classification is, however, difficult to evaluate. Conventional measures of classification accuracy cannot be used as they are appropriate only for ‘hard’ classifications. The accuracy of a classification may, ho...

Journal ArticleDOI
TL;DR: A method is proposed for aggregating individual fuzzy opinions into a group fuzzy consensus opinion using the index of consensus of each expert to the other experts using a similarity measure.

Journal ArticleDOI
TL;DR: The validity-guided VGC algorithm uses cluster-validity information to guide a fuzzy (re)clustering process toward better solutions, and VGC's performance approaches that of the (supervised) k-nearest-neighbors algorithm.
Abstract: When clustering algorithms are applied to image segmentation, the goal is to solve a classification problem. However, these algorithms do not directly optimize classification duality. As a result, they are susceptible to two problems: 1) the criterion they optimize may not be a good estimator of "true" classification quality, and 2) they often admit many (suboptimal) solutions. This paper introduces an algorithm that uses cluster validity to mitigate problems 1 and 2. The validity-guided (re)clustering (VGC) algorithm uses cluster-validity information to guide a fuzzy (re)clustering process toward better solutions. It starts with a partition generated by a soft or fuzzy clustering algorithm. Then it iteratively alters the partition by applying (novel) split-and-merge operations to the clusters. Partition modifications that result in improved partition validity are retained. VGC is tested on both synthetic and real-world data. For magnetic resonance image (MRI) segmentation, evaluations by radiologists show that VGC outperforms the (unsupervised) fuzzy c-means algorithm, and VGC's performance approaches that of the (supervised) k-nearest-neighbors algorithm.

Journal ArticleDOI
06 Oct 1996
TL;DR: Various applications of artificial intelligence (AI) techniques (expert systems, neural networks, and fuzzy logic) presented in the literature prove that such technologies are well suited to cope with on-line diagnostic tasks for induction machines.
Abstract: Various applications of artificial intelligence (AI) techniques (expert systems, neural networks, and fuzzy logic) presented in the literature prove that such technologies are well suited to cope with on-line diagnostic tasks for induction machines. The features of these techniques and the improvements that they introduce in the diagnostic process are recalled, showing that, in order to obtain an indication on the fault extent, faulty machine models are still essential. Moreover, by the models, that must trade off between simulation result effectiveness and simplicity, it is possible to overcome crucial points of the diagnosis. With reference to rotor electrical faults of induction machines, a new and simple procedure based on a model which includes the speed ripple effect is developed. This procedure leads to a new diagnostic index, independent of the machine operating condition and inertia value, that allows the implementation of the diagnostic system with a minimum configuration intelligence.

Journal ArticleDOI
11 Mar 1996
TL;DR: New elicitation techniques to determine attributes importance are proposed, which range from statistical to scaling methods based on linguistic variables, to enable a more versatile elicitation procedure as well as providing crisp preferences.
Abstract: This paper reviews the main theories and methods used for multiple attribute decision making in a fuzzy environment. Fuzzy multiple attribute decisions involve two processes, the rating and the ranking of alternatives. If the rating results are crisp then the ranking procedure becomes straightforward; hence, the emphasis of this paper is on obtaining crisp ratings for alternatives. In order to aid the decision maker to express his/her attribute preferences, new elicitation techniques to determine attributes importance are proposed. These techniques range from statistical to scaling methods based on linguistic variables, and so enable a more versatile elicitation procedure as well as providing crisp preferences.