Multi Objective Path Planning in Static Environment using Region of Sight

Hiba Hliwa, Bassam Atieh
{"title":"Multi Objective Path Planning in Static Environment using Region of Sight","authors":"Hiba Hliwa, Bassam Atieh","doi":"10.1109/REEPE49198.2020.9059199","DOIUrl":null,"url":null,"abstract":"Finding appropriate path, that avoids the hurdles and reach the goal in optimal way, has been an interesting challenge in recent years. In this paper, we present a new method for robot path planning in a static environment. The main aim; to tackle path planning in simple and fast method, seeks to satisfy many robot movement's requirements such as shortest path length, safety, smoothness with less time consuming. This method ensures that safety and smoothness criteria are already met, path length is then shortening the usage of environment details, where each point of this path can be seen only by its previous and next points. The obtained result is compared with the well-known methods and shows the superiority in simple and complex environments in term of time, smoothness and safety and the obtained path lengths are shorter than those obtained with PSO and ABC as well.","PeriodicalId":142369,"journal":{"name":"2020 International Youth Conference on Radio Electronics, Electrical and Power Engineering (REEPE)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Youth Conference on Radio Electronics, Electrical and Power Engineering (REEPE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/REEPE49198.2020.9059199","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Finding appropriate path, that avoids the hurdles and reach the goal in optimal way, has been an interesting challenge in recent years. In this paper, we present a new method for robot path planning in a static environment. The main aim; to tackle path planning in simple and fast method, seeks to satisfy many robot movement's requirements such as shortest path length, safety, smoothness with less time consuming. This method ensures that safety and smoothness criteria are already met, path length is then shortening the usage of environment details, where each point of this path can be seen only by its previous and next points. The obtained result is compared with the well-known methods and shows the superiority in simple and complex environments in term of time, smoothness and safety and the obtained path lengths are shorter than those obtained with PSO and ABC as well.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于视觉区域的静态环境多目标路径规划
寻找合适的路径,避免障碍,以最优的方式达到目标,是近年来一个有趣的挑战。本文提出了一种静态环境下机器人路径规划的新方法。主要目的;以简单、快速的方法解决路径规划问题,力求在最短的路径长度、安全性、平稳性等方面满足机器人运动的要求,同时减少时间消耗。这种方法确保了安全性和平滑性标准已经满足,路径长度缩短了环境细节的使用,其中路径的每个点只能通过它的前一个点和下一个点看到。结果表明,该算法在简单和复杂环境下均具有时间、平稳性和安全性方面的优势,且路径长度也比PSO算法和ABC算法短。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Practical Research of Efficiency of the Installation Etro-02 Ozonizer Based on the Corona Discharge Evaluation of Operational Efficiency of Agent- Based Microgrid in Arctic Enclave TPP Generating Unit Technical and Economic Index Accuracy Increase Discrimination Between Power Swing and Faults in Series Compensated Transmission Lines Using the Piecewise Linear Spline Wavelet Investigating of the Accuracy of Vehicles Mutual Positioning Using Smartphones
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1