{"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.