Tomoya Kawabe

Mr. Tomoya Kawabe

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 January 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
TKTomoya Kawabe
Tomoya Kawabe
Tatsushi NishiTatsushi Nishi
Tatsushi Nishi
ZLZiang Liu
Ziang Liu
The use of multiple mobile robots has grown significantly over the past few years in logistics, manufacturing and public services. Conflict–free route planning is one of the major research challenges for such mobile robots. Optimization methods such as graph search algorithms are used extensively to solve route planning problems. Those methods can assure the quality of solutions, however, they are not flexible to deal with unexpected situations. In this article, we propose a flexible route planning method that combines the reinforcement learning algorithm and a graph search algorithm for conflict–free route planning problems for multiple robots. In the proposed method, Q–learning, a reinforcement algorithm, is applied to avoid collisions using off–line learning with a limited state space to reduce the total learning time. Each vehicle independently finds the shortest route using the A* algorithm, and Q–learning is used to avoid collisions. The effectiveness of the proposed method is examined by comparing it with conventional methods in terms of computation time and the quality of solutions. Computational results show that for dynamic transportation problems, the proposed method can generate the solutions with approximately 10% of the computation time compared to the conventional Q–learning approach. We found that the required computation time is linearly increased with respect to the number of vehicles and nodes in the problems.

7 December 2022
Verified
Conference Paper
Closed access
TKTomoya Kawabe
Tomoya Kawabe
ZLZiang Liu
Ziang Liu
Tatsushi NishiTatsushi Nishi
Tatsushi Nishi
MAMd Moktadir Alam
Md Moktadir Alam
TFTomofumi Fujiwara
Tomofumi Fujiwara
A multi-objective optimization algorithm is proposed in this paper for motion planning and layout design in robotic cellular manufacturing systems. The sequence-pair is used to represent the layout of a robotic cell, which can avoid the overlapping of modules. For each layout, the robot motion planning using Rapidly exploring Random Trees (RRT) is conducted to compute the total operation time. A non-dominated Sorting Genetic Algorithm II (NSGA-II) is used to minimize the layout area and operation time. The proposed method is applied to a 6-DOF (Degree of Freedom) robot manipulator, Niryo Ned. In the experiments, a Pareto set is obtained. The experimental results suggest the tradeoff relationship between the operation time and layout area. The findings show that the proposed method can efficiently solve the optimal motion planning and layout design problem in robotic cellular manufacturing systems.

25 March 2025 in Engineering Applications of Artificial Intelligence
Verified
Journal Article
Open access
TKTomoya Kawabe
Tomoya Kawabe
Tatsushi NishiTatsushi Nishi
Tatsushi Nishi
ZLZiang Liu
Ziang Liu
TFTomofumi Fujiwara
Tomofumi Fujiwara