Doan Thanh Xuan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Doan Thanh Xuan has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
Vu Toan Thang
Hanoi University of Science and Technology
3 shared publications- Thanh-Hung Nguyen
School of Mechanical Engineering, Hanoi University of Science and Technology, Hanoi 100000, Vietnam
2 shared publications - Vu Toan Thang
School of Mechanical Engineering, Hanoi University of Science and Technology, Hanoi 100000, Vietnam
2 shared publications Han Quang Vu Ngo
Hanoi University of Science and Technology
1 shared publicationLe Giang Nam
Hanoi University of Science and Technology
1 shared publicationNguyen Huu Long
Hanoi University of Science and Technology
1 shared publication
Latest Publications
- Open Access
- 7 October 2025
- Published by MDPI AG in Automation
- Vol. 6 (4) , 52
A Comprehensive Review of Improved A* Path Planning Algorithms and Their Hybrid Integrations
The A* algorithm is a cornerstone in mobile robot navigation. However, the traditional A* suffers from key limitations such as poor path smoothness, lack of adaptability to dynamic environments, and high computational costs in large-scale maps. This review presents a comprehensive analysis of 20 recent studies (2020–2025) on improved A* variants and their hybrid integrations with complementary algorithms. The improvements are categorized into two core strategies: (i) geometric and structural optimization, heuristic weighting and adaptive search schemes in A* algorithm, and (ii) hybrid models combining A* with local planners such as Dynamic Window Approach (DWA), Artificial Potential Field (APF), and Particle Swarm Optimization (PSO). For each group, the mathematical formulations of evaluation functions, smoothing techniques, and constraint handling mechanisms are detailed. Notably, hybrid frameworks demonstrate improved robustness in dynamic or partially known environments by leveraging A* for global optimality and local planners for real-time adaptability. Case studies with simulated grid maps and benchmark scenarios show that even marginal improvements in path length can coincide with substantial gains in safety and directional stability. This review not only synthesizes the state of the art in A*-based planning but also outlines design principles for building intelligent, adaptive, and computationally efficient navigation systems.
- 7 October 2025
- Published by MDPI AG in Automation
- Vol. 6 (4) , 52
Open AccessA Comprehensive Review of Improved A* Path Planning Algorithms and Their Hybrid Integrations
The A* algorithm is a cornerstone in mobile robot navigation. However, the traditional A* suffers from key limitations such as poor path smoothness, lack of adaptability to dynamic environments, and high computational costs in large-scale maps. This review presents a comprehensive analysis of 20 recent studies (2020–2025) on improved A* variants and their hybrid integrations with complementary algorithms. The improvements are categorized into two core strategies: (i) geometric and structural optimization, heuristic weighting and adaptive search schemes in A* algorithm, and (ii) hybrid models combining A* with local planners such as Dynamic Window Approach (DWA), Artificial Potential Field (APF), and Particle Swarm Optimization (PSO). For each group, the mathematical formulations of evaluation functions, smoothing techniques, and constraint handling mechanisms are detailed. Notably, hybrid frameworks demonstrate improved robustness in dynamic or partially known environments by leveraging A* for global optimality and local planners for real-time adaptability. Case studies with simulated grid maps and benchmark scenarios show that even marginal improvements in path length can coincide with substantial gains in safety and directional stability. This review not only synthesizes the state of the art in A*-based planning but also outlines design principles for building intelligent, adaptive, and computationally efficient navigation systems.
- 3 August 2025
- Published by Springer Nature
- p. 377-384
Utilizing a Multi-adaptive Genetic Algorithm to Enhance Worker Ergonomics in Assembly Line Operations
- 3 August 2025
- Published by Springer Nature
- p. 377-384
Utilizing a Multi-adaptive Genetic Algorithm to Enhance Worker Ergonomics in Assembly Line Operations
- 5 June 2025
- Published by Springer Nature
- p. 123-132
Optimizing the Path Planning by the Improved A* Algorithm
- 5 June 2025
- Published by Springer Nature
- p. 123-132
Optimizing the Path Planning by the Improved A* Algorithm
- Open Access
- 27 March 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (7) , 4229
Applying Digital Twin and Multi-Adaptive Genetic Algorithms in Human–Robot Cooperative Assembly Optimization
In this study, we utilized digital twin technology in combination with genetic algorithms to optimize human–robot cooperation in a miniature light bulb assembly production line. First, the digital twin was used to find the robot’s motion trajectory; a digital replica of the assembly system and human was created by combining sensors that track the position and activity characteristics of the human in the workspace, which helped to prevent human–robot conflicts. Then, a multi-adaptive genetic algorithm was applied to calculate optimal ergonomics and create a worker’s movement schedule. To ensure continuous operation and no shortage of materials, the worker must observe and move to the input conveyor and material pallets to supply materials to the system. It aimed to provide more input materials for the assembly line while allowing the worker’s task to take place in parallel with the robotic assembly operation. The algorithm was designed to reduce the number of moves required to obtain materials and to ensure that the robot always had enough materials to assemble along the defined trajectory, thus, saving labor and optimizing the manufacturing process. The combination of a digital twin and multi-adaptive genetic algorithm optimized the robot’s movement path and the number of movements performed by the human operator in parallel.
- 27 March 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (7) , 4229
Open AccessApplying Digital Twin and Multi-Adaptive Genetic Algorithms in Human–Robot Cooperative Assembly Optimization
In this study, we utilized digital twin technology in combination with genetic algorithms to optimize human–robot cooperation in a miniature light bulb assembly production line. First, the digital twin was used to find the robot’s motion trajectory; a digital replica of the assembly system and human was created by combining sensors that track the position and activity characteristics of the human in the workspace, which helped to prevent human–robot conflicts. Then, a multi-adaptive genetic algorithm was applied to calculate optimal ergonomics and create a worker’s movement schedule. To ensure continuous operation and no shortage of materials, the worker must observe and move to the input conveyor and material pallets to supply materials to the system. It aimed to provide more input materials for the assembly line while allowing the worker’s task to take place in parallel with the robotic assembly operation. The algorithm was designed to reduce the number of moves required to obtain materials and to ensure that the robot always had enough materials to assemble along the defined trajectory, thus, saving labor and optimizing the manufacturing process. The combination of a digital twin and multi-adaptive genetic algorithm optimized the robot’s movement path and the number of movements performed by the human operator in parallel.
- 1 June 2022
- Published by Springer Nature
- p. 83-90
A-star Algorithm for Robot Path Planning Based on Digital Twin
- 1 June 2022
- Published by Springer Nature
- p. 83-90
A-star Algorithm for Robot Path Planning Based on Digital Twin