Path Planning Using Non-Euclidean Metric

Edvards Valbahs, P. Grabusts
{"title":"Path Planning Using Non-Euclidean Metric","authors":"Edvards Valbahs, P. Grabusts","doi":"10.1109/EUROSIM.2013.40","DOIUrl":null,"url":null,"abstract":"In order to achieve the wide range of the robotic application it is necessary to provide iterative motions among points of the goals. For instance, in the industry mobile robots can replace any components between a storehouse and an assembly department. Ammunition replacement is widely used in military services. Working place is possible in ports, airports, waste site and etc. Mobile agents can be used for monitoring if it is necessary to observe control points in the secret place. The paper deals with path planning software for mobile robots. The aim of the research paper is to analyze motion-planning algorithms that contain the design of modelling software. The software is needed as environment modelling to obtain the simulation data. The simulation data give the possibility to conduct the wide analyses for selected algorithm. Analysis means the simulation data interpretation and comparison with other data obtained using the motion planning. The results of the careful analysis were considered for optimal path planning algorithms. The experimental evidence was proposed to demonstrate the effectiveness of the algorithm for steady covered space. The results described in this work can be extended in a number of directions, and applied to other algorithms.","PeriodicalId":386945,"journal":{"name":"2013 8th EUROSIM Congress on Modelling and Simulation","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 8th EUROSIM Congress on Modelling and Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EUROSIM.2013.40","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In order to achieve the wide range of the robotic application it is necessary to provide iterative motions among points of the goals. For instance, in the industry mobile robots can replace any components between a storehouse and an assembly department. Ammunition replacement is widely used in military services. Working place is possible in ports, airports, waste site and etc. Mobile agents can be used for monitoring if it is necessary to observe control points in the secret place. The paper deals with path planning software for mobile robots. The aim of the research paper is to analyze motion-planning algorithms that contain the design of modelling software. The software is needed as environment modelling to obtain the simulation data. The simulation data give the possibility to conduct the wide analyses for selected algorithm. Analysis means the simulation data interpretation and comparison with other data obtained using the motion planning. The results of the careful analysis were considered for optimal path planning algorithms. The experimental evidence was proposed to demonstrate the effectiveness of the algorithm for steady covered space. The results described in this work can be extended in a number of directions, and applied to other algorithms.
使用非欧几里德度量的路径规划
为了实现机器人的广泛应用,需要在目标点之间提供迭代运动。例如,在工业中,移动机器人可以取代仓库和装配部门之间的任何组件。弹药更换在军事服务中被广泛使用。工作地点可在港口、机场、垃圾场等。如果需要在秘密场所观察控制点,可以使用移动代理进行监控。本文研究了移动机器人的路径规划软件。研究论文的目的是分析包含建模软件设计的运动规划算法。需要软件作为环境建模来获取仿真数据。仿真数据提供了对所选算法进行广泛分析的可能性。分析是指对仿真数据进行解释,并与利用运动规划获得的其他数据进行比较。仔细分析的结果被考虑为最优路径规划算法。通过实验验证了该算法对稳定覆盖空间的有效性。在这项工作中描述的结果可以在许多方向上扩展,并应用于其他算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信