复杂环境下基于优化的轨迹规划方法

Yi Chang, Qiuqing Yang, Huawei Liang, Zhiyuan Li, Hanqi Wang, Jian Wang
{"title":"复杂环境下基于优化的轨迹规划方法","authors":"Yi Chang, Qiuqing Yang, Huawei Liang, Zhiyuan Li, Hanqi Wang, Jian Wang","doi":"10.1109/IDITR57726.2023.10145979","DOIUrl":null,"url":null,"abstract":"This paper's major objective is to rapidly and precisely plan the optimal trajectory in a complex environment. Because collisions must be avoided to ensure driving safety and compliance with kinematic constraints to enable precise tracking, this task can be characterized as an optimal control problem(OCP). The outcome of the optimal control problem is determined by the initial solution. A good first solution can reduce the time needed to solve the problem and enhance the effectiveness of the planning process. Hybrid A* is a well-known heuristic method that has a short planning time and satisfies vehicle but it is not complete. It offers a good initial solution for following optimal control problems. In order to achieve the ideal balance between optimality and solvability, we therefore suggest that, in the event that Hybrid A* planning fails, the complete two-dimensional A* planning result be employed as the initial solution of the optimal control problem. It is difficult and time-consuming to avoid contact with any obstacles when the initial solution indicates the homotopy path. The collision avoidance constraint is changed into a linear constraint by the addition of a space corridor, making it independent of the overall quantity of obstacles and solely related to obstacles that are approaching the trajectory. Soft constraints are utilized to further simplify the optimal control problem and guarantee its solvability. We conduct simulation experiments in multiple scenes to prove the feasibility of the algorithm.","PeriodicalId":272880,"journal":{"name":"2023 2nd International Conference on Innovations and Development of Information Technologies and Robotics (IDITR)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Trajectory Planning Method Based on Optimization in Complex Environment\",\"authors\":\"Yi Chang, Qiuqing Yang, Huawei Liang, Zhiyuan Li, Hanqi Wang, Jian Wang\",\"doi\":\"10.1109/IDITR57726.2023.10145979\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper's major objective is to rapidly and precisely plan the optimal trajectory in a complex environment. Because collisions must be avoided to ensure driving safety and compliance with kinematic constraints to enable precise tracking, this task can be characterized as an optimal control problem(OCP). The outcome of the optimal control problem is determined by the initial solution. A good first solution can reduce the time needed to solve the problem and enhance the effectiveness of the planning process. Hybrid A* is a well-known heuristic method that has a short planning time and satisfies vehicle but it is not complete. It offers a good initial solution for following optimal control problems. In order to achieve the ideal balance between optimality and solvability, we therefore suggest that, in the event that Hybrid A* planning fails, the complete two-dimensional A* planning result be employed as the initial solution of the optimal control problem. It is difficult and time-consuming to avoid contact with any obstacles when the initial solution indicates the homotopy path. The collision avoidance constraint is changed into a linear constraint by the addition of a space corridor, making it independent of the overall quantity of obstacles and solely related to obstacles that are approaching the trajectory. Soft constraints are utilized to further simplify the optimal control problem and guarantee its solvability. We conduct simulation experiments in multiple scenes to prove the feasibility of the algorithm.\",\"PeriodicalId\":272880,\"journal\":{\"name\":\"2023 2nd International Conference on Innovations and Development of Information Technologies and Robotics (IDITR)\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 2nd International Conference on Innovations and Development of Information Technologies and Robotics (IDITR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IDITR57726.2023.10145979\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 2nd International Conference on Innovations and Development of Information Technologies and Robotics (IDITR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IDITR57726.2023.10145979","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文的主要目标是在复杂环境中快速精确地规划最优轨迹。由于必须避免碰撞以确保驾驶安全,并符合运动学约束以实现精确跟踪,因此该任务可以被描述为最优控制问题(OCP)。最优控制问题的结果由初始解决定。一个好的第一个解决方案可以减少解决问题所需的时间,并提高规划过程的有效性。混合A*是一种著名的启发式方法,规划时间短,满足车辆要求,但不完全。它为后续的最优控制问题提供了一个良好的初始解。因此,为了在最优性和可解性之间达到理想的平衡,我们建议在Hybrid A*规划失败的情况下,采用完整的二维A*规划结果作为最优控制问题的初始解。当初始解为同伦路径时,避免与障碍物接触是困难且耗时的。通过增加空间走廊将避碰约束转变为线性约束,使其独立于障碍物的总体数量,只与接近轨迹的障碍物相关。利用软约束进一步简化了最优控制问题,保证了其可解性。为了验证算法的可行性,我们在多个场景下进行了仿真实验。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Trajectory Planning Method Based on Optimization in Complex Environment
This paper's major objective is to rapidly and precisely plan the optimal trajectory in a complex environment. Because collisions must be avoided to ensure driving safety and compliance with kinematic constraints to enable precise tracking, this task can be characterized as an optimal control problem(OCP). The outcome of the optimal control problem is determined by the initial solution. A good first solution can reduce the time needed to solve the problem and enhance the effectiveness of the planning process. Hybrid A* is a well-known heuristic method that has a short planning time and satisfies vehicle but it is not complete. It offers a good initial solution for following optimal control problems. In order to achieve the ideal balance between optimality and solvability, we therefore suggest that, in the event that Hybrid A* planning fails, the complete two-dimensional A* planning result be employed as the initial solution of the optimal control problem. It is difficult and time-consuming to avoid contact with any obstacles when the initial solution indicates the homotopy path. The collision avoidance constraint is changed into a linear constraint by the addition of a space corridor, making it independent of the overall quantity of obstacles and solely related to obstacles that are approaching the trajectory. Soft constraints are utilized to further simplify the optimal control problem and guarantee its solvability. We conduct simulation experiments in multiple scenes to prove the feasibility of the algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Research on Network Privacy Information Protection Technology and Strategy Deep Learning for Semantic Segmentation of Football Match Image Design of a Constant Flow Control System for Cut Tobacco Feeder A Comparative Study of Cross-Sentence Features for Named Entity Recognition Analysis of New Distribution Network Planning Using Artificial Intelligence Semantic Recognition
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1