Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 12

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych:  fuzzy logic
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
Computing, in its usual sense, is centered on manipulation of numbers and symbols. In contrast, computing with words, or CW for short, is a methodology in which the objects of computation are words and propositions drawn from a natural language, e.g., small, large, far, heavy, not very likely, the price of gas is low and declining, Berkeley is near San Francisco, it is very unlikely that there will be a significant increase in the price of oil in the near future, etc. Computing with words is inspired by the remarkable human capability to perform a wide variety of physical and mental tasks without any measurements and any computations. Familiar examples of such tasks are parking a car, driving in heavy traffic, playing golf, riding a bicycle, understanding speech and summarizing a story. Underlying this remarkable capability is the brain’s crucial ability to manipulate perceptions – perceptions of distance, size, weight, color, speed, time, direction, force, number, truth, likelihood and other characteristics of physical and mental objects. Manipulation of perceptions plays a key role in human recognition, decision and execution processes. As a methodology, computing with words provides a foundation for a computational theory of perceptions – a theory which may have an important bearing on how humans make – and machines might make – perception-based rational decisions in an environment of imprecision, uncertainty and partial truth. A basic difference between perceptions and measurements is that, in general, measurements are crisp whereas perceptions are fuzzy. One of the fundamental aims of science has been and continues to be that of progressing from perceptions to measurements. Pursuit of this aim has led to brilliant successes. We have sent men to the moon; we can build computers that are capable of performing billions of computations per second; we have constructed telescopes that can explore the far reaches of the universe; and we can date the age of rocks that are millions of years old. But alongside the brilliant successes stand conspicuous underachievements and outright failures. We cannot build robots which can move with the agility of animals or humans; we cannot automate driving in heavy traffic; we cannot translate from one language to another at the level of a human interpreter; we cannot create programs which can summarize non-trivial stories; our ability to model the behavior of economic systems leaves much to be desired; and we cannot build machines that can compete with children in the performance of a wide variety of physical and cognitive tasks. It may be argued that underlying the underachievements and failures is the unavailability of a methodology for reasoning and computing with perceptions rather than measurements. An outline of such a methodology – referred to as a computational theory of perceptions – is presented in this paper. The computational theory of perceptions, or CTP for short, is based on the methodology of computing with words (CW). In CTP, words play the role of labels of perceptions and, more generally, perceptions are expressed as propositions in a natural language. CW-based techniques are employed to translate propositions expressed in a natural language into what is called the Generalized Constraint Language (GCL). In this language, the meaning of a proposition is expressed as a generalized constraint, X isr R, where X is the constrained variable, R is the constraining relation and isr is a variable copula in which r is a variable whose value defines the way in which R constrains X. Among the basic types of constraints are: possibilistic, veristic, probabilistic, random set, Pawlak set, fuzzy graph and usuality. The wide variety of constraints in GCL makes GCL a much more expressive language than the language of predicate logic. In CW, the initial and terminal data sets, IDS and TDS, are assumed to consist of propositions expressed in a natural language. These propositions are translated, respectively, into antecedent and consequent constraints. Consequent constraints are derived from antecedent constraints through the use of rules of constraint propagation. The principal constraint propagation rule is the generalized extension principle. The derived constraints are retranslated into a natural language, yielding the terminal data set (TDS). The rules of constraint propagation in CW coincide with the rules of inference in fuzzy logic. A basic problem in CW is that of explicitation of X, R and r in a generalized constraint, X isr R, which represents the meaning of a proposition, p, in a natural language. 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 and CTP. At this juncture, the computational theory of perceptions – which is based on CW – is in its initial stages of development. In time, it may come to play an important role in the conception, design and utilization of information/intelligent systems. The role model for CW and CTP is the human mind.
EN
We significantly simplify the axiomatic system $L_{CBA}$ for fuzzy logic with a non-associative conjunction.
3
Content available remote

Formal Introduction to Fuzzy Implications

51%
EN
In the article we present in the Mizar system the catalogue of nine basic fuzzy implications, used especially in the theory of fuzzy sets. This work is a continuation of the development of fuzzy sets in Mizar; it could be used to give a variety of more general operations, and also it could be a good starting point towards the formalization of fuzzy logic (together with t-norms and t-conorms, formalized previously).
4
Content available remote

Basic Formal Properties of Triangular Norms and Conorms

51%
EN
In the article we present in the Mizar system [1], [8] the catalogue of triangular norms and conorms, used especially in the theory of fuzzy sets [13]. The name triangular emphasizes the fact that in the framework of probabilistic metric spaces they generalize triangle inequality [2]. After defining corresponding Mizar mode using four attributes, we introduced the following t-norms: minimum t-norm minnorm (Def. 6), product t-norm prodnorm (Def. 8), Łukasiewicz t-norm Lukasiewicz_norm (Def. 10), drastic t-norm drastic_norm (Def. 11), nilpotent minimum nilmin_norm (Def. 12), Hamacher product Hamacher_norm (Def. 13), and corresponding t-conorms: maximum t-conorm maxnorm (Def. 7), probabilistic sum probsum_conorm (Def. 9), bounded sum BoundedSum_conorm (Def. 19), drastic t-conorm drastic_conorm (Def. 14), nilpotent maximum nilmax_conorm (Def. 18), Hamacher t-conorm Hamacher_conorm (Def. 17). Their basic properties and duality are shown; we also proved the predicate of the ordering of norms [10], [9]. It was proven formally that drastic-norm is the pointwise smallest t-norm and minnorm is the pointwise largest t-norm (maxnorm is the pointwise smallest t-conorm and drastic-conorm is the pointwise largest t-conorm). This work is a continuation of the development of fuzzy sets in Mizar [6] started in [11] and [3]; it could be used to give a variety of more general operations on fuzzy sets. Our formalization is much closer to the set theory used within the Mizar Mathematical Library than the development of rough sets [4], the approach which was chosen allows however for merging both theories [5], [7].
EN
The main area which Formal Safety Assessment (FSA) methodology was created for is maritime safety. Its model presents quantitative risk estimation and takes detailed information about accident characteristics into account. Nowadays, it is broadly used in shipping navigation around the world. It has already been shown that FSA can be widely used for the assessment of pilotage safety. On the basis of analysis and conclusion on the FSA approach, this paper attempts to show that the adaptation of this method to another area-risk evaluating in operating conditions of buildings-is possible and effective. It aims at building a mathematical model based on fuzzy logic risk assessment with different habitat factors included. The adopted approach lets us describe various situations and conditions that occur in creating and exploiting of buildings, allowing for automatic control of the risk connected to them.
EN
Knowledge about the relation between faults and the observed symptoms is necessary for fault isolation. Such a relation can be expressed in various forms, including binary diagnostic matrices or information systems. The paper presents the use of fuzzy logic for diagnostic reasoning. This method enables us to take into account various kinds of uncertainties connected with diagnostic reasoning, including the uncertainty of the faults-symptoms relation. The presented methods allow us to determine the fault certainty factor as well as certainty factors of the normal and unknown process states. The unknown process state factor groups all the states with unknown and multiple faults with the states with improper residual values, while the normal state factor indicates similarity between the observed state and the pattern fault-free state.
7
Content available remote

Modelling and control of an omnidirectional mobile manipulator

51%
EN
A new approach to control an omnidirectional mobile manipulator is developed. The robot is considered to be an individual agent aimed at performing robotic tasks described in terms of a displacement and a force interaction with the environment. A reactive architecture and impedance control are used to ensure reliable task execution in response to environment stimuli. The mechanical structure of our holonomic mobile manipulator is built of two joint manipulators mounted on a holonomic vehicle. The vehicle is equipped with three driven axles with two spherical orthogonal wheels. Taking into account the dynamical interaction between the base and the manipulator, one can define the dynamics of the mobile manipulator and design a nonlinear controller using the input-state linearization method. The control structure of the robot is built in order to demonstrate the main capabilities regarding navigation and obstacle avoidance. Several simulations were conducted to prove the effectiveness of this approach.
8
45%
EN
The paper presents the design and implementation of a digital rule-relational fuzzy logic controller. Classical and decomposed logical structures of fuzzy systems are discussed. The second allows a decrease in the hardware cost of the fuzzy system and in the computing time of the final result (fuzzy or crisp), especially when referring to relational systems. The physical architecture consists of IP modules implemented in an FPGA structure. The modules can be inserted into or removed from the project to get a desirable fuzzy logic controller configuration. The fuzzy inference system implemented in FPGA can operate with a much higher performance than software implementations on standard microcontrollers.
9
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Nilpotent Minimum Logic NM and Pretabularity

45%
EN
This paper deals with pretabularity of fuzzy logics. For this, we first introduce two systems NMnfp and NM½, which are expansions of the fuzzy system NM (Nilpotent minimum logic), and examine the relationships between NMnfp and the another known extended system NM-. Next, we show that NMnfp and NM½ are pretabular, whereas NM is not. We also discuss their algebraic completeness.  
EN
A hybrid method combining an evolutionary search strategy, interval mathematics and pole assignment-based closed-loop control synthesis is proposed to design a robust TSK fuzzy controller. The design objective is to minimize the number of linear controllers associated with rule conclusions and tune the triangular-shaped membership function parameters of a fuzzy controller to satisfy stability and desired dynamic performances in the presence of system parameter variation. The robust performance objective function is derived based on an interval Diophantine equation. Thus, the objective of a fuzzy logic-based control scheme is to place all the closed-loop control system characteristic polynomial coefficients within desired intervals. The reproduction process in the proposed Evolutionary Algorithm (EA) is based on the arithmetical crossover, uniform and non-uniform mutation along with gene deletion/insertion mutation ensuring a diversity of genomes sizes, as well as a diversity in the parameter space of membership functions. The proposed algorithm was implemented to design a fuzzy logic-based anti-sway crane control system taking into consideration the rope length and the mass of a payload variation. The results of experiments conducted using the EA for different conditions assumed for system parameter intervals and desired closed-loop system performances are compared with results achieved using the iterative procedure which is also described in the paper.
11
Content available remote

What is not clear in fuzzy control systems

38%
EN
The paper presents a number of unclear, unsolved or partly solved problems of fuzzy logic, which hinder precise transformation of expert knowledge about proper control of a plant in a fuzzy controller. These vague problems comprise the realization of logical and arithmetic operations and another basic problem, i.e., the construction of membership functions. The paper also indicates how some of the above problems can be solved.
12
Content available remote

Fuzzy logic gain scheduling for non-linear servo tracking

38%
EN
This paper proposes the use of gain scheduling as a method of controlling a servo system with hard non-linear elements. The servo controls two elements of a tracker mounted on a ship at sea. There is stiction at the zero velocity point and non-linear friction against the motion of each tracker axis. A dual feedback loop control structure is employed. Fuzzy logic is used to provide smoothly varying non-linear scheduling functions to map the velocity of the servo relevant to the deck of the ship onto the rate loop controller parameters. Consideration is given to the use of a derivative signal as a secondary input to the fuzzy inference system. Results are presented which demonstrate that this method of controlling the servo system gives a dramatic improvement over the traditional linear control methodology for low velocity tracking performance. A linear PID controller is used in the outer loop and its design is also given some consideration.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.