Van Manh Tran
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Van Manh Tran has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Anh Phan Viet
Le Quy Don Technical University
1 shared publication - Cuong Nguyen Manh
Vietnam Academy of Science and Technology, Institute of Physics, Hanoi, Vietnam
1 shared publication - Gon-Woo Kim
Department of Intelligent Systems and Robotics, Chungbuk National University, Cheongju, South Korea
1 shared publication Hieu Pham Minh
Faculty of Information Technology, Le Quy Don Technical University, Hanoi, Vietnam
1 shared publicationHoang Do Van
Faculty of Information Technology, Le Quy Don Technical University, Hanoi, Vietnam
1 shared publication- Khanh Nguyen
Institute of Control Engineering of Machine Tools and Manufacturing Units, University of Stuttgart,Stuttgart,Germany,70174
1 shared publication
Latest Publications
- Open Access
- 16 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 101053-101065
Cooperative Deep Reinforcement Learning Policies for Autonomous Navigation in Complex Environments
A critical part of achieving robust and safe navigation for mobile robots is selecting the right navigation policies trained through simulation to operate effectively in real-world situations. Simulation-trained policies often struggle for mobile robot settings deployed in real-world navigation tasks, leading to policy degradation and increased risk manners. To address these challenges, a cooperative deep reinforcement learning policies (CDRL) framework is proposed, ensuring safe exploration and deployment in unknown complex environments. The CDRL framework cooperates with exploration and exploitation policies based on a policy-switching mechanism, which efficiently helps the robot escape the local optima. Instead of transferring a single navigation policy, CDRL leverages cooperative navigation policies with diverse reward functions, enabling them to adapt to unknown complex environments. The proposed technique is based on an exploration distributional soft actor critic (E-DSAC) and soft actor critic (SAC) algorithms, which enhances training efficiency. The deep reinforcement learning (deep RL) models in this framework are represented by a mobile service robot that reaches target positions without requiring a map presentation. Experimental results show that the proposed framework is proven to have safe and fast motions in terms of navigation time and success rates. The sim-to-real transfer process of mobile service robots can be found ( https://youtu.be/vIxRqXidKIM ).
- 16 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 101053-101065
Open AccessCooperative Deep Reinforcement Learning Policies for Autonomous Navigation in Complex Environments
A critical part of achieving robust and safe navigation for mobile robots is selecting the right navigation policies trained through simulation to operate effectively in real-world situations. Simulation-trained policies often struggle for mobile robot settings deployed in real-world navigation tasks, leading to policy degradation and increased risk manners. To address these challenges, a cooperative deep reinforcement learning policies (CDRL) framework is proposed, ensuring safe exploration and deployment in unknown complex environments. The CDRL framework cooperates with exploration and exploitation policies based on a policy-switching mechanism, which efficiently helps the robot escape the local optima. Instead of transferring a single navigation policy, CDRL leverages cooperative navigation policies with diverse reward functions, enabling them to adapt to unknown complex environments. The proposed technique is based on an exploration distributional soft actor critic (E-DSAC) and soft actor critic (SAC) algorithms, which enhances training efficiency. The deep reinforcement learning (deep RL) models in this framework are represented by a mobile service robot that reaches target positions without requiring a map presentation. Experimental results show that the proposed framework is proven to have safe and fast motions in terms of navigation time and success rates. The sim-to-real transfer process of mobile service robots can be found ( https://youtu.be/vIxRqXidKIM ).
- 18 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
A New Method for Forming Rideshare Groups
Nowadays, ridesharing has gained popularity as an alternative mode of transportation. It offers cost savings, convenience, environmental benefits, and social opportunities. This research aims at providing riders with the reliability of the route and the flexibility of the service. For this purpose, we mine the longest frequent movement from historical data. A novel algorithm for discovering rides hare groups based on the similarity of the users' longest frequent movements is proposed. In this way, the user does not have to search for a ride many times and does not have to wait too long as well because the group with a specific schedule and driver information can be excited and sent to the users in advance. The algorithm is evaluated based on synthetic datasets under different settings and compared with the existing ones. The experimental results of the proposed method is superior to the results of the previous algorithms in terms of execution time and the total travel distance.
- 18 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
A New Method for Forming Rideshare Groups
Nowadays, ridesharing has gained popularity as an alternative mode of transportation. It offers cost savings, convenience, environmental benefits, and social opportunities. This research aims at providing riders with the reliability of the route and the flexibility of the service. For this purpose, we mine the longest frequent movement from historical data. A novel algorithm for discovering rides hare groups based on the similarity of the users' longest frequent movements is proposed. In this way, the user does not have to search for a ride many times and does not have to wait too long as well because the group with a specific schedule and driver information can be excited and sent to the users in advance. The algorithm is evaluated based on synthetic datasets under different settings and compared with the existing ones. The experimental results of the proposed method is superior to the results of the previous algorithms in terms of execution time and the total travel distance.
- 19 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Linguistic-based Augmentation for Enhancing Vietnamese Sentiment Analysis
Identify customer’s opinions about products, services, and brands bring many benefits to e-commerce development. Capturing customer attitudes helps retailers adjust business decisions. Customers can select the suitable product and the good service by consulting social experiences. However, free-style texts of customer feedback like acronyms, slang words, incorrect grammar, and so on are challenging any machine learning model.
- 19 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Linguistic-based Augmentation for Enhancing Vietnamese Sentiment Analysis
Identify customer’s opinions about products, services, and brands bring many benefits to e-commerce development. Capturing customer attitudes helps retailers adjust business decisions. Customers can select the suitable product and the good service by consulting social experiences. However, free-style texts of customer feedback like acronyms, slang words, incorrect grammar, and so on are challenging any machine learning model.