{"title":"参数空间离散化在移动障碍物局部导航中的应用","authors":"B. Kreczmer","doi":"10.1109/ROMOCO.1999.791075","DOIUrl":null,"url":null,"abstract":"The paper presents an approach to the problem of local navigation among moving obstacles. The main feature of the approach is the discretization of the space of parameters describing movements of obstacles. The assumption of the method is that obstacles move along straight lines. This approach allows one to compute off-line admissible controls for all expected values of parameters defining an obstacle movement. Therefore, to solve the local navigation problem a look-at-table technique can be applied. This technique allows one to reduce the time of computation significantly. The example of experiments shows that the method can be used to find a solution for non-trivial cases.","PeriodicalId":131049,"journal":{"name":"Proceedings of the First Workshop on Robot Motion and Control. RoMoCo'99 (Cat. No.99EX353)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Application of parameter space discretization for local navigation among moving obstacles\",\"authors\":\"B. Kreczmer\",\"doi\":\"10.1109/ROMOCO.1999.791075\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper presents an approach to the problem of local navigation among moving obstacles. The main feature of the approach is the discretization of the space of parameters describing movements of obstacles. The assumption of the method is that obstacles move along straight lines. This approach allows one to compute off-line admissible controls for all expected values of parameters defining an obstacle movement. Therefore, to solve the local navigation problem a look-at-table technique can be applied. This technique allows one to reduce the time of computation significantly. The example of experiments shows that the method can be used to find a solution for non-trivial cases.\",\"PeriodicalId\":131049,\"journal\":{\"name\":\"Proceedings of the First Workshop on Robot Motion and Control. RoMoCo'99 (Cat. No.99EX353)\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the First Workshop on Robot Motion and Control. RoMoCo'99 (Cat. No.99EX353)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ROMOCO.1999.791075\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the First Workshop on Robot Motion and Control. RoMoCo'99 (Cat. No.99EX353)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ROMOCO.1999.791075","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Application of parameter space discretization for local navigation among moving obstacles
The paper presents an approach to the problem of local navigation among moving obstacles. The main feature of the approach is the discretization of the space of parameters describing movements of obstacles. The assumption of the method is that obstacles move along straight lines. This approach allows one to compute off-line admissible controls for all expected values of parameters defining an obstacle movement. Therefore, to solve the local navigation problem a look-at-table technique can be applied. This technique allows one to reduce the time of computation significantly. The example of experiments shows that the method can be used to find a solution for non-trivial cases.