24 May 2023 in IEEE Transactions on Intelligent Transportation Systems
Autonomous vehicle (AV) is expected to reshape the future transportation system, and its decision-making is one of the most critical modules. Many current decision-making modules are designed scenario-by-scenario and thus are not capable of meeting high-level AV requirements for lack of scalability to cope with the diversity of drivers’ demands and the infinity of traffic elements. This paper surveys the decision-making design inspired by driver intelligence and environment reasoning with better scalability for future high-level AVs. It involves three aspects: human factors in driving, environment reasoning, and detailed decision methods. The current state of the art of these three sections is surveyed in this paper. The characteristics of distinguished drivers, their decision mechanism, and the factors influencing decision-making are reviewed first to learn from excellent drivers. Environment reasoning is introduced following as a three-layer structure consisting of restriction, interaction, and attention. The optimization-based decision-making algorithms are then reviewed from the aspect of optimization targets, frameworks, applied scenarios, and limitations. Inspired by the existing research on driver intelligence and environment reasoning, a promising decision-making framework is also introduced for high-level AV design.
2 September 2025 in IEEE Robotics and Automation Letters
The Collaborative Task Sequencing and Multi-Agent Path Finding (CTS-MAPF) problem involves planning collision-free paths for multiple agents while determining the sequence of intermediate tasks. This problem is particularly challenging due to its combinatorial complexity, as it combines both task sequencing and pathfinding. This letter introduces CTS-PIBT, a novel and efficient algorithm designed to address the CTS-MAPF problem. CTS-PIBT adopts a hierarchical framework with three key components: task sequencing, solution finding following the sequence, and a low-level search using an extended version of PIBT. This framework effectively leverages the advantages of the configuration-based approach, enabling the rapid generation of feasible solutions within a short period. To further enhance performance, we incorporate an anytime refinement mechanism and a quick task sequencing technique (called greedy insertion with 2-opt) to improve solution quality and solving efficiency. Extensive simulations demonstrate that CTS-PIBT significantly outperforms existing methods in success rate and runtime, particularly in large-scale and complex scenarios. Furthermore, physical robot experiments validate its practical applicability in real-world environments.
1 July 2026 in IEEE Robotics and Automation Letters
11 December 2025 in IEEE Robotics and Automation Letters
Multi-depot multi-agent collaborative coverage is a representative problem in swarm intelligence, with broad applications in real-world scenarios. In this problem, multiple agents are initially located at different depots, which differs from the traditional problem setting, and are required to collaboratively cover a given region represented by a structured road network. The objective is to minimize the longest individual route among all agents. This problem is closely related to the $k$-Chinese Postman Problem ($k$-CPP), but is more complex due to the different depot constraint. This letter proposes a novel centralized algorithm, Cycle Clustering (CC), to solve this problem efficiently. The proposed method first transforms the original graph into an Eulerian graph, and then partitions the Eulerian graph into multiple small cycles, which are subsequently clustered and assigned to different agents. This design significantly reduces unnecessary route overhead. The algorithm’s time complexity and completeness are theoretically analyzed. Experimental results demonstrate that the proposed algorithm performs better than existing methods, reducing the average gap to the theoretical lower bound from 29.10% to 10.29%.