Do Quoc Huy

Dr. Do Quoc Huy

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
7 February 2024 in Expert Systems with Applications
Verified
Journal Article
Closed access
TGTran Thi Cam Giang
Tran Thi Cam Giang
DLDao Tung Lam
Dao Tung Lam
HBHuynh Thi Thanh Binh
Huynh Thi Thanh Binh
DLDinh Thi Ha Ly
Dinh Thi Ha Ly
DHDo Quoc Huy
Do Quoc Huy

11 November 2024 in Machines
Verified
Journal Article
Open access
PDF file
HPHai Van Pham
Hai Van Pham
DHDo Quoc Huy
Do Quoc Huy
MQMinh Nguyen Quang
Minh Nguyen Quang
FAFarzin Asadi
Farzin Asadi
PMPhilip Moore
Philip Moore
Coverage path planning describes the process of finding an effective path robots can take to traverse a defined dynamic operating environment where there are static (fixed) and dynamic (mobile) obstacles that must be located and avoided in coverage path planning. However, most coverage path planning methods are limited in their ability to effectively manage the coordination of multiple robots operating in concert. In this paper, we propose a novel coverage path planning model (termed Multi-ST) which utilizes the spiral-spanning tree coverage algorithm with intelligent reasoning and knowledge-based methods to achieve optimal coverage, obstacle avoidance, and robot coordination. In experimental testing, we have evaluated the proposed model with a comparative analysis of alternative current approaches under the same conditions. The reported results show that the proposed model enables the avoidance of static and moving obstacles by multiple robots operating in concert in a dynamic operating environment. Moreover, the results demonstrate that the proposed model outperforms existing coverage path planning methods in terms of coverage quality, robustness, scalability, and efficiency. In this paper, the assumptions, limitations, and constraints applicable to this study are set out along with related challenges, open research questions, and proposed directions for future research. We posit that our proposed approach can provide an effective basis upon which multiple robots can operate in concert in a range of ‘real-world’ domains and systems where coverage path planning and the avoidance of static and dynamic obstacles encountered in completing tasks is a systemic requirement.

15 October 2025 in Intelligent Service Robotics
Verified
Journal Article
Closed access
PDF file
TGTran Thi Cam Giang
Tran Thi Cam Giang
HBHuynh Thi Thanh Binh
Huynh Thi Thanh Binh
HLHo Viet Duc Luong
Ho Viet Duc Luong
NHNguyen Huy Hoang
Nguyen Huy Hoang
DHDo Quoc Huy
Do Quoc Huy

7 December 2023
Verified
Conference Paper
Open access
GCGiang Tran Thi Cam
Giang Tran Thi Cam
DDDuc Manh Do
Duc Manh Do
DHDo Quoc Huy
Do Quoc Huy
HBHuynh Thi Thanh Binh
Huynh Thi Thanh Binh
TDThi Ha Ly Dinh
Thi Ha Ly Dinh
In our modern, ever-evolving, and intricately interconnected world, the task of planning optimal paths for mobile robots has emerged as a challenge. This challenge arises from our surroundings’ growing dynamism and complexity, characterized by the continual variation of obstacles and environmental conditions. This paper proposes a new approach called the Parallel Kinematic Rapidly Exploring Random Tree (PK-RRT) algorithm for mobile robot path planning in dynamic environments. Our PK-RRT algorithm incorporates kinematic constraints when the robot moves on the RRT tree to ensure that the paths generated are feasible and smooth. It also applies the multi-threading technique in which multiple threads work in parallel to speed up the path generation process and improve its convergence. We conducted a comprehensive performance comparison with two existing algorithms, namely Bidirectional Rapidly Exploring Random Tree (Bi-RRT) and Quadratic Rapidly Exploring Random Tree (Quad-RRT). The results show that our PK-RRT algorithm reduces the computation time by 30%, improves the computational efficiency by 40%, and increases the stability by 50% compared to the existing algorithms.

5 February 2025
Verified
Book Chapter
Closed access
PDF file
HMHieu Nguyen Minh
Hieu Nguyen Minh
HAHai Trinh An
Hai Trinh An
GCGiang Tran Thi Cam
Giang Tran Thi Cam
LHLy Dinh Thi Ha
Ly Dinh Thi Ha
DHDo Quoc Huy
Do Quoc Huy