追求导航中一类新算法的研究

IF 0.4 Q4 MATHEMATICS
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}
引用次数: 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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
7
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信