H. Attarchi, B. Bidabad, S. M. K. Torbaghan, Mohammad Khosravi
{"title":"追求导航中一类新算法的研究","authors":"H. Attarchi, B. Bidabad, S. M. K. Torbaghan, Mohammad Khosravi","doi":"10.1080/1726037X.2020.1774155","DOIUrl":null,"url":null,"abstract":"Abstract The problem of tracking and navigation towards a moving target is always one of the main topics in robotics. In this paper, following our recent work in the plane, a novel on-line strategy is used to guide a pursuer in space. This strategy is called hybrid pursuit navigation and it is a combination of two well-known pursuit algorithms the pure-pursuit and the pure-rendezvous navigation. To show the reliability of this new method, it is proved that the pursuer reaches the target under the hybrid pursuit navigation. Moreover, by simulating different scenarios, the advantage of this algorithm is demonstrated in comparison with two well-known algorithms.","PeriodicalId":42788,"journal":{"name":"Journal of Dynamical Systems and Geometric Theories","volume":"18 1","pages":"15 - 26"},"PeriodicalIF":0.4000,"publicationDate":"2020-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/1726037X.2020.1774155","citationCount":"0","resultStr":"{\"title\":\"Towards a Novel Family of Algorithms in Pursuit Navigation\",\"authors\":\"H. Attarchi, B. Bidabad, S. M. K. Torbaghan, Mohammad Khosravi\",\"doi\":\"10.1080/1726037X.2020.1774155\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract The problem of tracking and navigation towards a moving target is always one of the main topics in robotics. In this paper, following our recent work in the plane, a novel on-line strategy is used to guide a pursuer in space. This strategy is called hybrid pursuit navigation and it is a combination of two well-known pursuit algorithms the pure-pursuit and the pure-rendezvous navigation. To show the reliability of this new method, it is proved that the pursuer reaches the target under the hybrid pursuit navigation. Moreover, by simulating different scenarios, the advantage of this algorithm is demonstrated in comparison with two well-known algorithms.\",\"PeriodicalId\":42788,\"journal\":{\"name\":\"Journal of Dynamical Systems and Geometric Theories\",\"volume\":\"18 1\",\"pages\":\"15 - 26\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2020-01-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1080/1726037X.2020.1774155\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Dynamical Systems and Geometric Theories\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/1726037X.2020.1774155\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Dynamical Systems and Geometric Theories","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/1726037X.2020.1774155","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
Towards a Novel Family of Algorithms in Pursuit Navigation
Abstract The problem of tracking and navigation towards a moving target is always one of the main topics in robotics. In this paper, following our recent work in the plane, a novel on-line strategy is used to guide a pursuer in space. This strategy is called hybrid pursuit navigation and it is a combination of two well-known pursuit algorithms the pure-pursuit and the pure-rendezvous navigation. To show the reliability of this new method, it is proved that the pursuer reaches the target under the hybrid pursuit navigation. Moreover, by simulating different scenarios, the advantage of this algorithm is demonstrated in comparison with two well-known algorithms.