By Topic

Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on

Issue 6 • Date Dec. 1997

Filter Results

Displaying Results 1 - 15 of 15
  • 1997 Index IEEE Transactions on Systems, Man, And Cybernetics Part B: Cybernetics Vol. 27

    Publication Year: 1997 , Page(s): 1 - 13
    Save to Project icon | Request Permissions | PDF file iconPDF (464 KB)  
    Freely Available from IEEE
  • Using fuzzy numbers in linear programming

    Publication Year: 1997 , Page(s): 1016 - 1022
    Cited by:  Papers (10)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (216 KB)  

    Managers, decision makers, and experts dealing with optimization problems often have a lack of information on the exact values of some parameters used in their problems. To deal with this kind of imprecise data, fuzzy sets provide a powerful tool to model and solve these problems. This paper studies a linear programming (LP) problem in which all its elements are defined as fuzzy sets. Special cases of this general model are found and reproduced, and it is shown that they coincide with the particular problems proposed in the literature by different authors and distinct approaches. Solution methods are also provided. They show how it is possible to address and solve linear programming problems with data given in a qualitative form, instead of the usual quantitative and precise way View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A structural-description-based vision system for automatic object recognition

    Publication Year: 1997 , Page(s): 893 - 906
    Cited by:  Papers (11)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (312 KB)  

    This paper presents the results of the integration of a proposed part-segmentation-based vision system. The first stage of this system extracts the contour of the object using a hybrid first- and second-order differential edge detector. The object defined by its contour is then decomposed into its constituent parts using the part segmentation algorithm given by Bennamoun (1994). These parts are then isolated and modeled with 2D superquadrics. The parameters of the models are obtained by the minimization of a best-fit cost function. The object is then represented by its structural description which is a set of data structures whose predicates represent the constituent parts of the object and whose arguments represent the spatial relationship between these parts. This representation allows the recognition of objects independently of their positions, orientations, or sizes. It is also insensitive to objects with partially missing parts. In this paper, examples illustrating the acquired images of objects, the extraction of their contours, the isolation of the parts, and their fitting with 2D superquadrics are reported. The reconstruction of objects from their structural description is illustrated and improvements are suggested View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two theoretical and practical aspects of knitting technique: invariants and a new class of Petri net

    Publication Year: 1997 , Page(s): 962 - 977
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (628 KB)  

    We present two aspects of knitting technique, the structural properties (especially the P- and T-invariants), and the synchronized choice net (a new class of Petri net), that are of both theoretical importance and practical uses to the verification of structural correctness of a Petri net or to detect the structural problem of a Petri net. This work first proves that the ordinary Petri nets synthesized with knitting technique are structurally bounded, consistent, conservative and safe (when each home place holds one token) using the well-known linear algebra approach. It also provides a procedure for finding P- and T-invariants for Petri net synthesized using the knitting technique. We present examples for P-invariants and show that we can synthesize Petri nets more general than the “asymmetric-choice nets”. The algorithm for finding P-invariants of ordinary Petri nets is extended to find the P-invariants for a general Petri net synthesized with knitting technique and the arc-ratio rules. We present a new class of Petri nets, called synchronized choice nets, which are the largest set of Petri nets that can be covered by both T-components and P-components. An algorithm is proposed to find its T-components and the P-components, respectively. The complexity of this algorithm is also presented. The theory of synchronized choice nets has the potential to simplify that for free choice nets View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A genetic algorithm approach to Chinese handwriting normalization

    Publication Year: 1997 , Page(s): 999 - 1007
    Cited by:  Papers (3)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (248 KB)  

    Normalization can be used to absorb writing variations and distortions, simplify the recognition processing steps, and improve the recognition rate of a Chinese handwriting recognition system. In this study, a genetic algorithm approach to Chinese handwriting normalization is proposed. In the proposed approach, a generalized normalization transform is defined as a linearly weighted combination of several normalization transforms and then genetic algorithms (GA's) are used to determine the optimal set of weighting coefficients. Here the fitness function contains three proposed features representing the characteristics of Chinese characters, namely, stroke density variation (SDV), character area coverage (CAC), and centroid offset (CO). Experimental results show the feasibility of the proposed approach View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Visual learning of patterns and objects

    Publication Year: 1997 , Page(s): 907 - 917
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (264 KB)  

    We discuss automatic rule generation techniques for learning relational properties of 2D visual patterns and 3D objects from training samples where the observed feature values are continuous. In particular, we explore a conditional rule generation method that defines patterns (or objects) in terms of ordered lists of bounds on unary (pattern part) and binary (part relation) features. The technique, termed conditional rule generation, was developed to integrate relational structure representations of patterns and the generalization characteristics of evidenced-based systems. We show how this technique can be used for recognition of complex patterns and of objects in scenes. Further, we show the extent to which the learned rules can identify patterns and objects that have undergone nonrigid distortions View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Managing search complexity in linguistic geometry

    Publication Year: 1997 , Page(s): 978 - 998
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (616 KB)  

    This paper is a new step in the development of linguistic geometry. This formal theory is intended to discover and generalize the inner properties of human expert heuristics, which have been successful in a certain class of complex control systems, and apply them to different systems. In this paper, we investigate heuristics extracted in the form of hierarchical networks of planning paths of autonomous agents. Employing linguistic geometry tools the dynamic hierarchy of networks is represented as a hierarchy of formal attribute languages. The main ideas of this methodology are shown in the paper on two pilot examples of the solution of complex optimization problems. The first example is a problem of strategic planning for the air combat, in which concurrent actions of four vehicles are simulated as serial interleaving moves. The second example is a problem of strategic planning for the space comb of eight autonomous vehicles (with interleaving moves) that requires generation of the search tree of the depth 25 with the branching factor 30. This is beyond the capabilities of modern and conceivable future computers (employing conventional approaches). In both examples the linguistic geometry tools showed deep and highly selective searches in comparison with conventional search algorithms. For the first example a sketch of the proof of optimality of the solution is considered View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Task planning for a mobile robot in an indoor environment using object-oriented domain information

    Publication Year: 1997 , Page(s): 1007 - 1016
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (16 KB)  

    For a mobile robot to be practical, it needs to navigate in dynamically changing environments and manipulate objects in the environment with operating ease. The main challenges to satisfying these requirements in mobile robot research include the collection of robot environment information, storage and organization of this information, and fast task planning based on available information. Conventional approaches to these problems are far from satisfactory due to their requirement of high computation time. In this paper, we specifically address the problems of storage and organization of the environment information and fast task planning in the area of robotic research. We propose an special object-oriented data model (OODM) for information storage and management in order to solve the first problem. This model explicitly represents domain knowledge and abstracts a global perspective about the robot's dynamically changing environment. To solve the second problem, we introduce a fast task planning algorithm that fully uses domain knowledge related to robot applications and to the given environment. Our OODM based task planning method presents a general frame work and representation, into which domain specific information, domain decomposition methods and specific path planners can be tailored for different task planning problems. This method unifies and integrates the salient features from various areas such as database, artificial intelligence, and robot path planning, thus increasing the planning speed significantly View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Toward efficient multiple molecular sequence alignment: a system of genetic algorithm and dynamic programming

    Publication Year: 1997 , Page(s): 918 - 932
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (540 KB)  

    Multiple biomolecular sequence alignment is among the most important and challenging tasks in computational biology. It is characterized by great complexity in processing time. In this paper, a multiple-sequence alignment system is reported which combines the techniques of genetic algorithms and pairwise dynamic programming. Genetic algorithms are stochastic approaches for efficient and robust search. By converting biomolecular sequence alignment into a problem of searching for an optimal or a near-optimal point in a solution space, a genetic algorithm is used to find match blocks very efficiently. A pairwise dynamic programming is then applied to the subsequences between the match blocks. Combining the strengths of the two methods, the system achieves high efficiency and high alignment quality. In this paper, the system is described in detail. The system's performance is analyzed and the experimental results are presented View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic tracking line: feasible tracking region of a robot in conveyor systems

    Publication Year: 1997 , Page(s): 1022 - 1030
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (300 KB)  

    The concept of dynamic tracking line is proposed as the feasible tracking region for a robot in a robot-conveyor system, which takes the conveyor speed into consideration. This paper presents an effective method to find the dynamic tracking line in a robotic workcell. The maximum permissible line-speed which is a quantitative measure of the robot capability for conveyor tracking, is defined on the basis of the relation between the end effector speed and the bounds on the joint velocities, accelerations, and torques. This measure is derived in an analytic form using the parameterized dynamics and kinematics of the manipulator, and some of its properties are established mathematically. The problem of finding the dynamic tracking line is then formulated as a root-solving problem for a single-variable equation, and solved by the use of a simple numerical technique. Finally, numerical examples are presented to demonstrate the methodology and its applications in workspace specification View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-line tuning of fuzzy-neural network for adaptive control of nonlinear dynamical systems

    Publication Year: 1997 , Page(s): 1034 - 1043
    Cited by:  Papers (47)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (376 KB)  

    The adaptive fuzzy-neural controllers tuned online for a class of unknown nonlinear dynamical systems are proposed. To approximate the unknown nonlinear dynamical systems, the fuzzy-neural approximator is established. Furthermore, the control law and update law to tune on-line both the B-spline membership functions and the weighting factors of the adaptive fuzzy-neural controller are derived. Therefore, the control performance of the controller is improved. Several examples are simulated in order to confirm the effectiveness and applicability of the proposed methods in this paper View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new algorithm for Kohonen layer learning with application to power system stability analysis

    Publication Year: 1997 , Page(s): 1030 - 1034
    Cited by:  Papers (3)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (128 KB)  

    In certain classification problems, input patterns are not distributed in a clustering manner but distributed uniformly in an input space and there exist certain critical hyperplanes called decision boundaries. Since learning vector quantization (LVQ) classifies an input vector based on the nearest neighbor, the codebook vectors away from the decision boundaries are redundant. This paper presents an alternative algorithm called boundary search algorithm (BSA) for the purpose of solving this redundancy problem. The BSA finds a fixed number of codebook vectors near decision boundaries by selecting appropriate training vectors. It is found to be more efficient compared with LVQ and its validity is demonstrated with satisfaction in the transient stability analysis of a power system View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Task Planning For A Mobile Robot In An Indoor Environment Using Object-oriented Domain Information

    Publication Year: 1997 , Page(s): 1007
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (156 KB)  

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fuzzy Petri net-based programmable logic controller

    Publication Year: 1997 , Page(s): 952 - 961
    Cited by:  Papers (13)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (268 KB)  

    Programmable logic controllers (PLCs) are able to directly implement control sequences specified by means of standard languages such as Grafcet or formal models such as Petri nets. In the case of simple regulation problems between two steps it could be of great interest to introduce a notion of “fuzzy events” in order to denote a continuous evolution from one state to another. This could result from a linear interpolation between the commands attached to two control steps represented by two Petri net (PN) places. This paper is an attempt to develop fuzzy PN-based PLCs in a similar way as fuzzy controllers (regulators). Our approach is based on a combination of Petri nets with possibility theory (Petri nets with fuzzy markings) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fuzzy approximation via grid point sampling and singular value decomposition

    Publication Year: 1997 , Page(s): 933 - 951
    Cited by:  Papers (37)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (936 KB)  

    This paper introduces a new approach for fuzzy approximation of continuous function on a compact domain. The approach calls for sampling the function over a set of rectangular grid points and applying singular value decomposition to the sample matrix. The resulting quantities are then tailored to become rule consequences and membership functions via the conditions of sum normalization and non-negativeness. The inference paradigm of product-sum-gravity is apparent from the structure of the decomposition equation. All information are extracted directly from the function samples. The present approach yields a class of equivalent fuzzy approximator to a given function. A tight bounding technique to facilitate normal or close-to-normal membership functions is also formulated. The fuzzy output approximates the given function to within an error which is dependent on the sampling intervals and the singular values discarded from the approximation process. Trade-off between the number of membership functions and the desired approximation accuracy is also discussed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics focuses on cybernetics, including communication and control across humans, machines and organizations at the structural or neural level

 

This Transaction ceased production in 2012. The current retitled publication is IEEE Transactions on Cybernetics.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Dr. Eugene Santos, Jr.
Thayer School of Engineering
Dartmouth College