{"title":"点机器人运动规划问题的近似算法观察","authors":"C. Trefftz, H. Trefftz","doi":"10.1109/SCCC.2002.1173173","DOIUrl":null,"url":null,"abstract":"Observations about an approximate parallel algorithm for the point robot motion planning problem are presented. The algorithm solves not only the original problem, but related problems as well.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Observations about an approximate algorithm for the point robot motion planning problem\",\"authors\":\"C. Trefftz, H. Trefftz\",\"doi\":\"10.1109/SCCC.2002.1173173\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Observations about an approximate parallel algorithm for the point robot motion planning problem are presented. The algorithm solves not only the original problem, but related problems as well.\",\"PeriodicalId\":130951,\"journal\":{\"name\":\"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-11-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCCC.2002.1173173\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCCC.2002.1173173","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Observations about an approximate algorithm for the point robot motion planning problem
Observations about an approximate parallel algorithm for the point robot motion planning problem are presented. The algorithm solves not only the original problem, but related problems as well.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
