Three - Dimensional Tunnel Passing Maneuvers of Mobile Robots

Madhur Verma, Sanjana Chetty, Praviserk Chand, Hafswa Bibi, J. Raj
{"title":"Three - Dimensional Tunnel Passing Maneuvers of Mobile Robots","authors":"Madhur Verma, Sanjana Chetty, Praviserk Chand, Hafswa Bibi, J. Raj","doi":"10.1109/CSDE53843.2021.9718451","DOIUrl":null,"url":null,"abstract":"In this paper, we consider multiple point masses traversing in a 3-dimensional obstacle-ridden environment made up of cylindrical-shaped obstacles, which will act as tunnels. Each point mass will have different targets and avoiding each other and the cylindrical tunnels in its path. The motion of a robot is bounded within a workspace and its velocities are curtailed for safety reasons. Since the workspace is cluttered with 3-dimensional cylindrical shaped objects, we propose a collision-free path that can lead the mobile robot from the desired starting point to the desired location or target. A complete solution to this problem will use the Minimum Distance Technique (MDT) for the generation of the shortest, smoothest and safest path among all the collision-free paths between the initial position and the target. Here, the minimum distance between the center of the point mass, representing a mobile robot, and the surface wall of the cylinder is calculated; thus, only the avoidance of a point on the surface wall of the cylinder is considered. The simulations and derivations are verified by using Mathematica software.","PeriodicalId":166950,"journal":{"name":"2021 IEEE Asia-Pacific Conference on Computer Science and Data Engineering (CSDE)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE Asia-Pacific Conference on Computer Science and Data Engineering (CSDE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSDE53843.2021.9718451","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we consider multiple point masses traversing in a 3-dimensional obstacle-ridden environment made up of cylindrical-shaped obstacles, which will act as tunnels. Each point mass will have different targets and avoiding each other and the cylindrical tunnels in its path. The motion of a robot is bounded within a workspace and its velocities are curtailed for safety reasons. Since the workspace is cluttered with 3-dimensional cylindrical shaped objects, we propose a collision-free path that can lead the mobile robot from the desired starting point to the desired location or target. A complete solution to this problem will use the Minimum Distance Technique (MDT) for the generation of the shortest, smoothest and safest path among all the collision-free paths between the initial position and the target. Here, the minimum distance between the center of the point mass, representing a mobile robot, and the surface wall of the cylinder is calculated; thus, only the avoidance of a point on the surface wall of the cylinder is considered. The simulations and derivations are verified by using Mathematica software.
移动机器人的三维隧道穿越机动
在本文中,我们考虑了在由圆柱形障碍物组成的三维障碍物环境中多点质量的穿越,这些障碍物将充当隧道。每个点质量将有不同的目标,并避免彼此和在其路径上的圆柱形隧道。机器人的运动被限定在一个工作空间内,出于安全原因,它的速度被限制。由于工作空间中充斥着三维圆柱形物体,我们提出了一种无碰撞路径,可以将移动机器人从期望的起点引导到期望的位置或目标。该问题的完整解决方案是使用最小距离技术(MDT)在初始位置和目标之间的所有无碰撞路径中生成最短、最平滑和最安全的路径。在这里,计算代表移动机器人的质点中心与圆柱体表面壁之间的最小距离;因此,只考虑避免圆柱表面壁上的一个点。利用Mathematica软件对仿真和推导结果进行了验证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信