Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Haruhisa Kurokawa

dblp:58/4807 · DBLP profile ↗
← Back
21ranked-venue papers
3as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 18 · 3 first-authorSystems, architecture and hardware · 16 · 2 first-authorDatabases, data management, data science and information retrieval · 2Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorTheory of computation · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Wireless networking · 100%
Artificial intelligence
3 papers
Robot manipulation · 52% Multi-agent systems · 31% Motion planning and robot control · 17%
Computer architecture, parallel and distributed computing, and storage systems
3 papers
Distributed systems · 90% Hardware reliability and fault tolerance · 10%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

Topics — the 11 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Wireless networking › scheduling
transmission scheduling
0.212013
Decentralized P2P Network Coordination with an Adaptive Transmission Cycle Decision mechanism and a simplified pulse-coupled oscillator · ICRA 2013
Wireless networking
wireless network protocols
0.212013
Decentralized P2P Network Coordination with an Adaptive Transmission Cycle Decision mechanism and a simplified pulse-coupled oscillator · ICRA 2013
Distributed systems
distributed coordination
0.122013
Decentralized P2P Network Coordination with an Adaptive Transmission Cycle Decision mechanism and a simplified pulse-coupled oscillator · ICRA 2013
Self-Assembling Machine · ICRA 1994
Graph algorithms and graph theory
graph coloring
0.012013
Decentralized P2P Network Coordination with an Adaptive Transmission Cycle Decision mechanism and a simplified pulse-coupled oscillator · ICRA 2013
Robotics › Robot manipulation
modular robot
0.012003
Automatic locomotion pattern generation for modular robots · ICRA 2003
Knowledge, reasoning and agents › Multi-agent systems
modular robotics
0.021998
A 3-D Self-Reconfigurable Structure · ICRA 1998
Self-Assembling Machine · ICRA 1994
Robotics › Robot manipulation › modular robot
self-reconfigurable robots
0.021998
A 3-D Self-Reconfigurable Structure · ICRA 1998
Self-Assembling Machine · ICRA 1994
Robotics › Motion planning and robot control › locomotion control
neural oscillator control
0.012003
Automatic locomotion pattern generation for modular robots · ICRA 2003
Knowledge, reasoning and agents › Multi-agent systems › swarm robotics
self-assembly
0.011994
Self-Assembling Machine · ICRA 1994
Hardware reliability and fault tolerance
self-healing
0.011998
A 3-D Self-Reconfigurable Structure · ICRA 1998
Distributed systems › distributed control
decentralized control
0.011994
Self-Assembling Machine · ICRA 1994

Methods — techniques the papers use, named apart from their topics

pulse-coupled oscillator · 0.5chromatic number · 0.5distributed control · 0.1local connection change · 0.0neural oscillator · 0.0evolutionary computation · 0.0diffusion-like process · 0.0
YearPublicationVenuePosition
2013 Decentralized P2P Network Coordination with an Adaptive Transmission Cycle Decision mechanism and a simplified pulse-coupled oscillator
abstract
This paper describes a P2P wireless network framework with numerous nodes that can communicate with their neighbors in a stable condition with no collisions of transmissions. Under the network convergence state, every node transmits periodically in order with a cycle shared in the network. To realize that situation, we apply a pulse-coupled oscillator technique to shift the timing of transmission of each node to avoid overlapping with neighboring nodes' transmissions. Additionally, we propose an algorithm to find the suboptimal transmission cycle, preferred small for faster communication, depending on the number of nodes and the network topology based on a class of chromatic number problem in graph theory. We developed a multi-thread simulation platform for multiple node communications to verify the algorithm. Results demonstrate its feasibility both with simulations and with real devices by implementing the method onto an omnidirectional infrared communication device and an RF long-distance communication device.
Akiya Kamimura, Kohji Tomita, Haruhisa Kurokawa
ICRA3
2009 High-step climbing by a crawler robot DIR-2 - realization of automatic climbing motion -
abstract
We introduce a unique shaped crawler robot aimed for high-step climbing that is considered the most necessary ability in urban search and rescue operations. The crawler robot is composed of two triangular-shaped crawler devices connected by a center shaft, a straight crawler device and a two-link mechanism connecting the shaft and the straight crawler. The robot is very compact and light weight compared to other rescue robots. It has eight D.O.F. in total, four of which are for crawlers and the others are for shifting the shape of the robot. We confirmed that the proposed robot can get over 36 cm high-step one-and-a-half times as high as its original height. We also implemented a height-independent climbing motion algorithm based on statics and geometrical analysis in climbing process. Various hardware experiments showed a capability of the developed robot and feasibility of the proposed climbing motion algorithm.
Akiya Kamimura, Haruhisa Kurokawa
IROS2
2009 On the reachability of a version of graph-rewriting system
Kohji Tomita, Haruhisa Kurokawa
Inf. Process. Lett.2
2007 Self-Description for Construction and Computation on Graph-Rewriting Automata
abstract
This article shows how self-description can be realized for construction and computation in a single framework of a variant of graph-rewriting systems called graph-rewriting automata. Graph-rewriting automata define symbol dynamics on graphs, in contrast to cellular automata on lattice space. Structural change is possible along with state transition. Self-replication based on a self-description is shown as an example of self-description for construction. This process is performed using a construction arm, which is realized as a subgraph, that executes a program described in the graph structure. In addition, a metanode structure is introduced to embed rule sets in the graph structure as self-description for computation. These are regarded as universal graph-rewriting automata that can serve as a model of systems that maintain themselves through replication and modification.
Kohji Tomita, Satoshi Murata, Haruhisa Kurokawa
Artif. Life3
2006 Docking Experiments of a Modular Robot by Visual Feedback
abstract
We have been developing a self-reconfigurable robot M-TRAN. In this paper, we focus on the docking of M-TRAN modules. In order to dock modules in separate configurations, we use a camera module, which is compatible to the M-TRAN system. Proposed docking is a combination of a simple visual feedback procedure and a special docking configuration to absorb positional errors. We verified reliability of the docking method by experiments
Satoshi Murata, Kiyoharu Kakomura, Haruhisa Kurokawa
IROS3
2004 Distributed adaptive locomotion by a modular robotic system, M-TRAN II
abstract
A modular robot has a distributed mechanical composition which can make various configurations and also make locomotion in a wide variety of configurations. Modular robots are thought to be useful in extreme or unknown environments by adaptively changing their shape and locomotion patterns. As for locomotion, two types can be used; one is whole-body fixed-configuration locomotion and the other is locomotion by self-reconfiguration. In this paper we deal with the former type of locomotion which is realized by coordinated joint actuation. So far, proposed control methods for whole-body locomotion by modular robots have been based on predefined locomotion sequences. However, locomotion based on predefined sequences cannot adapt to changing terrain conditions such as uphill, downhill, slippery and sticky grounds. To solve such problems, we propose a distributed control mechanism using a CPG controller which enables adaptive locomotion by modular robots. Besides the real-time CPG control we introduce a decentralized control mechanism for detecting the situation that the robot is stuck and initiating transformation to another shape for recovering the situation. The results of various hardware experiments by 4-legged structure prove the feasibility of the method for adaptive locomotion and transformation by our M-TRAN II modules.
Akiya Kamimura, Haruhisa Kurokawa, Eiichi Yoshida, Kohji Tomita, Shigeru Kokaji, Satoshi Murata
IROS2
2004 Planning behaviors of a modular robot: an approach applying a randomized planner to coherent structure
abstract
A method for behavior planning is presented for a modular robot that applies a randomized planner to coherent structure of the robot. To cope with difficulty in planning of many degrees of freedom (DOFs) of a modular robot, coherent structure is introduced in terms of control system and robot configuration. As the control system, a simple phase synchronization mechanism is introduced that can control the robot with many DOFs with reduced number of parameters. Together with symmetrical configuration, this control system generates various dynamic motions. In order to plan the behaviors of the modular robot determined by the parameters of the control system, we adopt a randomized planner called rapidly exploring random trees (RRTs). This can benefit from a number of advantages of RRT planner, including simple implementation, uniform search, and applicability to a dynamic system with differential constraints. By exploring parameter space of the coherent control system, behaviors including dynamic motions can be planned. We have applied the proposed planner to M-TRAN modular robot to demonstrate the effectiveness of the proposed method through preliminary simulation results.
Eiichi Yoshida, Haruhisa Kurokawa, Akiya Kamimura, Kohji Tomita, Shigeru Kokaji, Satoshi Murata
IROS2
2003 Automatic locomotion pattern generation for modular robots
abstract
Locomotion, one of the most basic robotic functions, has been widely studied for several types of robots. As for self-reconfigurable modular robots, there are two types of locomotion; one type is realized as a series of self-reconfiguration and the other is realized as a whole body motion such as walking and crawling. Even for the latter type of locomotion, designing control method is more difficult than ordinary robots. This is because the module configuration includes many degrees of freedom and there are a wide variety of possible configurations. We propose an offline method to generate a locomotion pattern automatically for a modular robot in an arbitrary module configuration, which utilizes a neural oscillator as a controller of the joint motor and evolutionary computation method for optimization of the neural oscillator network, which determines the performance of locomotion. We confirm the validity of the method by software simulation and hardware experiments.
Akiya Kamimura, Haruhisa Kurokawa, Eiichi Yoshida, Kohji Tomita, Satoshi Murata, Shigeru Kokaji
ICRA2
2003 M-TRAN II: metamorphosis from a four-legged walker to a caterpillar
abstract
We have been developing a self-reconfigurable modular robotic system (M-TRAN) which can make various 3-D configurations and motions. In the second prototype (M-TRAN II), various improvements are integrated in order to realize complicated reconfigurations and versatile whole body motions. Those are a reliable connection/detachment mechanism, on-board multi-computers, high speed inter-module communication system, low power consumption, precise motor control, etc. Programing environments are also integrated to design self-reconfiguration processes, to verify motions in dynamics simulation, and to realize distributed control on the hardware. Hardware design, developed software and experiments are presented in this paper.
Haruhisa Kurokawa, Akiya Kamimura, Eiichi Yoshida, Kohji Tomita, Shigeru Kokaji, Satoshi Murata
IROS1
2002 Self-reconfigurable modular robot (M-TRAN) and its motion design
abstract
We have developed a modular robotic system (M-TRAN), which can change its configuration by itself. By using many DOFs of mechanism and self-reconfiguration capability, it can realize several types of motion, and can make various configurations. We have made two models of the system (M-TRAN I & II). In M-TRAN II, various improvements are integrated such as onboard multi-computers, reliable inter-module communication system, low power consumption, precise motor control, etc. Its hardware design, basic experiments and examples of motion are presented in this paper.
Haruhisa Kurokawa, Akiya Kamimura, Eiichi Yoshida, Kohji Tomita, Satoshi Murata, Shigeru Kokaji
ICARCV1
2001 Self-reconfigurable modular robot - experiments on reconfiguration and locomotion
abstract
We have proposed a self-reconfigurable robotic module, which has a very simple structure. The system is capable of not only building a static structure, but also generating a dynamic robotic motion. We have also developed a simulator for the motion planning. In this paper, we present details of the mechanical and electrical designs of the developed module and its control system architecture. Experiments using ten modules demonstrate the robotic configuration change, crawling locomotion and three types of quadruped locomotion.
Akiya Kamimura, Satoshi Murata, Eiichi Yoshida, Haruhisa Kurokawa, Kohji Tomita, Shigeru Kokaji
IROS4
2001 A motion planning method for a self-reconfigurable modular robot
abstract
This paper addresses motion planning of a homogeneous modular robotic system. The modules have self-reconfiguration capability so that a group of the modules can construct a robotic structure. Motion planning for self-reconfiguration is a kind of computationally difficult problem because of many combinatorial possibilities of modular configuration and the restricted degrees of freedom of the module; only two rotation axes per module. We will show a motion planning method for a class of multimodule structures. It is based on global planning and local motion scheme selection that is effective to solve the complicated planning problem.
Eiichi Yoshida, Satoshi Murata, Akiya Kamimura, Kohji Tomita, Haruhisa Kurokawa, Shigeru Kokaji
IROS5
2001 Concept of self-reconfigurable modular robotic system
Satoshi Murata, Eiichi Yoshida, Haruhisa Kurokawa, Kohji Tomita, Shigeru Kokaji
Artif. Intell. Eng.3
2000 Hardware design of modular robotic system
abstract
In this paper we describe the hardware design of a novel self-reconfigurable robotic system. We have classified previous studies on self-reconfigurable robotic systems into "lattice type" composed of spatially symmetric modules and "string type" like snake robots. The proposed system has both the advantages of simple operation of self-reconfiguration of the former and motion generation ability of the latter. Its simple structure and reliable operation allows us to construct large 3D self-reconfigurable structure which functions as a robotic system such as a legged walking machine. We have examined its basic mechanical functions and verified its reliable operation of self-reconfiguration.
Satoshi Murata, Eiichi Yoshida, Kohji Tomita, Haruhisa Kurokawa, Akiya Kamimura, Shigeru Kokaji
IROS4
1999 Miniaturized self-reconfigurable system using shape memory alloy
abstract
Presents a miniaturized self-reconfigurable modular robotics system using shape memory alloy (SMA). The system is designed so that various shapes can be actively formed by a group of identical mechanical units. The unit realizes rotational motion by using an actuator mechanism composed of two SMA torsion coil springs which generate sufficient motion range and torque for reconfiguration. The fundamental functions of the system are tested by experiments. Applicability of the developed unit model to a 3-D self-reconfigurable system is also discussed.
Eiichi Yoshida, Shigeru Kokaji, Satoshi Murata, Haruhisa Kurokawa, Kohji Tomita
IROS4
1999 Self-assembly and self-repair method for a distributed mechanical system
abstract
We propose a self-assembly and self-repair method for a homogeneous distributed mechanical system. We focus on a category of distributed systems composed of numbers of identical units which can dynamically change connections among themselves. Each unit has an onboard microprocessor, and local communication between neighboring units is possible. We discuss a distributed method for a group of such units to metamorphose from an arbitrary configuration into a desired configuration through cooperation by the units. This process, called self-assembly, is realized by identical software on each unit with local inter-unit communication. An extension of self-assembly, self-repair, is also examined. In this process, an occasional cut-off of an arbitrary part of the system is assumed. When some part of the system detects damage, the whole system degenerates and reconstructs itself. Computer simulations show the feasibility of self-assembly and self-repair.
Kohji Tomita, Satoshi Murata, Haruhisa Kurokawa, Eiichi Yoshida, Shigeru Kokaji
IEEE Trans. Robotics Autom.3
1998 A 3-D Self-Reconfigurable Structure
abstract
A three-dimensional, self-reconfigurable structure is proposed. The structure is a fully distributed system composed of many identical 3-D units. Each unit has functions of changing local connection, information processing, and communication among neighborhood units. Groups of units cooperate to change their connection so that the shape of the whole solid structure transforms into an arbitrary shape. Also, the structure can repair itself by rejecting faulty units, replacing them with spare units. This kind of self-maintainability is essential to structure's longevity in hazardous or remote environments such as space or deep sea where human operators cannot approach. We have designed and built a prototype unit to examine the feasibility of the 3-D self-reconfigurable concept. The design of the unit, method of reconfiguration, hardware implementation, and results of preliminary experiments are shown. In the last part of the paper, distributed software for self-reconfiguration is discussed.
Satoshi Murata, Haruhisa Kurokawa, Eiichi Yoshida, Kohji Tomita, Shigeru Kokaji
ICRA2
1998 A 3-D self-reconfigurable structure and experiments
abstract
A three-dimensional self-reconfigurable structure made of identical units is proposed. Each unit has six arms on the surface of its base cube which can connect to neighboring units mechanically. By the connection, cubic lattice structure is formed. A unit can carry its neighbor unit from one node of the lattice to another by rotating its arm by 90 degrees. Repeating this movement, the structure can reconfigure itself to realize various 3D structures. General process of reconfiguration were proposed for this system. Four units were made and basic motions of self-reconfiguration were verified.
Haruhisa Kurokawa, Satoshi Murata, Eiichi Yoshida, Kohji Tomita, Shigeru Kokaji
IROS1
1998 A distributed reconfiguration method for 3D homogeneous structure
abstract
A distributed reconfiguration method is proposed for a 3D reconfigurable machine, composed of many identical mechanical units. The method aims to enable the machine to transform itself into desired structure from an arbitrary initial configuration. The proposed method is implemented in such a way that each unit has identical software, so that any unit can play any role in the system. It is also featured by a stochastic relaxation process, which allows the system to converge to a given target structure by searching for a proper unit motion over many degrees of freedom. Furthermore, the method is extended for the structure to reconfigure itself dynamically according to the environment. The effectiveness of the method is confirmed by computer simulations.
Eiichi Yoshida, Satoshi Murata, Haruhisa Kurokawa, Kohji Tomita, Shigeru Kokaji
IROS3
1997 Distributed formation control for a modular mechanical system
abstract
A distributed formation control method is proposed for a modular mechanical system. We have developed a totally decentralized system composed of many homogeneous mechanical units which are designed to change their connective configuration using only local information. The control method proposed in this paper enables the systems to re-organize themselves so that various configurations can be formed in a robust way. Computer simulations and experiments are carried out to show its effectiveness.
Eiichi Yoshida, Satoshi Murata, Kohji Tomita, Haruhisa Kurokawa, Shigeru Kokaji
IROS4
1994 Self-Assembling Machine
abstract
The design of a machine which is composed of homogeneous mechanical units is described. We show the design of both hardware and control software of the unit. Each unit can connect with other units and change the connection by itself. In spite of its simple mechanism, a set of these units realizes various mechanical functions. We developed the control software of the unit which realizes "self-assembly," one of the basic functions of this machine. A set of these units can form a given shape of the whole system by themselves. The units exchange information about local geometric relation by communication, and cooperate to form the whole shape through a diffusion-like process. There is no upper level controller to supervise these units, and the software of each unit is completely the same. Three actual units have been built to test the basic movements, and the function of self-assembly has been verified by computer simulation.>
Satoshi Murata, Haruhisa Kurokawa, Shigeru Kokaji
ICRA2