Takuro Kato
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Takuro Kato has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Florence Ho
National Institute of Informatics, Tokyo, Japan
1 shared publication - Keisuke Okumura
Artificial Intelligence Research Center, National Institute of Advanced Industrial Science and Technology (AIST), Tokyo, Japan
1 shared publication Mitsuharu Morisawa
1 shared publicationNaoya Yokomachi
TICO-AIST Cooperative Research Laboratory for Advanced Logistics, National Institute of Advanced Industrial Science and Technology (AIST), Ibaraki, Japan
1 shared publication- Nobuyuki Kita
Intelligent Systems Institute, National Institute of Advanced Industrial Science and Technology (AIST), Japan
1 shared publication Ryota Higa
Data Science Laboratories, NEC Corporation, Kanagawa, Japan
1 shared publication
Latest Publications
- Open Access
ICP-Based Pallet Tracking for Unloading on Inclined Surfaces by Autonomous Forklifts
This paper proposes a control method for autonomous forklifts to unload pallets on inclined surfaces, enabling the fork to be withdrawn without dragging the pallets. The proposed method applies the Iterative Closest Point (ICP) algorithm to point clouds measured from the upper region of the pallet and thereby tracks the relative position and attitude angle difference between the pallet and the fork during the unloading operation in real-time. According to the tracking result, the fork is aligned parallel to the target surface. After the fork is aligned, it is possible to complete the unloading process by withdrawing the fork along the tilt, preventing any dragging of the pallet. The effectiveness of the proposed method is verified through dynamic simulations and experiments using a real forklift that replicate unloading operations onto the inclined bed of a truck.
Open AccessICP-Based Pallet Tracking for Unloading on Inclined Surfaces by Autonomous Forklifts
This paper proposes a control method for autonomous forklifts to unload pallets on inclined surfaces, enabling the fork to be withdrawn without dragging the pallets. The proposed method applies the Iterative Closest Point (ICP) algorithm to point clouds measured from the upper region of the pallet and thereby tracks the relative position and attitude angle difference between the pallet and the fork during the unloading operation in real-time. According to the tracking result, the fork is aligned parallel to the target surface. After the fork is aligned, it is possible to complete the unloading process by withdrawing the fork along the tilt, preventing any dragging of the pallet. The effectiveness of the proposed method is verified through dynamic simulations and experiments using a real forklift that replicate unloading operations onto the inclined bed of a truck.
- Open Access
Approach and Fork Insertion to Target Pallet Based on Image Measurement Method
Previously, we proposed a navigation method based on image processing to move to the front of a pallet that can be detected in the field of view. We also proposed an image-processing method to estimate the inclination angle when the pallet is inclined at a pitch with respect to the running surface, such as a pallet loaded on a truck. In this study, we improved the robustness of the existing method so that the series of operations from approach to fork insertion can be realized stably without being affected by the environment. Furthermore, a series of operations from approach to fork insertion was realized by an automatic forklift (Autonomous Guided Forklift, AGF) in an indoor laboratory space simulating a warehouse.
Open AccessApproach and Fork Insertion to Target Pallet Based on Image Measurement Method
Previously, we proposed a navigation method based on image processing to move to the front of a pallet that can be detected in the field of view. We also proposed an image-processing method to estimate the inclination angle when the pallet is inclined at a pitch with respect to the running surface, such as a pallet loaded on a truck. In this study, we improved the robustness of the existing method so that the series of operations from approach to fork insertion can be realized stably without being affected by the environment. Furthermore, a series of operations from approach to fork insertion was realized by an automatic forklift (Autonomous Guided Forklift, AGF) in an indoor laboratory space simulating a warehouse.
- Open Access
- 11 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 10 (10) , 9742-9749
Congestion Mitigation Path Planning for Large-Scale Multi-Agent Navigation in Dense Environments
In high-density environments where numerous autonomous agents move simultaneously in a distributed manner, streamlining global flows to mitigate local congestion is crucial to maintain overall navigation efficiency. This paper introduces a novel path-planning problem, congestion mitigation path planning (CMPP), which embeds congestion directly into the cost function, defined by the usage of incoming edges along agents' paths. CMPP assigns a flow-based multiplicative penalty to each vertex of a sparse graph, which grows steeply where frequently-traversed paths intersect, capturing the intuition that congestion intensifies where many agents enter the same area from different directions. Minimizing the total cost yields a set of coarse-level, time-independent routes that autonomous agents can follow while applying their own local collision avoidance. We formulate the problem and develop two solvers: (i) an exact mixed-integer nonlinear programming solver for small instances, and (ii) a scalable two-layer search algorithm, A-CMTS, which quickly finds suboptimal solutions for large-scale instances and iteratively refines them toward the optimum. Empirical studies show that augmenting state-of-the-art collision-avoidance planners with CMPP significantly reduces local congestion and enhances system throughput in both discrete- and continuous-space scenarios. These results indicate that CMPP improves the performance of multi-agent systems in real-world applications such as logistics and autonomous-vehicle operations.
- 11 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 10 (10) , 9742-9749
Open AccessCongestion Mitigation Path Planning for Large-Scale Multi-Agent Navigation in Dense Environments
In high-density environments where numerous autonomous agents move simultaneously in a distributed manner, streamlining global flows to mitigate local congestion is crucial to maintain overall navigation efficiency. This paper introduces a novel path-planning problem, congestion mitigation path planning (CMPP), which embeds congestion directly into the cost function, defined by the usage of incoming edges along agents' paths. CMPP assigns a flow-based multiplicative penalty to each vertex of a sparse graph, which grows steeply where frequently-traversed paths intersect, capturing the intuition that congestion intensifies where many agents enter the same area from different directions. Minimizing the total cost yields a set of coarse-level, time-independent routes that autonomous agents can follow while applying their own local collision avoidance. We formulate the problem and develop two solvers: (i) an exact mixed-integer nonlinear programming solver for small instances, and (ii) a scalable two-layer search algorithm, A-CMTS, which quickly finds suboptimal solutions for large-scale instances and iteratively refines them toward the optimum. Empirical studies show that augmenting state-of-the-art collision-avoidance planners with CMPP significantly reduces local congestion and enhances system throughput in both discrete- and continuous-space scenarios. These results indicate that CMPP improves the performance of multi-agent systems in real-world applications such as logistics and autonomous-vehicle operations.
- 6 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 9 (11) , 10137-10144
A Hierarchical Approach for Joint Task Allocation and Path Planning
This letter addresses the joint task allocation and path planning problem, whereby a fleet of vehicles must be optimally assigned to service multiple given tasks while their planned paths must be collision-free. Such a problem composed of two tightly coupled optimization problems has a high complexity with the number of tasks and the number of vehicles, thus optimal solvers do not scale to large size instances. Therefore, we propose a novel method to solve this problem, HTAPPS, which introduces a hierarchical resolution framework. Our proposed approach decomposes a given instance into three levels of abstractions and associated amount of details that progressively filter the search space. This allows us to reduce the computational effort required when performing task allocation and multi-agent path planning jointly. We perform simulations on automated warehouse scenarios, and compare our approach to baseline solvers. The obtained results show that our proposed approach is able to solve large size instances within a limited time.
- 6 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 9 (11) , 10137-10144
A Hierarchical Approach for Joint Task Allocation and Path Planning
This letter addresses the joint task allocation and path planning problem, whereby a fleet of vehicles must be optimally assigned to service multiple given tasks while their planned paths must be collision-free. Such a problem composed of two tightly coupled optimization problems has a high complexity with the number of tasks and the number of vehicles, thus optimal solvers do not scale to large size instances. Therefore, we propose a novel method to solve this problem, HTAPPS, which introduces a hierarchical resolution framework. Our proposed approach decomposes a given instance into three levels of abstractions and associated amount of details that progressively filter the search space. This allows us to reduce the computational effort required when performing task allocation and multi-agent path planning jointly. We perform simulations on automated warehouse scenarios, and compare our approach to baseline solvers. The obtained results show that our proposed approach is able to solve large size instances within a limited time.