计算机科学 ›› 2026, Vol. 53 ›› Issue (5): 328-336.doi: 10.11896/jsjkx.250300043

• 人工智能 • 上一篇    下一篇

复杂环境下的无人车时空联合轨迹规划

郑雅羽1,2, 饶品阳1, 穆建彬1, 朱威1,2   

  1. 1 浙江工业大学信息工程学院 杭州 310023
    2 浙江省嵌入式系统联合重点实验室 杭州 310023
  • 收稿日期:2025-03-10 修回日期:2025-06-27 发布日期:2026-05-08
  • 通讯作者: 朱威(weizhu@zjut.edu.cn)
  • 作者简介:(yayuzheng@zjut.edu.cn)
  • 基金资助:
    国家自然科学基金联合重点项目(U24A20270);浙江省自然科学基金(LQ24F030023)

Spatio-Temporal Trajectory Planning for Unmanned Vehicles in Complex Environments

ZHENG Yayu1,2, RAO Pinyang1, MU Jianbin1, ZHU Wei1,2   

  1. 1 College of Information Engineering, Zhejiang University of Technology, Hangzhou 310023, China
    2 Zhejiang Provincial Joint Key Laboratory of Embedded Systems, Hangzhou 310023, China
  • Received:2025-03-10 Revised:2025-06-27 Online:2026-05-08
  • About author:ZHENG Yayu,born in 1978,Ph.D,associate professor.His main research in-terests include video processing,embedded applications and intelligent robot.
    ZHU Wei,born in 1982,Ph.D,associate professor.His main research interests include video processing,machine lear-ning and intelligent robot.
  • Supported by:
    Joint Key Program of the National Natural Science Foundation of China(U24A20270) and Natural Science Foundation of Zhejiang Province(LQ24F030023).

摘要: 针对复杂环境下阿克曼转向无人车轨迹规划处理环境约束和运动学约束低效的问题,提出一种前后端耦合的高效时空联合轨迹规划算法。在前端路径规划中,通过融合拓扑地图引导的滑动窗口剪枝策略和动态启发式函数优化方法来提升搜索效率。在后端轨迹优化中,先以安全通行走廊对偶表示环境约束,根据阿克曼模型无人车微分平坦特性,以无人车微分平坦变量及其高阶导表示运动学约束并作为优化变量;再使用光滑映射和微分同胚变换,解析式地将优化变量转换至无约束空间;最后在无约束空间进行梯度优化,以解决处理约束低效的问题。实验场景为实际停车场环境,结果表明,在路径搜索质量无显著下降的前提下,所提模型所用时间较现有方法减少47%,轨迹优化结果表明,所提算法能够实时地规划出高质量时空轨迹,验证了其有效性。

关键词: 轨迹规划, 时空联合, 微分平坦, 微分同胚变换, 凸优化

Abstract: To address the inefficiency of handling environmental constraints and kinematic constraints in trajectory planning for Ackermann-steering autonomous vehicles in complex environments,this paper proposes an efficient spatiotemporal joint trajectory planning algorithm with front-end and back-end coupling.In the front-end path planning,by integrating a topology map-guided sliding window pruning strategy with a dynamic heuristic function optimization method,the search efficiency is improved.For the back-end trajectory optimization,environmental constraints are first represented by dual safety corridors.Based on the differential flatness characteristics of the Ackermann model vehicle,kinematic constraints are expressed using the vehicle’s differentially flat variables and their higher-order derivatives as optimization variables.These variables are then analytically transformed into an unconstrained space via smooth mapping and diffeomorphic transformations.Finally,gradient optimization is performed in the unconstrained space to resolve constraint-handling inefficiencies.Experiments conducted in real-world parking environments demonstrate that the proposed method achieves 47% faster path search time compared to existing methods while maintaining comparable path quality.The trajectory optimization results show that the proposed algorithm can plan high-quality spatiotemporal trajectories in real time,verifying its effectiveness.

Key words: Trajectory planning, Spatio-temporal coupling, Differential flatness, Diffeomorphic transformation, Convex optimization

中图分类号: 

  • TP391
[1]JONES M,DJAHEL S,WELSH K.Path-planning for unmanned aerial vehicles with environment complexity considerations:A survey[J].ACM Computing Surveys,2023,55(11):1-39.
[2]SUN Q,WANG C,FU R,et al.Lane change strategy analysis and recognition for intelligent driving systems based on random forest[J].Expert Systems with Applications,2021,186:115781.
[3]CHEN L,LI Y,HUANG C,et al.Milestones in autonomousdriving and intelligent vehicles:Survey of surveys[J].IEEE Transactions on Intelligent Vehicles,2023,8(2):1046-1056.
[4]TENG S,HU X,DENG P,et al.Motion planning for autonomous driving:The state of the art and future perspectives[J].IEEE Transactions on Intelligent Vehicles,2023,8(6):3692-3711.
[5]PAN H,CHANG X,SUN W.Multitask knowledge distillation guides end-to-end lane detection[J].IEEE Transactions on Industrial Informatics,2023,19(9):9703-9712.
[6]QI Y,HE B,WANG R,et al.Hierarchical motion planning for autonomous vehicles in unstructured dynamic environments[J].IEEE Robotics and Automation Letters,2022,8(2):496-503.
[7]QUINLAN S,KHATIB O.Elastic bands:Connecting path planning and control[C]//Proceedings IEEE International Confe-rence on Robotics and Automation.IEEE,1993:802-807.
[8]LAU B,SPRUNK C,BURGARD W.Efficient grid-based spatial representations for robot navigation in dynamic environments[J].Robotics and Autonomous Systems,2013,61(10):1116-1130.
[9]ZHU Z,YIN Y,LYU H.Automatic collision avoidance algorithm based on route-plan-guided artificial potential field method[J].Ocean Engineering,2023,271:113737.
[10]WANG J,MENG M Q H,KHATIB O.EB-RRT:Optimal motion planning for mobile robots[J].IEEE Transactions on Automation Science and Engineering,2020,17(4):2063-2073.
[11]MOHAMMED H,ROMDHANE L,JARADAT M A.RRT* N:An efficient approach to path planning in 3D forstatic and dynamic environments[J].Advanced Robotics,2021,35(3/4):168-180.
[12]LI Y,WEI W,GAO Y,et al.PQ-RRT*:An improved pathplanning algorithm for mobile robots[J].Expert Systems with Applications,2020,152:113425.
[13]GAMMELL J D,BARFOOT T D,SRINIVASA S S.Informed sampling for asymptotically optimal path planning[J].IEEE Transactions on Robotics,2018,34(4):966-984.
[14]WEBB D J,VAN DEN BERG J.Kinodynamic RRT*:Asymptotically optimal motion planning for robots with linear dyna-mics[C]//2013 IEEE International Conference on Robotics and Automation.IEEE,2013:5054-5061.
[15]LI X,HU X,WANG Z,et al.Path planning based on combinaion of improved A-STAR algorithm and DWA algorithm[C]//2020 2nd International Conference on Artificial Intelligence and Advanced Manufacture(AIAM).IEEE,2020:99-103.
[16]AJANOVIC Z,LACEVIC B,SHYROKAU B,et al.Search-based optimal motion planning for automated driving[C]//2018 IEEE/RSJ International Conference on Intelligent Robots and Systems(IROS).IEEE,2018:4523-4530.
[17]LIU S,MOHTA K,ATANASOV N,et al.Search-based motion planning for aggressive flight in SE(3)[J].IEEE Robotics and Automation Letters,2018,3(3):2439-2446.
[18]PAULINO L,HANNUM C,VARDE A S,et al.Search methods in motion planning for mobile robots[C]//Intelligent Systems and Applications:Proceedings of the 2021 Intelligent Systems Conference(IntelliSys).Springer,2022:802-822.
[19]TU K,YANG S,ZHANG H,et al.Hybrid A* based motion planning for autonomous vehicles in unstructured environment[C]//2019 IEEE International Symposium on Circuits and Systems(ISCAS).IEEE,2019:1-4.
[20]ESHTEHARDIAN S A,KHODAYGAN S.A continuousRRT*-based path planning method for non-holonomic mobile robots using B-spline curves[J].Journal of Ambient Intelligence and Humanized Computing,2023,14(7):8693-8702.
[21]BENKO LOKNAR M,KLANČAR G,BLAŽIČ S.Minimum time trajectory generation for wheeled mobile systems using Bézier curves with constraints on velocity,acceleration and jerk[J].Sensors,2023,23(4):1982.
[22]ZHU W,YANG S,TENG F,et al.Study on unmanned vehicle trajectory planning in unstructured scenarios[J].Computer Science,2024,51(4):334-343.
[23]RÖSMANN C,HOFFMANN F,BERTRAM T.Timed-elastic-bands for time-optimal point-to-point nonlinear model predictive control[C]//2015 European Control Conference(ECC).IEEE,2015:3352-3357.
[24]ZIEGLER C,ADAMY J.Anytime tree-based trajectory planning for urban driving[J].IEEE Open Journal of Intelligent Transportation Systems,2023,4:48-57.
[25]REEDS J,SHEPP L.Optimal paths for a car that goes both forwards and backwards[J].Pacific Journal of Mathematics,1990,145(2):367-393.
[26]DEITS R,TEDRAKE R.Computing large convex regions of obstacle-free space through semidefinite programming[C]//Algorithmic Foundations of Robotics XI:Selected Contributions of the Eleventh International Workshop on the Algorithmic Foundations of Robotics.Cham:Springer,2015:109-124.
[27]WANG Z,ZHOU X,XU C,et al.Geometrically constrainedtrajectory optimization for multicopters[J].IEEE Transactions on Robotics,2022,38(5):3259-3278.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!