Duc Manh Do

Duc Manh Do

Auto-generated profile, based on publicly available information

Duc Manh Do

Center for Environmental Intelligence (CEI), VinUniversity, Hanoi, Vietnam

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
12 January 2026 in IEEE Transactions on Smart Grid
Verified
Journal Article
Open access
DDDuc Manh Do
Duc Manh Do
TDTruong Do
Truong Do
PNPhi Long Nguyen
Phi Long Nguyen
The rapid proliferation of electric vehicles (EVs) is placing unprecedented pressure on fixed charging infrastructure, particularly in regions with constrained power grids. Mobile charging robots have emerged as a versatile solution, offering scalable deployment and the ability to integrate renewable energy sources dynamically. This paper proposes a novel Auction-based Deep Reinforcement Learning (AD-DRL) framework for the efficient and sustainable coordination of mobile charging robots. The framework synergizes DRL for long term strategic policy optimization with an auction based mechanism for robust, real time task allocation. To address the complexities of robot coordination, we introduce Parameterized Action Q-Learning to manage hybrid action spaces and Reward Neural Networks to balance dynamic multi objective trade offs, supported by a Reverse Validation mechanism to ensure assignment feasibility. Extensive simulations demonstrate that the proposed framework significantly outperforms state-of-the-art baselines, including PPO, DDPG, and metaheuristic approaches. Specifically, our method improves the number of EVs served by 28.5%, increases total energy delivery by 46%, and reduces the average charging cost per EV by 11.1%. These results underscore the potential of the AD-DRL framework as a high performance solution for smart, sustainable, and cost effective EV charging operations in modern urban environments.

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.