Madhur Verma, Sanjana Chetty, Praviserk Chand, Hafswa Bibi, J. Raj
{"title":"移动机器人的三维隧道穿越机动","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":"{\"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}","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}
Three - Dimensional Tunnel Passing Maneuvers of Mobile Robots
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.