Author
Listed:
- Wang, Qi
- Lei, Chao
- Chen, Xiqun (Michael)
Abstract
Intelligent transfer vehicles in container terminals operate in dense and dynamic traffic environments, where conflicts at intersections and handling lanes can cause arrival-time deviations and potential deadlocks. This study addresses the dynamic lane-level path planning problem by proposing a hybrid multi-agent reinforcement learning framework under a centralized training and decentralized execution paradigm. The framework uses a lane-time grid with semaphore-based control to model space-time occupancy and incorporates a task-driven conflict resolution mechanism that accounts for task type, remaining time, and load status, with the objective of minimizing the sum of deviations between actual and expected vehicle arrival times. To improve learning efficiency and solution feasibility, an A* search planner provides warm-start trajectories, while a graph attention encoder captures structured traffic states. We further introduce TaskNet, a learned arbitration module that dynamically determines vehicle priorities in contested situations based on vehicle states and historical rewards, thereby enabling rapid conflict resolution in dense traffic environments. Extensive experiments on a realistic terminal layout show that the proposed algorithm significantly reduces path conflicts and task delays relative to benchmark methods, while maintaining sub-second decision times suitable for real-time deployment. The results demonstrate the value of combining structure-aware learning and task-driven coordination for scalable, real-time intelligent transfer vehicle scheduling in complex container terminal environments.
Suggested Citation
Wang, Qi & Lei, Chao & Chen, Xiqun (Michael), 2026.
"Task-driven dynamic lane-level path planning for intelligent transfer vehicles in container terminals,"
Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 213(C).
Handle:
RePEc:eee:transe:v:213:y:2026:i:c:s1366554526003479
DOI: 10.1016/j.tre.2026.105008
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:213:y:2026:i:c:s1366554526003479. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.