Path regeneration decisions in a dynamic environment
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Han, Jihee | - |
dc.contributor.author | Seo, Yoonho | - |
dc.date.accessioned | 2021-09-02T10:33:25Z | - |
dc.date.available | 2021-09-02T10:33:25Z | - |
dc.date.created | 2021-06-19 | - |
dc.date.issued | 2018-06 | - |
dc.identifier.issn | 0020-0255 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/75003 | - |
dc.description.abstract | In recent years, much research has been conducted on path replanning in a dynamic environment, as it is considered to be a more complex problem than path planning in a static environment. However, with respect to determining when to replan a path, most research on dynamic path replanning typically generates a new path if obstacles collide with the current path, or with reference to each time unit interval. As these approaches do not focus on effective path regeneration, they result in redundant and unnecessary path regeneration. In this context, this paper proposes an intelligent decision-making mechanism for path regeneration to determine whether a new path should be generated when obstacles move over time. Based on the identification of certain important obstacles, we let these obstacles propagate influence, and then obtain path values that represent the distance between the obstacles and the path. Then, the necessity of path regeneration is determined according to the changes in path values in a dynamic environment. Using this approach, it is possible to both enhance paths in terms of distance and resolve any infeasibilities due to moving obstacles. In the experiment, we test the proposed methodology to verify that appropriate decisions are made, and compare it with other approaches that regenerate a path at each time interval or on collision. Our results show that the paths are regenerated only if it is necessary to improve the current path or to resolve infeasibilities, indicating that effective and intelligent decisions for path regeneration can be obtained using the proposed decision mechanism. (C) 2018 Elsevier Inc. All rights reserved. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER SCIENCE INC | - |
dc.subject | MOBILE ROBOT NAVIGATION | - |
dc.subject | OPTIMIZATION | - |
dc.title | Path regeneration decisions in a dynamic environment | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Seo, Yoonho | - |
dc.identifier.doi | 10.1016/j.ins.2018.03.035 | - |
dc.identifier.scopusid | 2-s2.0-85044108780 | - |
dc.identifier.wosid | 000432646100002 | - |
dc.identifier.bibliographicCitation | INFORMATION SCIENCES, v.450, pp.39 - 52 | - |
dc.relation.isPartOf | INFORMATION SCIENCES | - |
dc.citation.title | INFORMATION SCIENCES | - |
dc.citation.volume | 450 | - |
dc.citation.startPage | 39 | - |
dc.citation.endPage | 52 | - |
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, Information Systems | - |
dc.subject.keywordPlus | MOBILE ROBOT NAVIGATION | - |
dc.subject.keywordPlus | OPTIMIZATION | - |
dc.subject.keywordAuthor | Dynamic environment | - |
dc.subject.keywordAuthor | Path replanning | - |
dc.subject.keywordAuthor | Decision-making | - |
dc.subject.keywordAuthor | Distance propagation | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
145 Anam-ro, Seongbuk-gu, Seoul, 02841, Korea+82-2-3290-2963
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.