{"title":"窄环境下非完整路径规划的连续碰撞检测方法","authors":"Daniel Henning, Georg Schildbach","doi":"10.1109/ICSTCC55426.2022.9931874","DOIUrl":null,"url":null,"abstract":"This paper presents a new method of collision checking for non-holonomic dynamical systems in environments with narrow passages. This new method is compared with alternative approaches for collision checking, which are widely used in conjunction with different path planners. All methods are evaluated in a systematic simulation study with numerous scenarios, using two of the most popular path planning methods, Hybrid A* and RRT*. On the one hand, the results show that the new collision checking approach can manage the narrow passages better than the compared methods. On the other hand, its computation time can be longer or shorter, depending on the particular scenario.","PeriodicalId":220845,"journal":{"name":"2022 26th International Conference on System Theory, Control and Computing (ICSTCC)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Continuous Collision Checking Method for Non-holonomic Path Planning in Narrow Environments\",\"authors\":\"Daniel Henning, Georg Schildbach\",\"doi\":\"10.1109/ICSTCC55426.2022.9931874\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a new method of collision checking for non-holonomic dynamical systems in environments with narrow passages. This new method is compared with alternative approaches for collision checking, which are widely used in conjunction with different path planners. All methods are evaluated in a systematic simulation study with numerous scenarios, using two of the most popular path planning methods, Hybrid A* and RRT*. On the one hand, the results show that the new collision checking approach can manage the narrow passages better than the compared methods. On the other hand, its computation time can be longer or shorter, depending on the particular scenario.\",\"PeriodicalId\":220845,\"journal\":{\"name\":\"2022 26th International Conference on System Theory, Control and Computing (ICSTCC)\",\"volume\":\"73 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 26th International Conference on System Theory, Control and Computing (ICSTCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSTCC55426.2022.9931874\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 26th International Conference on System Theory, Control and Computing (ICSTCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSTCC55426.2022.9931874","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
摘要
本文提出了窄通道环境下非完整动力系统碰撞检测的一种新方法。该方法与其他碰撞检测方法进行了比较,这些方法通常与不同的路径规划器结合使用。采用两种最流行的路径规划方法Hybrid a *和RRT*,在系统仿真研究中对所有方法进行了评估。结果表明,该碰撞检测方法能较好地处理窄通道。另一方面,它的计算时间可能更长或更短,这取决于特定的场景。
A Continuous Collision Checking Method for Non-holonomic Path Planning in Narrow Environments
This paper presents a new method of collision checking for non-holonomic dynamical systems in environments with narrow passages. This new method is compared with alternative approaches for collision checking, which are widely used in conjunction with different path planners. All methods are evaluated in a systematic simulation study with numerous scenarios, using two of the most popular path planning methods, Hybrid A* and RRT*. On the one hand, the results show that the new collision checking approach can manage the narrow passages better than the compared methods. On the other hand, its computation time can be longer or shorter, depending on the particular scenario.