{"title":"一种新的距离算法及其在一般力闭合试验中的应用","authors":"Yu Zheng, C. Chew","doi":"10.1109/RAMECH.2008.4681414","DOIUrl":null,"url":null,"abstract":"This paper presents an algorithm for computing the distance between a point and a convex cone in n-dimensional space. The convex cone is specified by the set of all nonnegative combinations of points of a given set. If the given set is finite, the algorithm converges in a finite number of iterations. The iterative computation speeds up with the help of the derived recursive formulas and effective choice of initial and stopping conditions. The function of this algorithm is demonstrated by its application to force-closure test, which is a fundamental problem arising in research of several mechanisms. Numerical examples show that force-closure can be verified very quickly by this means.","PeriodicalId":320560,"journal":{"name":"2008 IEEE Conference on Robotics, Automation and Mechatronics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A New Distance Algorithm and Its Application to General Force-Closure Test\",\"authors\":\"Yu Zheng, C. Chew\",\"doi\":\"10.1109/RAMECH.2008.4681414\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents an algorithm for computing the distance between a point and a convex cone in n-dimensional space. The convex cone is specified by the set of all nonnegative combinations of points of a given set. If the given set is finite, the algorithm converges in a finite number of iterations. The iterative computation speeds up with the help of the derived recursive formulas and effective choice of initial and stopping conditions. The function of this algorithm is demonstrated by its application to force-closure test, which is a fundamental problem arising in research of several mechanisms. Numerical examples show that force-closure can be verified very quickly by this means.\",\"PeriodicalId\":320560,\"journal\":{\"name\":\"2008 IEEE Conference on Robotics, Automation and Mechatronics\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-11-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE Conference on Robotics, Automation and Mechatronics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RAMECH.2008.4681414\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE Conference on Robotics, Automation and Mechatronics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RAMECH.2008.4681414","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A New Distance Algorithm and Its Application to General Force-Closure Test
This paper presents an algorithm for computing the distance between a point and a convex cone in n-dimensional space. The convex cone is specified by the set of all nonnegative combinations of points of a given set. If the given set is finite, the algorithm converges in a finite number of iterations. The iterative computation speeds up with the help of the derived recursive formulas and effective choice of initial and stopping conditions. The function of this algorithm is demonstrated by its application to force-closure test, which is a fundamental problem arising in research of several mechanisms. Numerical examples show that force-closure can be verified very quickly by this means.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
