{"title":"复杂环境下可变形机器人的路径规划","authors":"Russell Gayle, P. Segars, M. Lin, Dinesh Manocha","doi":"10.15607/RSS.2005.I.030","DOIUrl":null,"url":null,"abstract":"Just a test. We present an algorithm for path planning for a flexible robot in complex environments. Our algorithm computes a collision free path by taking into account geometric and physical constraints, including obstacle avoidance, nonpenetration constraint, volume preservation, surface tension, and energy minimization. We describe a new algorithm for collision detection between a deformable robot and fixed obstacles using graphics processors. We also present techniques to efficiently handle complex deformable models composed of tens of thousands of polygons and obtain significant performance improvement over previous approaches. Moreover, we demonstrate a practical application of our algorithm in performing path planning of catheters in liver chemoembolization.","PeriodicalId":87357,"journal":{"name":"Robotics science and systems : online proceedings","volume":"1 1","pages":"225-232"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"78","resultStr":"{\"title\":\"Path Planning for Deformable Robots in Complex Environments\",\"authors\":\"Russell Gayle, P. Segars, M. Lin, Dinesh Manocha\",\"doi\":\"10.15607/RSS.2005.I.030\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Just a test. We present an algorithm for path planning for a flexible robot in complex environments. Our algorithm computes a collision free path by taking into account geometric and physical constraints, including obstacle avoidance, nonpenetration constraint, volume preservation, surface tension, and energy minimization. We describe a new algorithm for collision detection between a deformable robot and fixed obstacles using graphics processors. We also present techniques to efficiently handle complex deformable models composed of tens of thousands of polygons and obtain significant performance improvement over previous approaches. Moreover, we demonstrate a practical application of our algorithm in performing path planning of catheters in liver chemoembolization.\",\"PeriodicalId\":87357,\"journal\":{\"name\":\"Robotics science and systems : online proceedings\",\"volume\":\"1 1\",\"pages\":\"225-232\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-06-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"78\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Robotics science and systems : online proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15607/RSS.2005.I.030\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Robotics science and systems : online proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15607/RSS.2005.I.030","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Path Planning for Deformable Robots in Complex Environments
Just a test. We present an algorithm for path planning for a flexible robot in complex environments. Our algorithm computes a collision free path by taking into account geometric and physical constraints, including obstacle avoidance, nonpenetration constraint, volume preservation, surface tension, and energy minimization. We describe a new algorithm for collision detection between a deformable robot and fixed obstacles using graphics processors. We also present techniques to efficiently handle complex deformable models composed of tens of thousands of polygons and obtain significant performance improvement over previous approaches. Moreover, we demonstrate a practical application of our algorithm in performing path planning of catheters in liver chemoembolization.