{"title":"随机探测近似内轴线和计划安全运动","authors":"S. Guha, D. Suri, I. Suzuki","doi":"10.1109/ICAR.1997.620206","DOIUrl":null,"url":null,"abstract":"We propose a novel approach to planning the safe motion of a robot - the motion is considered safe if the robot stays as distant as possible from the nearest obstacle. The approach is based on approximating the medial axis of the free configuration space through randomized probes of the full configuration space. Experiments with 2- and 3-DOF manipulators show that the approach generates longer but significantly safer motion when compared with naive planning to simply finds a shortest motion. In addition, once preprocessing is complete our approach spends much less time planning motion than the naive one. As it is based on probing randomly, rather than at points on a grid, our approach promises to extend effectively to robots with many DOF.","PeriodicalId":228876,"journal":{"name":"1997 8th International Conference on Advanced Robotics. Proceedings. ICAR'97","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Random probing to approximate medial axes and plan safe motion\",\"authors\":\"S. Guha, D. Suri, I. Suzuki\",\"doi\":\"10.1109/ICAR.1997.620206\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a novel approach to planning the safe motion of a robot - the motion is considered safe if the robot stays as distant as possible from the nearest obstacle. The approach is based on approximating the medial axis of the free configuration space through randomized probes of the full configuration space. Experiments with 2- and 3-DOF manipulators show that the approach generates longer but significantly safer motion when compared with naive planning to simply finds a shortest motion. In addition, once preprocessing is complete our approach spends much less time planning motion than the naive one. As it is based on probing randomly, rather than at points on a grid, our approach promises to extend effectively to robots with many DOF.\",\"PeriodicalId\":228876,\"journal\":{\"name\":\"1997 8th International Conference on Advanced Robotics. Proceedings. ICAR'97\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-07-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1997 8th International Conference on Advanced Robotics. Proceedings. ICAR'97\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAR.1997.620206\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1997 8th International Conference on Advanced Robotics. Proceedings. ICAR'97","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAR.1997.620206","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Random probing to approximate medial axes and plan safe motion
We propose a novel approach to planning the safe motion of a robot - the motion is considered safe if the robot stays as distant as possible from the nearest obstacle. The approach is based on approximating the medial axis of the free configuration space through randomized probes of the full configuration space. Experiments with 2- and 3-DOF manipulators show that the approach generates longer but significantly safer motion when compared with naive planning to simply finds a shortest motion. In addition, once preprocessing is complete our approach spends much less time planning motion than the naive one. As it is based on probing randomly, rather than at points on a grid, our approach promises to extend effectively to robots with many DOF.