Ju-Jang Lee

A Hierarchical Algorithm for Indoor Mobile Robot Localization Using RFID Sensor Fusion

This paper addresses a radio-frequency identification (RFID)-based mobile robot localization which adopts RFID tags distributed in a space. Existing stand-alone RFID systems for mobile robot localization are hampered by many uncertainties. Therefore, we propose a novel algorithm that improves the localization by fusing an RFID system with an ultrasonic sensor system. The proposed system partially removes the uncertainties of RFID systems by using distance data obtained from ultrasonic sensors. We define a global position estimation (GPE) process using an RFID system and a local environment cognition (LEC) process using ultrasonic sensors. Then, a hierarchical localization algorithm is proposed to estimate the position of the mobile robot using both GPE and LEC. Finally, the utility of the proposed algorithm is demonstrated through experiments.

Energy-Efficient Coverage of Wireless Sensor Networks Using Ant Colony Optimization With Three Types of Pheromones

The Efficient-Energy Coverage (EEC) problem is an important issue when implementing Wireless Sensor Networks (WSNs) because of the need to limit energy use. In this paper, we propose a new approach to solving the EEC problem using a novel Ant Colony Optimization (ACO) algorithm. The proposed ACO algorithm has a unique characteristic that conventional ACO algorithms do not have. The proposed ACO algorithm (Three Pheromones ACO, TPACO) uses three types of pheromones to find the solution efficiently, whereas conventional ACO algorithms use only one type of pheromone. One of the three pheromones is the local pheromone, which helps an ant organize its coverage set with fewer sensors. The other two pheromones are global pheromones, one of which is used to optimize the number of required active sensors per Point of Interest (PoI), and the other is used to form a sensor set that has as many sensors as an ant has selected the number of active sensors by using the former pheromone. The TPACO algorithm has another advantage in that the two user parameters of ACO algorithms are not used. We also introduce some techniques that lead to a more realistic approach to solving the EEC problem. The first technique is to utilize the probabilistic sensor detection model. The second method is to use different kinds of sensors, i.e., heterogeneous sensors in continuous space, not a grid-based discrete space. Simulation results show the effectiveness of our algorithm over other algorithms, in terms of the whole network lifetime.

Adaptive simulated annealing genetic algorithm for system identification

Abstract Genetic algorithms and simulated annealing are leading methods of search and optimization. This paper proposes an efficient hybrid algorithm named ASAGA (Adaptive Simulated Annealing Genetic Algorithm). Genetic algorithms are global search techniques for optimization. However, they are poor at hill-climbing. Simulated annealing has the ability of probabilistic hill-climbing. Therefore, the two techniques are combined here to produce an adaptive algorithm that has the merits of both genetic algorithms and simulated annealing, by introducing a mutation operator like simulated annealing and an adaptive cooling schedule. The validity and the efficiency of the proposed algorithm are shown by an example involving system identification.

Robotic smart house to assist people with movement disabilities

This paper introduces a new robotic smart house, Intelligent Sweet Home, developed at KAIST in Korea, which is based on several robotic agents and aims at testing advanced concepts for independent living of the elderly and people with disabilities. The work focuses on technical solutions for human-friendly assistance in motion/mobility and advanced human-machine interfaces that provide simple control of all assistive robotic systems and home-installed appliances. The smart house concept includes an intelligent bed, intelligent wheelchair, and robotic hoist for effortless transfer of the user between bed and wheelchair. The design solutions comply with most of the users’ requirements and suggestions collected by a special questionnaire survey of people with disabilities. The smart house responds to the users commands as well as to the recognized intentions of the user. Various interfaces, based on hand gestures, voice, body movement, and posture, have been studied and tested. The paper describes the overall system structure and explains the design and functionality of some main system components.

Evolving Compact and Interpretable Takagi–Sugeno Fuzzy Models With a New Encoding Scheme

Developing Takagi-Sugeno fuzzy models by evolutionary algorithms mainly requires three factors: an encoding scheme, an evaluation method, and appropriate evolutionary operations. At the same time, these three factors should be designed so that they can consider three important aspects of fuzzy modeling: modeling accuracy, compactness, and interpretability. This paper proposes a new evolutionary algorithm that fulfills such requirements and solves fuzzy modeling problems. Two major ideas proposed in this paper lie in a new encoding scheme and a new fitness function, respectively. The proposed encoding scheme consists of three chromosomes, one of which uses unique chained possibilistic representation of rule structure. The proposed encoding scheme can achieve simultaneous optimization of parameters of antecedent membership functions and rule structures with the new fitness function developed in this paper. The proposed fitness function consists of five functions that consider three evaluation criteria in fuzzy modeling problems. The proposed fitness function guides evolutionary search direction so that the proposed algorithm can find more accurate compact fuzzy models with interpretable antecedent membership functions. Several evolutionary operators that are appropriate for the proposed encoding scheme are carefully designed. Simulation results on three modeling problems show that the proposed encoding scheme and the proposed fitness functions are effective in finding accurate, compact, and interpretable Takagi-Sugeno fuzzy models. From the simulation results, it is shown that the proposed algorithm can successfully find fuzzy models that approximate the given unknown function accurately with a compact number of fuzzy rules and membership functions. At the same time, the fuzzy models use interpretable antecedent membership functions, which are helpful in understanding the underlying behavior of the obtained fuzzy models

Adaptive control for uncertain nonlinear systems based on multiple neural networks

A new adaptive multiple neural network controller (AMNNC) with a supervisory controller for a class of uncertain nonlinear dynamic systems was developed in this paper. The AMNNC is a kind of adaptive feedback linearizing controller where nonlinearity terms are approximated with multiple neural networks. The weighted sum of the multiple neural networks was used to approximate system nonlinearity for the given task. Each neural network represents the system dynamics for each task. For a job where some tasks are repeated but information on the load is not defined and unknown or varying, the proposed controller is effective because of its capability to memorize control skill for each task with each neural network. For a new task, most similar existing control skills may be used as a starting point of adaptation. With the help of a supervisory controller, the resulting closed-loop system is globally stable in the sense that all signals involved are uniformly bounded. Simulation results on a cartpole system for the changing mass of the pole were illustrated to show the effectiveness of the proposed control scheme for the comparison with the conventional adaptive neural network controller (ANNC).

Designing a robust adaptive dynamic controller for nonholonomic mobile robots under modeling uncertainty and disturbances

Abstract The main stream of researches on the mobile robot is planning motions of the mobile robot under nonholonomic constraints. Much has been written about the problem of motion planning under nonholonomic constraints using only a kinematic model of a mobile robot. Those methods, however, assume that there is some kind of a dynamic controller that can produce perfectly the same velocity that is necessary for the kinematic controller. Also there is little literature on the robustness of the controller when there are uncertainties or external disturbances in the dynamical model of a mobile robot. In this paper, we proposed a robust adaptive controller that can achieve perfect velocity tracking while considering not only a kinematic model but also a dynamic model of the mobile robot. The proposed controller can overcome uncertainties and external disturbances by robust adaptive technique. The stability of the dynamic system will be shown through the Lyapunov method.

Adaptive neurofuzzy controller to regulate UTSG water level in nuclear power plants

A data-driven adaptive neurofuzzy controller is presented for the water-level control of U-tube steam generators in nuclear power plants. This neurofuzzy controller is capable of learning the control action principles from the data obtained using other methods of automatic or manual control. There are four inputs in the neurofuzzy system, yet only eighty fuzzy rules involved. Therefore, the fuzzy system is versatile and moderately compact. The versatility is due to the higher input space dimension that helps to learn more control principles. The compactness is due to the number of rules being not too many. A 10-h evaluation trial of the trained fuzzy controller demonstrated its capability in regulating the water level under random disturbances and reference level changes.

Chaotic local search algorithm

The steepest descent search algorithm is modified in conjunction withchaos to solve the optimization problem of an unstructured search space. The problem is that given only the gradient information of the quality function at the present configuration,X(t), we must find the value of a configuration vector that minimizes the quality function. The proposed algorithm starts basically from the steepest descent search technique but at the prescribed points, i.e., local minimum points, the chaotic jump is performed by the dynamics of a chaotic neuron. Chaotic motions are mainly caused because the Gaussian function has a hysteresis as a refractoriness. An adaptation mechanism to adjust the size of the chaotic jump is also given. In order to enhance the probability of finding the global minimum, a parallel search strategy is developed. The validity of the proposed method is verified in simulation examples of the function minimization problem and the motion planning problem of a mobile robot.

Ant-Colony-Based Scheduling Algorithm for Energy-Efficient Coverage of WSN

Sensors in most wireless sensor networks (WSNs) work with batteries as their energy source, it is usually infeasible to recharge or replace batteries when they discharge. Thus, solving the efficient-energy coverage (EEC) problem is an important issue for a WSN. Therefore, it is necessary to schedule the activities of the devices in a WSN to save the networks limited energy and prolong its lifetime. In this paper, we propose an ant-colony-based acheduling algorithm (ACB-SA) to solve the EEC problem. Our algorithm is a simplified version of the conventional ant colony optimization algorithm, optimized for solving the EEC problem. We also use the probability sensor detection model and apply our proposed algorithm to a heterogeneous sensor set, which represents a more realistic approach to solving the EEC problem. Simulation results are performed to verify the effectiveness of the ACB-SA for solving the EEC problem in comparison with other algorithms.