Mobile robot path planning with surrounding point set and path improvement
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Han, Jihee | - |
dc.contributor.author | Seo, Yoonho | - |
dc.date.accessioned | 2021-09-03T03:18:10Z | - |
dc.date.available | 2021-09-03T03:18:10Z | - |
dc.date.created | 2021-06-16 | - |
dc.date.issued | 2017-08 | - |
dc.identifier.issn | 1568-4946 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/82631 | - |
dc.description.abstract | The objective of the path planning problem for a mobile robot is to generate a collision-free path from a starting position to a target position with respect to a certain fitness function, such as distance. Although, over the last few decades, path planning has been studied using a number of methodologies, the complicated and dynamic environment increases the complexity of the problem and makes it difficult to find an optimal path in reasonable time. Another issue is the existence of uncertainty in previous approaches. In this paper, we propose a new methodology to solve the path planning problem in two steps. First, the surrounding point set (SPS) is determined where the obstacles are circumscribed by these points. After the initial feasible path is generated based on the SPS, we apply a path improvement algorithm depending upon the former and latter points (PI_FLP), in which each point in the path is repositioned according to two points on either side. Through the SPS, we are able to identify the necessary points for solving path planning problems. PI_FLP can reduce the overall distance of the path, as well as achieve path smoothness. The SPS and PI_FLP algorithms were tested on several maps with obstacles and then compared with other path planning methods As a result, collision-free paths were efficiently and consistently generated, even for maps with narrow geometry and high complexity. (C) 2017 Elsevier B.V. All rights reserved. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER | - |
dc.title | Mobile robot path planning with surrounding point set and path improvement | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Seo, Yoonho | - |
dc.identifier.doi | 10.1016/j.asoc.2017.03.035 | - |
dc.identifier.scopusid | 2-s2.0-85017366183 | - |
dc.identifier.wosid | 000405457200003 | - |
dc.identifier.bibliographicCitation | APPLIED SOFT COMPUTING, v.57, pp.35 - 47 | - |
dc.relation.isPartOf | APPLIED SOFT COMPUTING | - |
dc.citation.title | APPLIED SOFT COMPUTING | - |
dc.citation.volume | 57 | - |
dc.citation.startPage | 35 | - |
dc.citation.endPage | 47 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Interdisciplinary Applications | - |
dc.subject.keywordAuthor | Path planning | - |
dc.subject.keywordAuthor | Mobile robot | - |
dc.subject.keywordAuthor | Surrounding point set | - |
dc.subject.keywordAuthor | Particle swarm optimization | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.