Yu-Chi Liao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yu-Chi Liao has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Hee-Hyol Lee
Graduate School of Information, Production and Systems, Waseda University, Fukuoka, Japan
1 shared publication - Jiaheng Chen
Graduate School of Information, Production and Systems, Waseda University, Fukuoka, Japan
1 shared publication - Shin-Nyeong Heo
Samsung Heavy Industries Co., Ltd., Geoje-Si 53261, Republic of Korea
1 shared publication
Latest Publications
- Open Access
- 16 March 2022
- Published by Springer Nature in Intelligent Service Robotics
- Vol. 15 (3) , 289-306
Auto-splitting D* lite path planning for large disaster area
This research introduces a new path planning method for rescue robots in a dynamic and partially known area when the robots are performing tasks in a large area. The path planning of the rescue robots that move in the dynamic area is introduced to solve the issue of unnecessary areas, which are the disadvantages of the existing D*-based algorithms. This paper proposes a method to eliminate unnecessary expanded nodes of the dynamic and partially known environment by segmenting a map with an auto-clustering algorithm, which is able to achieve a faster execution time than conventional algorithms. Furthermore, to show the effectiveness of the proposed algorithms, an expected value of re-planned nodes in the dynamic and partially known area is introduced using a probability-based approach.
- 16 March 2022
- Published by Springer Nature in Intelligent Service Robotics
- Vol. 15 (3) , 289-306
Open AccessAuto-splitting D* lite path planning for large disaster area
This research introduces a new path planning method for rescue robots in a dynamic and partially known area when the robots are performing tasks in a large area. The path planning of the rescue robots that move in the dynamic area is introduced to solve the issue of unnecessary areas, which are the disadvantages of the existing D*-based algorithms. This paper proposes a method to eliminate unnecessary expanded nodes of the dynamic and partially known environment by segmenting a map with an auto-clustering algorithm, which is able to achieve a faster execution time than conventional algorithms. Furthermore, to show the effectiveness of the proposed algorithms, an expected value of re-planned nodes in the dynamic and partially known area is introduced using a probability-based approach.