Path Planning of an Autonomous Robotic Vehicle for Outdoor Cleaning

A.S. Darsana, P. S. Lal Priya
{"title":"Path Planning of an Autonomous Robotic Vehicle for Outdoor Cleaning","authors":"A.S. Darsana, P. S. Lal Priya","doi":"10.1109/ICCSDET.2018.8821133","DOIUrl":null,"url":null,"abstract":"Path planning of a robot is to find a path through which the robot could maneuver smoothly avoiding all kinds of obstacles. For a cleaning robot, it is mandatory to pass through all the points in a given area or environment unlike other robots which in most cases are meant to find the shortest path between two given points. The main challenges in coverage path is the reduction of repetition rate and reducing the number turns taken by the vehicle. Minimization of the repetition rate, will lead to an increase in the number of turns that are taken by the vehicle. In the proposed method, a new algorithm which reduces the number of turns as well as the repetition rate is been developed. It is compared with one of the latest algorithm and the proposed method is shown to give better results. Obstacle detection is done with the help of ultrasonic sensors. The algorithm was simulated in Python and the kinematic model of the vehicle was developed in Matlab.","PeriodicalId":157362,"journal":{"name":"2018 International Conference on Circuits and Systems in Digital Enterprise Technology (ICCSDET)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Circuits and Systems in Digital Enterprise Technology (ICCSDET)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSDET.2018.8821133","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Path planning of a robot is to find a path through which the robot could maneuver smoothly avoiding all kinds of obstacles. For a cleaning robot, it is mandatory to pass through all the points in a given area or environment unlike other robots which in most cases are meant to find the shortest path between two given points. The main challenges in coverage path is the reduction of repetition rate and reducing the number turns taken by the vehicle. Minimization of the repetition rate, will lead to an increase in the number of turns that are taken by the vehicle. In the proposed method, a new algorithm which reduces the number of turns as well as the repetition rate is been developed. It is compared with one of the latest algorithm and the proposed method is shown to give better results. Obstacle detection is done with the help of ultrasonic sensors. The algorithm was simulated in Python and the kinematic model of the vehicle was developed in Matlab.
自主机器人车辆室外清扫路径规划
机器人的路径规划就是找到一条路径,使机器人能够顺利地避开各种障碍物。对于清洁机器人来说,它必须通过给定区域或环境中的所有点,而其他机器人在大多数情况下是为了找到两个给定点之间的最短路径。覆盖路径的主要挑战是减少重复率和减少车辆的转弯次数。最小化的重复率,将导致车辆所采取的转弯次数的增加。在该方法中,提出了一种减少循环次数和重复率的新算法。将该方法与一种最新算法进行了比较,结果表明该方法具有较好的效果。障碍物检测是借助超声波传感器完成的。在Python中对该算法进行了仿真,并在Matlab中建立了小车的运动学模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信