Symbolic sensors : one solution to the numerical-symbolic interface

Similar documents
Abstract. Keywords. Introduction

Fuzzy Logic and Computing with Words. Ning Xiong. School of Innovation, Design, and Engineering Mälardalen University. Motivations

THE ORDERS OF MAGNITUDE MODELS AS QUALITATIVE ALGEBRAS

VI Fuzzy Optimization

A class of fusion rules based on the belief redistribution to subsets or complements

Financial Informatics IX: Fuzzy Sets

Math 105A HW 1 Solutions

Artificial Intelligence

Statistical Inference

Introduction to Automata

A Generalized Decision Logic in Interval-set-valued Information Tables

Show Your Work! Point values are in square brackets. There are 35 points possible. Some facts about sets are on the last page.

Supplementary Material for MTH 299 Online Edition

Interleaved Alldifferent Constraints: CSP vs. SAT Approaches

ME 534. Mechanical Engineering University of Gaziantep. Dr. A. Tolga Bozdana Assistant Professor

Encoding formulas with partially constrained weights in a possibilistic-like many-sorted propositional logic

Intelligent Systems and Control Prof. Laxmidhar Behera Indian Institute of Technology, Kanpur

Formal Semantics Of Verbs For Knowledge Inference

Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008

A NEW DISTANCE FOR FUZZY DESCRIPTIONS OF MEASUREMENTS

ANALYSIS OF TEMPORAL DEPENDENCIES OF PERCEPTIONS AND INFLUENCES FOR THE DISTRIBUTED EXECUTION OF AGENT-ORIENTED SIMULATIONS

Fuzzy Propositional Logic for the Knowledge Representation

The Logic of Partitions

Common Core State Standards for Mathematics

UNIT II REGULAR LANGUAGES

A new Approach to Drawing Conclusions from Data A Rough Set Perspective

18.S097 Introduction to Proofs IAP 2015 Lecture Notes 1 (1/5/2015)

Trial version. Temperature Sensing. How does the temperature sensor work and how can it be used to control the temperature of a refrigerator?

FS Part 1 : Uncertainty, Intervals and FS. André Bigand, LISIC, ULCO Université Lille-Nord de France Web:www-lisic.univ-littoral.

Integrating State Constraints and Obligations in Situation Calculus

Basic counting techniques. Periklis A. Papakonstantinou Rutgers Business School

Chapter 2 Classical Probability Theories

Review 1. Andreas Klappenecker

EEE 8005 Student Directed Learning (SDL) Industrial Automation Fuzzy Logic

Fuzzy and Rough Sets Part I

An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints

1.4 Cardinality. Tom Lewis. Fall Term Tom Lewis () 1.4 Cardinality Fall Term / 9

Chapter I : Basic Notions

INTUITIONISTIC FUZZY TOPOLOGICAL SPACES

Foundation for Neutrosophic Mathematical Morphology

Patterns and minimal dynamics for graph maps

Financial Informatics XI: Fuzzy Rule-based Systems

CS 226: Digital Logic Design

Designing and Evaluating Generic Ontologies

SYMBOLIC LOGIC (PART ONE) LAMC INTERMEDIATE - 5/18/14

A Discrete Duality Between Nonmonotonic Consequence Relations and Convex Geometries

Revisit summer... go to the Fitzwilliam Museum!

Temperature Sensing. How does the temperature sensor work and how can it be used to control the temperature of a refrigerator?

Final Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is

A BOUNDARY NOTATION FOR VISUAL MATHEMATICS Jeffrey James and William Bricken September Published in IEEE Visual Languages'92 ABSTRACT

Beta-lattice multiresolution of quasicrystalline Bragg peaks

An Efficient Algorithm for Finding Over-constrained Sub-systems for Construction of Diagnostic Tests

Step-by-step and detailed demonstrations of how a specific concept or technique is applied in solving problems.

Properties of Probability

A NEW SET THEORY FOR ANALYSIS

MOST OF the published research on control of discreteevent

Single Maths B: Introduction to Probability

Inference of A Minimum Size Boolean Function by Using A New Efficient Branch-and-Bound Approach From Examples

On (Weighted) k-order Fuzzy Connectives

Notes on Ordered Sets

EXPERT SYSTEM FOR POWER TRANSFORMER DIAGNOSIS

Discrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009

Partial model checking via abstract interpretation

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Safety and Reliability of Embedded Systems. (Sicherheit und Zuverlässigkeit eingebetteter Systeme) Fault Tree Analysis Obscurities and Open Issues

Adequate set of connectives, logic gates and circuits

CHAPTER 1. Preliminaries. 1 Set Theory

A Polynomial Time Algorithm for Parsing with the Bounded Order Lambek Calculus

Introduction to Topology

Math Fall 2014 Final Exam Solutions

Formalizing Classes of Information Fusion Systems

Communication Theory II

Acta Mathematica Academiae Paedagogicae Nyíregyháziensis 18 (2002),

DRAFT CONCEPTUAL SOLUTION REPORT DRAFT

Solving Fuzzy PERT Using Gradual Real Numbers

Unit 5 Algebraic Investigations: Quadratics and More, Part 1

Boolean Algebra CHAPTER 15

Also, course highlights the importance of discrete structures towards simulation of a problem in computer science and engineering.

Boolean Algebras. Chapter 2

EXPAND expressions and equations by using the. combining like terms

Chapter 0 Introduction. Fourth Academic Year/ Elective Course Electrical Engineering Department College of Engineering University of Salahaddin

Extensions Of S-spaces

Artificial Neural Network and Fuzzy Logic

Pairing Transitive Closure and Reduction to Efficiently Reason about Partially Ordered Events

The matrix approach for abstract argumentation frameworks

Modeling and Control for (max, +)-Linear Systems with Set-Based Constraints

(Refer Slide Time: 1:42)

ECARES Université Libre de Bruxelles MATH CAMP Basic Topology

School of Engineering Faculty of Built Environment, Engineering, Technology & Design

Logic and Propositional Calculus

Quantum logics with given centres and variable state spaces Mirko Navara 1, Pavel Ptak 2 Abstract We ask which logics with a given centre allow for en

A call-by-name lambda-calculus machine

Lecture 1: An introduction to probability theory

ON THE POSSIBLE QUANTITIES OF FIBONACCI NUMBERS THAT OCCUR IN SOME TYPES OF INTERVALS

Morphology Gonzalez and Woods, Chapter 9 Except sections 9.5.7, 9.5.8, and Repetition of binary dilatation, erosion, opening, closing

Propositional Logic, Predicates, and Equivalence

Part I : Bases. Part I : Bases

Econ 325: Introduction to Empirical Economics

A short note on hit and miss hyperspaces Dedicated to Professor Som Naimpally on the occasion of his 70th birthday

Reliability of Technical Systems

Transcription:

Benoit E., Foulloy L., Symbolic sensors : one solution to the numerical-symbolic interface, Proc. of the IMACS DSS&QR workshop, Toulouse, France, march 1991. pp. 321-326 Symbolic sensors : one solution to the numerical-symbolic interface E. Benoit L. Foulloy Laboratoire d Automatique et de MicroInformatique Industrielle, Université de Savoie 41 Avenue de la plaine, BP 806, 74016 Annecy Cedex, France According to the evolution of control systems, the nature of information become more complex. Artificial intelligent technics use and produce symbolic information, therefore there is a need for sensors which deliver this kind of information. This paper introduces the concept of symbolic sensor as an extension of the smart sensor one. Then, the links between the physical world and the symbolic one are introduced. The creation of symbols is proposed within the frame of the pretopology theory. In order to adapt the sensor to the measurement context, a learning process has been used to provide an adaptive interpretation of the measurement. Finally, an example is presented in the case of a temperature measurement.

Introduction In every control systems, a part of the signal processing is attached to the sensors. Therefore, as controllers become more complex, a part of the signal processing is transferred to the sensor. Analog sensors integrate it in the conditioner, while smart sensors have computation devices to process the signal. The most important difference between this two king of sensors is the nature of informations exchanged with the controller, it fixes the maximum decentralization of the control system. Nowadays, it is generally admitted that the characteristic functionality of a smart sensor should be its ability to communicate with a communication bus or network, to verify the correctness of the measurement and to adapt itself when the environment is changing (Burd [1], Giachino [2], Bois [3]). A possible description of a smart sensor is given by Favenec [4] (see Fig. 1.). We consider that an intelligent sensor should own four mechanisms: perception (the main part of the sensor), communication, learning and faculty of reasoning.

Physical phenomenon Smart sensor Transducer Conditioner Identification Computation device Power supply Communication interface Digital data Communication bus Fig. 1. Internal scheme of a smart sensor. Applications of artificial intelligent technics like expert systems and qualitative control, use symbolic informations. Then, the decentralization of a part of the decision process induces adapted perception organs. For example the Order of Magnitude model uses symbols like negative medium or positive small [5], therefore there is a need for sensors that return this kind of symbols. We define the symbolic sensor as a smart sensor which is able to work and to provide symbolic informations relative to the measurement. This new property allows the sensor to make

decisions about the measurement and the context, it adds the possibility of reasoning that is commonly used by human beings in usual intelligent activities. Physical phenomenon Symbolic sensor Transducer Conditioner Communication bus Identification Power supply Computation device Signal processing Knowledge Decision base device Communication interface Digital and symbolic data Fig. 2. Internal scheme of a symbolic sensor. Translation, concept and interpretation In order to realize a numeric to symbolic link, we define a numerical domain E as the set of the measurement and a symbolic one L as a set of symbols characterizing the measure. The meaning of a symbolic value will be called a translation and be defined as an injective application from the symbolic set to the set of the subsets of the numerical domain (injectivity insures that two identical symbols have the same translation). A generalization of the concept of translation was developed by Luzeaux [6]. τ: L P(E) The association of a symbolic value and its translation is called a concept. The symbolic measurement will be obtained by means of a new relationship from the numerical domain to the symbolic one, called an interpretation. ι: E L The relationship between the translation and the interpretation is summarized in Fig. 3.

L E L τ ι x A = τ(l) A P(E) Fig. 3. Relationship between a translation and an interpretation The definition of the concepts for any symbol induces the definition of the translation. The translation can be unconstrained, then, for any symbol L, τ(l) can be any subset on E. In the following of this paper, we study a kind of symbolic sensor which impose several conditions on the translation: The intersection between the translations of two symbols must be empty. The numerical domain is an ordered set with an order relation noted < E. The translation of any symbol is an interval: L L, x, y τ(l) such that x < E y, z E x < E z < E y z τ(l) Then, the interpretation can be define as follow. L = ι(x) if x τ(l) This relationship is an application when τ(l) is a partition on E. This assumption will be used in the following. The pretopology formalism a) Introduction We give here several notations used in the paper: A B (resp. A B) will denote the union (resp. the intersection) of two sets A and B.The difference of sets A,B will be represented by A- B. The complementation of a set A will be denoted by c(a). The positive integer card(a) denotes the cardinal number of the set A. If f is a relation on E, A a subset of E and n an integer up to 0 then f n ( A) = ff ( n 1 ( A) ) f 1 ( A) = fa ( )

Originally used for morphological image analysis, the pretopology formalism gives operators such as dilatation and erosion working on sets. Before using this mathematical tool on concepts, let us recall the principles of the pretopology described by Emptoz [7]: Let E be a set, for any x in E, is given a family B(x) of subsets of E which all contain x. This family is called a structuring base. Given B(x) for any x in E, we say that E is embedded with a pretopological structure or simply a pretopology. Two basic operators, the adherence and the interior are defined as follows. Let A be a subset of E adh B (A) = {x E / B, B B(x), B A } int B (A) = c(adh B (c(a))) Example: E=Z 2, x = (i, j), B(x)={B1,B2} (Z is the set of signed integers) with: B1 = {(i-1,j),(i,j),(i+1,j)} B2 = {(i, j-1),(i, j), (i, j+1)} A adh B (A) int B (A) adh B (adh B (A)) int B (int B (A)) Fig. 4. Example using interior and adherence. Assuming that pred(x) is the element which precedes x and succ(x) the element which follows x in a totally ordered discrete set, the two following structuring bases are defined: Bsup(x) = {{pred(x), x}} and Binf(x) = {{x, succ(x)}} Let us give several examples of the effect, in the set E={0,...,8}, of the adherence and interior operators using Bsup(x) and Binf(x). adh Bsup int Bsup adh Binf adh Bsup int Bsup 0 4 8 0 4 8 ({4,5}) = {4,5,6} ({4,5}) = {5} ({4,5}) = {3,4,5} ({}) = {} ({0,1}) = {0,1} Fig. 5. Action of int and adh with Bsup and Binf

These two bases will be used in the following. b) The generic concept and the creation of new concepts The generic concept corresponds to a part of the numerical domain which is important for the global task that is to be realized with the sensor. Let us give an example. Assume that a thermometer is used for a swimming-pool. It makes sense to define a generic concept temperature is correct around 23 o C. Now, if the sensor is used into a deep freeze, the generic concept temperature is correct should be around -18 o C. According to our approach, the translation associated to the generic concept is an interval on the numerical domain. Let us define the translation associated to generic concept temperature is correct for the swimming pool example by τ(temperature_is_correct) = {21, 22, 23, 24, 25}. Obviously, it is a tedious task to specify each translation of the symbols. Let us introduce the operators that are used to generate new concepts. Our problem is to find operators that act in the symbolic domain and their definition in the numerical domain in order to compute the new concepts. First, let us define a mapping function F in the symbolic domain L. F: L L L 1 L 2 = F(L 1 ) We can now define the associated mapping function in the numeric domain E. f F: P(E) P(E) τ(l 1 ) τ(l 2 ) = τ(f(l 1 )) = f F (τ(l 1 )) The relationship between functions F and f F is given in Fig. 6. L L 1 F L 2 τ f F E A = τ(l 1 ) B = f F (Α) Fig. 6. Relationship between F and f F.

Assuming that A P(E), L 1 and L 2 L such that A = τ(l 1 ), four mapping functions have been defined with the help of the pretopology formalism. L 2 = more(l 1 ) L 2 = less(l 1 ) L 2 = below(l 1 ) L 2 = above(l 1 ) In the previous sections, it has been shown how to build automatically with several operators one relationship between the numerical and the symbolic domains. It seems obvious that the definition of translations is the difficult point. A symbolic sensor that is concerned with a temperature measurement problem can interpret the measure temperature=15 C as a cool temperature. According to the context, the interpretation can be false: joined with a swimming-pool, the temperature is cold. Joined with a refrigerator, it is very hot. Furthermore, the interpretation can differ with the interlocutor. This last point is very important during the knowledge acquisition time when one wants to implement an expert system. Therefore, there is a need to configure the sensor according to the context (envif above ( A) = lim adh ( A) A Bsup n card( A ) A f more ( A) = adh ( ) A Bsup card( A ) A f less ( A) = adh Binf ( ) A f below ( A) = lim adh ( A) A Binf n n n Let us give an example for a temperature sensor on a discrete measurement set (temperature is given in C) E = {0,1,...,38,39}. First of all, we define the generic concept good such as τ(good) = {18, 19, 20, 21, 22}. Then, we inform the sensor about the semantics between the generic concept and new concepts. cold = below(good) and warm=more(good). The sensor uses this information to build its concepts (see Fig. 7.). above cold good more 18 22 warm 0 17 23 27 Fig. 7. Concepts building. c) Adaptation of the interpretation

ronment, measurement job) and the interlocutor. The cooperative configuration is based on a learning method with a teacher (control system, human or aggregation sensors) who interprets correctly a measure in a defined context. The principle of the cooperative configuration is given in Fig. 8. It is based on the qualitative comparison between the interpretation of the sensor (sc) and the interpretation of the professor (sp) for the same numerical input x. The qualitative comparison e takes its values in the set of signs S = {-, 0, +} usual in qualitative analysis. The result is obtained from the order relation on L. e = + if sp > L sc e = - if sp < L sc e = 0 if sp = L sc The qualitative comparison is used to synthesize a symbolic input u for the sensor which takes its value in the set M = {increase, decrease, maintain}. This symbolic input is used to change the translation of each symbolic value and, of course, the sensor interpretations. The idea is to change the translation in order to obtain a qualitative feedback of the sensor interpretation according to the professor interpretation. Physical phenomenon Teacher x Symbolic Sensor Interpretation sp Interpretation Qualitative comparison sc e Decision Modification u Fig. 8. principle of cooperative configuration. The qualitative feedback can be easily obtained with the following control strategy. if e = + then u = increase if e = - then u = decrease if e = 0 then u = maintain The semantics of the control actions on u are respectively to increase, decrease or maintain the sensor interpretation. Let ι k (x) be the inter-

pretation of the measurement x at the learning cycle k and τ k (L i ) the translation of the lexical value L i at the learning cycle k, the control actions are such that: ι k+1 (x) = increase(ι k (x)) L ι k (x) ι k+1 (x) = decrease(ι k (x)) L ι k (x) ι k+1 (x) = maintain(ι k (x)) = L ι k (x) Now, in order to complete the approach, the function increase, decrease and maintain have to be defined. The function maintain is obvious since no action is performed. Let L L be the interpretation of the measurement x, L = ι k (x), then the functions increase and decrease are defined as follows from the interior operation (another definition from the adherence operator can easily be obtained). ι k+1 (x) = increase(l): τ k+1 (L) = int Binf (τ k (L)) τ k+1 (succ L (L)) = τ k (succ L (L)) (τ k (L) - τ k+1 (L)) ι k+1 (x) = decrease(l): τ k+1 (L) = int Bsup (τ k (L)) τ k+1 (pred L (L)) = τ k (pred L (L)) (τ k (L) - τ k+1 (L)) The application of such functions on a lexical set with five symbolic values at the learning cycle k is provided in Fig. 9. to Fig. 11. τ k (L 2 ) τ k (L 4 ) τ k (L 1 ) 12 17 τ k (L 3 ) τ k (L 5 ) 0 11 18 39 Fig. 9. Translation at the learning cycle k. τ k+1 (L 2 ) τ k+1 (L 4 ) τ k+1 (L 1 ) 13 17 τ k+1 (L 3 ) τ k+1 (L 5 ) 0 12 18 39 Fig. 10. New translation after the application of decrease for x=15.

τ k+1 (L 2 ) τ k+1 (L 4 ) τ k+1 (L 1 ) 12 16 τ k+1 (L 3 ) τ k+1 (L 5 ) 0 11 17 39 Fig. 11. New translation after the application of increase for x=15. Application We illustrate This formalism with an example of cooperative configuration of a temperature sensor. At first, we build a symbolic sensor which have the symbolic domain L={ cold, cool, good, warm, hot} and a numerical domain E=[0 o C, 39 o C] the discrete set of integer value, in Celsius, of temperature between 0 o C and 39 o C: We give the following informations to the sensor: - the generic concept is good associated with [18,22]. - warm is more than good. - hot is above warm. - cool is less than good. - cold is below cool. The Fig. 12. shows the concepts built by the sensor. cool 13 17 warm 23 27 0 cold 12 18 22 good 28 39 hot Fig. 12. The five concepts. During a learning cycle, the sensor makes a measurement and give it to the teacher (the author in this case), this one makes a qualitative comparison with its interpretation and gives the appropriate action to the sensor. The modification of the perception of the environment is performed around four points in the measurement set (28 o, 25 o, 17 o and 12 o ) during 10 learning cycles. The five first learning cycles are detailed: Learning cycle 1 the temperature is : 25 o C

the sensor interpretation is the teacher action is Learning cycle 2 the temperature is the sensor interpretation is the teacher action is Learning cycle 3 the temperature is the sensor interpretation is the teacher action is Learning cycle 4 the temperature is the sensor interpretation is the teacher action is Learning cycle 5 the temperature is the sensor interpretation is the teacher action is : warm : decrease : 25 o C : warm : decrease : 25 o C : warm : decrease : 25 o C : good : maintain : 28 o C : hot : decrease The Fig. 13. shows the concepts after the configuration. cool 13 16 warm 26 28 0 cold 12 17 25 good 29 39 hot Fig. 13. Result of the configuration. Conclusion After the integration of the analog to digital conversion and the signal processing into intelligent sensors, the integration of a part of the decision process and of the knowledge into the symbolic sensor represents a logical evolution of the decentralization effort of the supervisor system tasks. The symbolic sensor has a perceptive knowledge, materialized through the segmentation of the measurement domain, and a semantics knowledge (the mean of words like more than or increase ).

The cooperative configuration enables the acquisition of this knowledge without knowing the relation between the measure, the context and the interpretation. So, the possibility to have a symbolic sensor which can interpret human concepts like comfort or danger can be considered. The expert system, integrated in the sensor, is able to manipulate the knowledge base and the perceptive knowledge, it can take a decision about the sensor itself or about the environment. For example, it can see a failure on itself or determine the context by a communication with the other sensors and the system. This paper has presented a restrictive kind of symbolic sensors working on monodimensional discrete sets of measurement, ordered lexical sets and static phenomena. We actually work on sensors using multidimensional measurement sets and non ordered lexical sets. Furthermore, an extension to a dynamic interpretation and to fuzzy symbolic informations is undergoing. References [1] N.C. Burd, A.P. Dorey, Intelligent transducers, Journal of Microcomputer Applications, No 7, pp. 87-97, 1984. [2] J. M. Giachino, Smart sensors, Sensors and actuators, Vol. 10, pp. 239-248, 1986. [3] E. Bois, Optical fibre displacement: how fibres can benefit smart sensors, Proc. of IFAC Advanced Information Processing in Automatic Control, Nancy, France, vol. 1, pp. 239-245, July 1989. [4] J. M. Favenec, Smart sensors in industry, Journal of physics. e. scientific instruments, No 20, pp. 1087-1090, 1987. [5] A. Missier, N. Piera, L. Travé-Massuyès, Order of magnitude qualitative algebras : A survey, Revue d intelligence artificielle, Vol. 3, No 4, pp. 95-109, 1989. [6] D. Luzeaux, Normalizing symbolic reasoning, accepted for IMACS DSS&QR workshop, Toulouse, France, march 1991. [7] H. Emptoz, M. Lamure, A systemic approach to pattern recognition, Robotica, 1987, Vol. 5, p. 129-133.