Yuichiro Toda

Bacterial memetic algorithm for offline path planning of mobile robots

The goal of the path planning problem is to determine an optimal collision-free path between a start and a target point for a mobile robot in an environment surrounded by obstacles. This problem belongs to the group of combinatorial optimization problems which are approached by modern optimization techniques such as evolutionary algorithms. In this paper the bacterial memetic algorithm is proposed for path planning of a mobile robot. The objective is to minimize the path length and the number of turns without colliding with an obstacle. The representation used in the paper fits well to the algorithm. Memetic algorithms combine evolutionary algorithms with local search heuristics in order to speed up the evolutionary process. The bacterial memetic algorithm applies the bacterial operators instead of the genetic algorithm’s crossover and mutation operator. One advantage of these operators is that they easily can handle individuals with different length. The method is able to generate a collision-free path for the robot even in complicated search spaces. The proposed algorithm is tested in real environment.

Multimodal Communication for Human-Friendly Robot Partners in Informationally Structured Space

This paper proposes a multimodal communication method for human-friendly robot partners based on various types of sensors. First, we explain informationally structured space to extend the cognitive capabilities of robot partners based on environmental systems. Next, we discuss the suitable measurement range for recognition technologies of touch interface, voice recognition, human detection, gesture recognition, and others. Based on the suitable measurement ranges, we propose an integration method to estimate human behaviors based on the human detection using color image and 3-D distance information, and gesture recognition by the multilayered spiking neural network using the time series of human-hand positions. Furthermore, we propose a conversation system to realize the multimodal communication with a person. Finally, we show several experimental results of the proposed method, and discuss the future direction of this research.

Self-Localization Based on Multiresolution Map for Remote Control of Multiple Mobile Robots

This paper proposes a localization method using multiresolution maps for the navigation of multiple mobile robots based on formation behaviors. The remote control of multiple mobile robots is one the most important tasks in robotics to realize distributed remote monitoring in unknown and/or dynamic environments. However, it is very difficult for a human operator to control multiple mobile robots separately at the same time. Therefore, autonomous formation behaviors of multiple robots are required to reduce mental and physical loads of the human operator. If each mobile robot can estimate the self-position or relative position in a group, it is easier for multiple mobile robots to realize formation behaviors. First, we propose a method of simultaneous localization and mapping based on a grid approach. Next, we explain how to share the build map among multiple mobile robots, and propose a self-localization method based on multiresolution maps. Furthermore, we explain the formation behaviors of multiple mobile robots. Finally, we show several experimental results, and discuss the effectiveness of the proposed method.

Multi-channel Bayesian Adaptive Resonance Associate Memory for on-line topological map building

Graphical abstractDisplay Omitted HighlightsMBARAM enables topological map building with little or no human intervention.Does not require high-level cognitive and prior knowledge to function in a natural environment.Multiple sensory sources are processes simultaneously crucial for real-world robot navigation.Results show capability of generating topological map online used for localization. In this paper, a new network is proposed for automated recognition and classification of the environment information into regions, or nodes. Information is utilized in learning the topological map of an environment. The architecture is based upon a multi-channel Adaptive Resonance Associative Memory (ARAM) that comprises of two layers, input and memory. The input layer is formed using the Multiple Bayesian Adaptive Resonance Theory, which collects sensory data and incrementally clusters the obtained information into a set of nodes. In the memory layer, the clustered information is used as a topological map, where nodes are connected with edges. Nodes in the topological map represent regions of the environment and stores the robot location, while edges connect nodes and stores the robot orientation or direction. The proposed method, a Multi-channel Bayesian Adaptive Resonance Associative Memory (MBARAM) is validated using a number of benchmark datasets. Experimental results indicate that MBARAM is capable of generating topological map online and the map can be used for localization.

Adaptive formation behaviors of multi-robot for cooperative exploration

This paper proposes a method for constituting the formation of a multi-robot system according to dynamically changing environments. First, we apply a method of multi-objective behavior coordination for integrating behavior outputs from the fuzzy control for collision avoidance and target tracing. Second, we apply a spring model to calculate the temporary target position of each robot for the formation behavior. Third, we discuss multi-robot behaviors based on the concept of coupling. The tight coupling is realized by the spring model while the loose coupling is realized by the individual decision making based on connection and disconnection with other robots. Furthermore, the proposed method is applied to the exploration in unknown environments. Finally, we discuss the effectiveness of the proposed method through several simulation results.

Intelligent planning based on multi-resolution map for simultaneous localization and mapping

Simultaneous localization and mapping (SLAM) is one of important topics in robotics. However, we must consider various intelligent behaviors in SLAM, e.g., the exploration of unknown areas and effective path planning of mobile robots. To realize these intelligent behaviors, we use a multi-resolution map. The multi-resolution map can be updated by the operators suitable to a specific aim. The first aim is to represent the occupied or empty cells in the built map. The next aim is to represent the unknown areas in the built map. These are used for the intelligent planning. The intelligent planning is composed of preplanning, online planning, and adaptive planning. These planning methods are used according to the state of a built map. The experimental results show the effectiveness of the proposed method.

Path planning for mobile robots by bacterial memetic algorithm

The goal of the path planning problem is to determine an optimal collision-free path between a start and a target point for a mobile robot in an environment surrounded by obstacles. This problem belongs to the group of hard optimization problems which can be approached by modern optimization techniques such as evolutionary algorithms. In this paper the bacterial memetic algorithm is proposed for path planning of a mobile robot. The representation used in the paper fits well to the algorithm. Memetic algorithms combine evolutionary algorithms with local search heuristics in order to speed up the evolutionary process. The bacterial memetic algorithm applies the bacterial operators instead of the genetic algorithms crossover and mutation operator. One advantage of these operators is that they easily can handle individuals with different length. The proposed algorithm is tested in real environment.

Evolutionary computation for intelligent self-localization in multiple mobile robots based on SLAM

The localization is one of the most important capabilities for mobile robots. However, other robots can be considered as unknown objects when a mobile robot performs localization, because other robots can enter the sensing range of a mobile robot. Therefore, we propose a method of intelligent self-localization using evolutionary computation for multiple mobile robots based on simultaneous localization and mapping (SLAM). First, we explain the method of SLAM using occupancy grid mapping by a single mobile robot. Next, we propose an intelligent self-localization method using multi-resolution map and evolutionary computation based on relative position of other robots in the sensing range. The experimental results show the effectiveness of the proposed method.

Computational intelligence for human-friendly robot partners based on multi-modal communication

This paper discusses the multi-modal communication for robot partners based on computational intelligence in informationally structured space. First, we explain recognition methods of touch interface, voice recognition, human detection, gesture recognition used in the multi-modal communication. Furthermore, we propose a conversation system to realize the multi-modal communication with a person. Finally, we show several experimental results of the proposed method, and discuss the future direction on this research.

Bacterial memetic algorithm for simultaneous optimization of path planning and flow shop scheduling problems

The paper deals with simultaneous optimization of path planning of mobile robots and flow shop scheduling problem. The goal of the path planning problem is to determine an optimal collision-free path between a start and a target point for a mobile robot in an environment surrounded by obstacles. The objective is to minimize the path length without colliding with an obstacle. On the other hand, shop scheduling problems deal with processing a given set of jobs on a given number of machines. Each operation has an associated machine on which it has to be processed for a given length of time. The problem is to minimize the overall time demand of the whole process. In this paper, we deal with two robots carrying items between the machines. Bacterial memetic algorithm is proposed for solving this combined problem. The algorithm is verified by experimental simulations and compared to classical techniques.