Zhiqiang Jian
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Zhiqiang Jian has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Nanning Zheng
Institute of Artificial Intelligence and Robotics, Xi'an Jiaotong University, Xi'an, China
7 shared publications - Songyi Zhang
Institute of Artificial Intelligence and Robotics, Xian Jiaotong University, Xian, China
6 shared publications - Shitao Chen
National Key Laboratory of Human-Machine Hybrid Augmented Intelligence, National Engineering Research Center for Visual Information and Applications, and Institute of Artificial Intelligence and Robotics, Xian Jiaotong University, Xian, China
4 shared publications - Masayoshi Tomizuka
UC Berkeley
3 shared publications - Wei Zhan
University of California, Berkeley, CA, USA
3 shared publications Runsheng Wang
Institute of Artificial Intelligence and Robotics, Xian Jiaotong University, Xian, China
2 shared publications
Latest Publications
- 24 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (1) , 587-601
Clothoid-Based Reference Path Reconstruction for HD Map Generation
High-definition (HD) map is one of the key assets for autonomous driving, which supports various modules such as behavior prediction and motion planning of autonomous vehicles by providing accurate and rich geometric and semantic information. However, at present, the scalability and computational efficiency of HD map generation cannot meet the needs of highly automated driving. Specifically, efficiently obtaining the optimal parameters of the road’s reference path is still an open problem. In this paper, we propose a fast and robust path reconstruction method, which compresses the dense points of a reference line into sparse parameters with minimal loss of information. The reconstructed path consists of segmented linear curvature contours, which are straight lines, circular arcs, and clothoids. The optimum result is obtained through linear programming for short-path reconstruction, and for the long paths, a fast progressive reconstruction approach is used to find a feasible solution. Experimental results on both randomly generated data and the GPS-collected trajectories show that compared with existing methods, the proposed method can generate more accurate path reconstruction, and the computational time is greatly reduced.
- 24 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (1) , 587-601
Clothoid-Based Reference Path Reconstruction for HD Map Generation
High-definition (HD) map is one of the key assets for autonomous driving, which supports various modules such as behavior prediction and motion planning of autonomous vehicles by providing accurate and rich geometric and semantic information. However, at present, the scalability and computational efficiency of HD map generation cannot meet the needs of highly automated driving. Specifically, efficiently obtaining the optimal parameters of the road’s reference path is still an open problem. In this paper, we propose a fast and robust path reconstruction method, which compresses the dense points of a reference line into sparse parameters with minimal loss of information. The reconstructed path consists of segmented linear curvature contours, which are straight lines, circular arcs, and clothoids. The optimum result is obtained through linear programming for short-path reconstruction, and for the long paths, a fast progressive reconstruction approach is used to find a feasible solution. Experimental results on both randomly generated data and the GPS-collected trajectories show that compared with existing methods, the proposed method can generate more accurate path reconstruction, and the computational time is greatly reduced.
- 22 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 8 (8) , 5108-5115
Controllable Clothoid Path Generation for Autonomous Vehicles
This letter proposes a novel and simple smooth path generation algorithm for autonomous vehicles. The proposed method can rapidly generate feasible and curvature continuous paths connecting any two given states with null curvature. The generated path comprises straight lines, circular arcs and clothoid segments that are close to human driving behavior. Moreover, while keeping an accurate connection with the boundary states, the proposed method also allows fine-tuning the curve with the maximum curvature of the path and the midpoint’s position, which makes it more flexible in avoiding obstacles while keeping feasibility. Various experiments show that the proposed method has extremely low time consumption and high robustness for different conditions. Meanwhile, it is more flexible than the recent research and the spline-based methods.
- 22 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 8 (8) , 5108-5115
Controllable Clothoid Path Generation for Autonomous Vehicles
This letter proposes a novel and simple smooth path generation algorithm for autonomous vehicles. The proposed method can rapidly generate feasible and curvature continuous paths connecting any two given states with null curvature. The generated path comprises straight lines, circular arcs and clothoid segments that are close to human driving behavior. Moreover, while keeping an accurate connection with the boundary states, the proposed method also allows fine-tuning the curve with the maximum curvature of the path and the midpoint’s position, which makes it more flexible in avoiding obstacles while keeping feasibility. Various experiments show that the proposed method has extremely low time consumption and high robustness for different conditions. Meanwhile, it is more flexible than the recent research and the spline-based methods.
- 14 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 8 (6) , 3358-3365
Efficient Safety-Enhanced Velocity Planning for Autonomous Driving With Chance Constraints
Velocity planning is an important module of autonomous driving, which aims to generate the velocity profile given a reference path. However, most existing algorithms fail to adequately address the uncertainty inherent in driving contexts, leading to potentially risky situations. To this end, we propose an efficient safety-enhanced velocity planning algorithm (ESEVP), which uses chance constraints to take uncertainties from trajectory prediction and velocity tracking into account, arising great improvement in driving safety. In addition, ESEVP formulates velocity planning as quadratic programming and explores candidate solutions through a fast planning space construction method, which ensures efficiency and covers all the interaction possibilities. Experimental results obtained from various scenarios demonstrate that ESEVP outperforms recent state-of-the-art methods in terms of safety, comfort, and driving efficiency. Besides, we successfully deploy ESEVP in real traffic, showcasing its competitive capabilities in practice.
- 14 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 8 (6) , 3358-3365
Efficient Safety-Enhanced Velocity Planning for Autonomous Driving With Chance Constraints
Velocity planning is an important module of autonomous driving, which aims to generate the velocity profile given a reference path. However, most existing algorithms fail to adequately address the uncertainty inherent in driving contexts, leading to potentially risky situations. To this end, we propose an efficient safety-enhanced velocity planning algorithm (ESEVP), which uses chance constraints to take uncertainties from trajectory prediction and velocity tracking into account, arising great improvement in driving safety. In addition, ESEVP formulates velocity planning as quadratic programming and explores candidate solutions through a fast planning space construction method, which ensures efficiency and covers all the interaction possibilities. Experimental results obtained from various scenarios demonstrate that ESEVP outperforms recent state-of-the-art methods in terms of safety, comfort, and driving efficiency. Besides, we successfully deploy ESEVP in real traffic, showcasing its competitive capabilities in practice.
- 12 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 8 (6) , 3294-3301
Long-Term Dynamic Window Approach for Kinodynamic Local Planning in Static and Crowd Environments
Local planning for a differential wheeled robot is designed to generate kinodynamic feasible actions that guide the robot to a goal position along the navigation path while avoiding obstacles. Reactive, predictive, and learning-based methods are widely used in local planning. However, few of them can fit static and crowd environments while satisfying kinodynamic constraints simultaneously. To solve this problem, we propose a novel local planning method. The method applies a long-term dynamic window approach to generate an initial trajectory and then optimizes it with graph optimization. The method can plan actions under the robot's kinodynamic constraints in real time while allowing the generated actions to be safer and more jitterless. Experimental results show that the proposed method adapts well to crowd and static environments and outperforms most state-of-the-art approaches.
- 12 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 8 (6) , 3294-3301
Long-Term Dynamic Window Approach for Kinodynamic Local Planning in Static and Crowd Environments
Local planning for a differential wheeled robot is designed to generate kinodynamic feasible actions that guide the robot to a goal position along the navigation path while avoiding obstacles. Reactive, predictive, and learning-based methods are widely used in local planning. However, few of them can fit static and crowd environments while satisfying kinodynamic constraints simultaneously. To solve this problem, we propose a novel local planning method. The method applies a long-term dynamic window approach to generate an initial trajectory and then optimizes it with graph optimization. The method can plan actions under the robot's kinodynamic constraints in real time while allowing the generated actions to be safer and more jitterless. Experimental results show that the proposed method adapts well to crowd and static environments and outperforms most state-of-the-art approaches.
- 3 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 23 (8) , 13291-13305
Hierarchical Motion Planning for Autonomous Driving in Large-Scale Complex Scenarios
Motion planning algorithms, an essential part of the autonomous driving system, have been extensively studied. However, in large-scale complex scenarios, how to develop an optimal path to comply with the requirements of smoothness and safety remains a vital issue. In this study, a hierarchical search spacial scales-based hybrid A* (termed as HHA*) motion planning method is proposed, capable of efficiently generating smooth and safe paths. The proposed HHA* method covers two stages. First, the search space is divided on a coarse scale to generate local goals. Subsequently, the novel heuristic function and exploration strategies are adopted in the fine-scale search space to generate paths like that with a human driver guided by the local goals. Moreover, with the usage of the clothoid, the smoothness of the generated path is improved to be G 2 –continuous (i.e., curvature continuous), which fits the vehicle’s kinematic constraints without the need for later smoothing. Numerous experimental results from the simulation and on-road tests indicate that the proposed method can effectively perform motion planning that meets smoothness and safety in large-scale complex scenarios.
- 3 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 23 (8) , 13291-13305
Hierarchical Motion Planning for Autonomous Driving in Large-Scale Complex Scenarios
Motion planning algorithms, an essential part of the autonomous driving system, have been extensively studied. However, in large-scale complex scenarios, how to develop an optimal path to comply with the requirements of smoothness and safety remains a vital issue. In this study, a hierarchical search spacial scales-based hybrid A* (termed as HHA*) motion planning method is proposed, capable of efficiently generating smooth and safe paths. The proposed HHA* method covers two stages. First, the search space is divided on a coarse scale to generate local goals. Subsequently, the novel heuristic function and exploration strategies are adopted in the fine-scale search space to generate paths like that with a human driver guided by the local goals. Moreover, with the usage of the clothoid, the smoothness of the generated path is improved to be G 2 –continuous (i.e., curvature continuous), which fits the vehicle’s kinematic constraints without the need for later smoothing. Numerous experimental results from the simulation and on-road tests indicate that the proposed method can effectively perform motion planning that meets smoothness and safety in large-scale complex scenarios.
- 21 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 6 (3) , 5349-5356
A Global-Local Coupling Two-Stage Path Planning Method for Mobile Robots
The path planning of mobile robots is an optimization problem that is difficult to solve directly owing to its nonlinear characteristics. This letter proposes the “global-local” Coupling Two-Stage Path Planning (CTSP) method. First, the globally optimal solution in the configuration space is given by the global planner. Then, in the local planning stage, the optimal solution of the local environment is constantly searched, guided by the prior information of the globally optimal solution. The strategy used in the global planning stage is the iterative optimization method based on an initial solution. The local planning stage adopts the sampling-evaluation strategy, that is, sampling the candidate paths and then using the evaluation function to perform path selection. The proposed method has two innovations: 1) a novel global iterative optimization method is proposed and 2) a new cost function for evaluating the sampled paths is constructed, which improves the coupling of the global and local paths. We implement and test this method in a simulation environment, where the experimental results verify the effectiveness of the proposed method.
- 21 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 6 (3) , 5349-5356
A Global-Local Coupling Two-Stage Path Planning Method for Mobile Robots
The path planning of mobile robots is an optimization problem that is difficult to solve directly owing to its nonlinear characteristics. This letter proposes the “global-local” Coupling Two-Stage Path Planning (CTSP) method. First, the globally optimal solution in the configuration space is given by the global planner. Then, in the local planning stage, the optimal solution of the local environment is constantly searched, guided by the prior information of the globally optimal solution. The strategy used in the global planning stage is the iterative optimization method based on an initial solution. The local planning stage adopts the sampling-evaluation strategy, that is, sampling the candidate paths and then using the evaluation function to perform path selection. The proposed method has two innovations: 1) a novel global iterative optimization method is proposed and 2) a new cost function for evaluating the sampled paths is constructed, which improves the coupling of the global and local paths. We implement and test this method in a simulation environment, where the experimental results verify the effectiveness of the proposed method.
- 16 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 23 (5) , 4187-4200
Multi-Model-Based Local Path Planning Methodology for Autonomous Driving: An Integrated Framework
Autonomous driving systems (ADSs) need to be able to respond quickly to changes in the dynamic traffic scenario. However, regardless of the changes occurring in traffic scenes, the current local path planning frameworks of ADSs are based on the fixed frequency re-planning path (i.e., running their planning algorithms repeatedly). This planning method makes it difficult to provide a reasonable traveling path, agility, and comfort for driverless vehicles in changing traffic scenarios. Therefore, this article performs an in-depth analysis of the problems of traditional planning frameworks which use a fixed frequency to replan the path and proposes a novel path planning framework that is universal based on multiple-models. The proposed framework divides the planning process into several layers, each of which has different functions. With this framework, the ADS can adaptively adjust the planning process according to the changes in traffic scenes and then provide different path planning algorithms to ensure its safety and flexibility in the process of driving. Moreover, the problems caused by the traditional planning framework can be solved. This framework has been applied to the autonomous vehicle ``Pioneer'', which won first place in the 2019 China Intelligent Vehicle Future Challenge (IVFC). The effectiveness and rationality of the integrated framework of local path planning proposed in this article were verified by a large number of tests in real-world traffic scenarios.
- 16 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 23 (5) , 4187-4200
Multi-Model-Based Local Path Planning Methodology for Autonomous Driving: An Integrated Framework
Autonomous driving systems (ADSs) need to be able to respond quickly to changes in the dynamic traffic scenario. However, regardless of the changes occurring in traffic scenes, the current local path planning frameworks of ADSs are based on the fixed frequency re-planning path (i.e., running their planning algorithms repeatedly). This planning method makes it difficult to provide a reasonable traveling path, agility, and comfort for driverless vehicles in changing traffic scenarios. Therefore, this article performs an in-depth analysis of the problems of traditional planning frameworks which use a fixed frequency to replan the path and proposes a novel path planning framework that is universal based on multiple-models. The proposed framework divides the planning process into several layers, each of which has different functions. With this framework, the ADS can adaptively adjust the planning process according to the changes in traffic scenes and then provide different path planning algorithms to ensure its safety and flexibility in the process of driving. Moreover, the problems caused by the traditional planning framework can be solved. This framework has been applied to the autonomous vehicle ``Pioneer'', which won first place in the 2019 China Intelligent Vehicle Future Challenge (IVFC). The effectiveness and rationality of the integrated framework of local path planning proposed in this article were verified by a large number of tests in real-world traffic scenarios.