Haotian Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Haotian Chen has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Dequan Zeng
East China Jiaotong University
2 shared publications - Yiming Hu
School of Mechatronics and Vehicle Engineering, East China Jiaotong University, Nanchang 330013, China
2 shared publications - Yinquan Yu
School of Mechatronics and Vehicle Engineering, East China Jiaotong University, Nanchang, China
2 shared publications - Zhenwen Deng
Institute of Intelligent Vehicles, School of Automotive Studies, Tongji University, Shanghai 201804, China
2 shared publications - Bo Leng
Nanchang Automotive Institution of Intelligence & New Energy, Nanchang 330052, China
1 shared publication - Dongfu Xie
School of Mechatronics and Vehicle Engineering, East China Jiaotong University, Nanchang, 330013, China.
1 shared publication
Latest Publications
- Open Access
- 31 May 2023
- Published by MDPI AG in Micromachines
- Vol. 14 (6) , 1181
Microrobot Path Planning Based on the Multi-Module DWA Method in Crossing Dense Obstacle Scenario
A hard issue in the field of microrobots is path planning in complicated situations with dense obstacle distribution. Although the Dynamic Window Approach (DWA) is a good obstacle avoidance planning algorithm, it struggles to adapt to complex situations and has a low success rate when planning in densely populated obstacle locations. This paper suggests a multi-module enhanced DWA (MEDWA) obstacle avoidance planning algorithm to address the aforementioned issues. An obstacle-dense area judgment approach is initially presented by combining Mahalanobis distance, Frobenius norm, and covariance matrix on the basis of a multi-obstacle coverage model. Second, MEDWA is a hybrid of enhanced DWA (EDWA) algorithms in non-dense areas with a class of two-dimensional analytic vector field methods developed in dense areas. The vector field methods are used instead of the DWA algorithms with poor planning performance in dense areas, which greatly improves the passing ability of microrobots over dense obstacles. The core of EDWA is to extend the new navigation function by modifying the original evaluation function and dynamically adjusting the weights of the trajectory evaluation function in different modules using the improved immune algorithm (IIA), thus improving the adaptability of the algorithm to different scenarios and achieving trajectory optimization. Finally, two scenarios with different obstacle-dense area locations were constructed to test the proposed method 1000 times, and the performance of the algorithm was verified in terms of step number, trajectory length, heading angle deviation, and path deviation. The findings indicate that the method has a smaller planning deviation and that the length of the trajectory and the number of steps can both be reduced by about 15%. This improves the ability of the microrobot to pass through obstacle-dense areas while successfully preventing the phenomenon of microrobots going around or even colliding with obstacles outside of dense areas.
- 31 May 2023
- Published by MDPI AG in Micromachines
- Vol. 14 (6) , 1181
Open AccessMicrorobot Path Planning Based on the Multi-Module DWA Method in Crossing Dense Obstacle Scenario
A hard issue in the field of microrobots is path planning in complicated situations with dense obstacle distribution. Although the Dynamic Window Approach (DWA) is a good obstacle avoidance planning algorithm, it struggles to adapt to complex situations and has a low success rate when planning in densely populated obstacle locations. This paper suggests a multi-module enhanced DWA (MEDWA) obstacle avoidance planning algorithm to address the aforementioned issues. An obstacle-dense area judgment approach is initially presented by combining Mahalanobis distance, Frobenius norm, and covariance matrix on the basis of a multi-obstacle coverage model. Second, MEDWA is a hybrid of enhanced DWA (EDWA) algorithms in non-dense areas with a class of two-dimensional analytic vector field methods developed in dense areas. The vector field methods are used instead of the DWA algorithms with poor planning performance in dense areas, which greatly improves the passing ability of microrobots over dense obstacles. The core of EDWA is to extend the new navigation function by modifying the original evaluation function and dynamically adjusting the weights of the trajectory evaluation function in different modules using the improved immune algorithm (IIA), thus improving the adaptability of the algorithm to different scenarios and achieving trajectory optimization. Finally, two scenarios with different obstacle-dense area locations were constructed to test the proposed method 1000 times, and the performance of the algorithm was verified in terms of step number, trajectory length, heading angle deviation, and path deviation. The findings indicate that the method has a smaller planning deviation and that the length of the trajectory and the number of steps can both be reduced by about 15%. This improves the ability of the microrobot to pass through obstacle-dense areas while successfully preventing the phenomenon of microrobots going around or even colliding with obstacles outside of dense areas.
- Open Access
UGV Parking Planning Based on Swarm Optimization and Improved CBS in High-Density Scenarios for Innovative Urban Mobility
The existence of information silos between vehicles and parking lots means that Unmanned Ground Vehicles (UGVs) repeatedly drive to seek available parking slots, resulting in wasted resources, time consumption and traffic congestion, especially in high-density parking scenarios. To address this problem, a novel UGV parking planning method is proposed in this paper, which consists of cooperative path planning, conflict resolution strategy, and optimal parking slot allocation, intending to avoid ineffective parking seeking by vehicles and releasing urban traffic pressure. Firstly, the parking lot induction model was established and the IACA–IA was developed for optimal parking allocation. The IACA–IA was generated using the improved ant colony algorithm (IACA) and immunity algorithm. Compared with the first-come-first-served algorithm (FCFS), the normal ant colony algorithm (NACA), and the immunity algorithm (IA), the IACA–IA was able to allocate optimal slots at a lower cost and in less time in complex scenarios with multi-entrance parking lots. Secondly, an improved conflict-based search algorithm (ICBS) was designed to efficiently resolve the conflict of simultaneous path planning for UGVs. The dual-layer objective expansion strategy is the core of the ICBS, which takes the total path cost of UGVs in the extended constraint tree as the first layer objective, and the optimal driving characteristics of a single UGV as the second layer objective. Finally, three kinds of load-balancing and unbalanced parking scenarios were constructed to test the proposed method, and the performance of the algorithm was demonstrated from three aspects, including computation, quality and timeliness. The results show that the proposed method requires less computation, has higher path quality, and is less time-consuming in high-density scenarios, which provide a reasonable and efficient solution for innovative urban mobility.
Open AccessUGV Parking Planning Based on Swarm Optimization and Improved CBS in High-Density Scenarios for Innovative Urban Mobility
The existence of information silos between vehicles and parking lots means that Unmanned Ground Vehicles (UGVs) repeatedly drive to seek available parking slots, resulting in wasted resources, time consumption and traffic congestion, especially in high-density parking scenarios. To address this problem, a novel UGV parking planning method is proposed in this paper, which consists of cooperative path planning, conflict resolution strategy, and optimal parking slot allocation, intending to avoid ineffective parking seeking by vehicles and releasing urban traffic pressure. Firstly, the parking lot induction model was established and the IACA–IA was developed for optimal parking allocation. The IACA–IA was generated using the improved ant colony algorithm (IACA) and immunity algorithm. Compared with the first-come-first-served algorithm (FCFS), the normal ant colony algorithm (NACA), and the immunity algorithm (IA), the IACA–IA was able to allocate optimal slots at a lower cost and in less time in complex scenarios with multi-entrance parking lots. Secondly, an improved conflict-based search algorithm (ICBS) was designed to efficiently resolve the conflict of simultaneous path planning for UGVs. The dual-layer objective expansion strategy is the core of the ICBS, which takes the total path cost of UGVs in the extended constraint tree as the first layer objective, and the optimal driving characteristics of a single UGV as the second layer objective. Finally, three kinds of load-balancing and unbalanced parking scenarios were constructed to test the proposed method, and the performance of the algorithm was demonstrated from three aspects, including computation, quality and timeliness. The results show that the proposed method requires less computation, has higher path quality, and is less time-consuming in high-density scenarios, which provide a reasonable and efficient solution for innovative urban mobility.