Path regeneration decisions in a dynamic environment

Jihee Han, Yoon Ho Seo

Research output: Contribution to journalArticle

4 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)39-52
Number of pages14
JournalInformation Sciences
Volume450
DOIs
Publication statusPublished - 2018 Jun 1

Fingerprint

Regeneration
Dynamic Environment
Path
Motion planning
Decision making
Dynamic environment
Infeasibility
Experiments
Resolve
Interval
Path Planning

Keywords

  • Decision-making
  • Distance propagation
  • Dynamic environment
  • Path replanning

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science Applications
  • Information Systems and Management
  • Artificial Intelligence

Cite this

Path regeneration decisions in a dynamic environment. / Han, Jihee; Seo, Yoon Ho.

In: Information Sciences, Vol. 450, 01.06.2018, p. 39-52.

Research output: Contribution to journalArticle

@article{87556e098adf4a66bb9c883dca3570c5,
title = "Path regeneration decisions in a dynamic environment",
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.",
keywords = "Decision-making, Distance propagation, Dynamic environment, Path replanning",
author = "Jihee Han and Seo, {Yoon Ho}",
year = "2018",
month = "6",
day = "1",
doi = "10.1016/j.ins.2018.03.035",
language = "English",
volume = "450",
pages = "39--52",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - Path regeneration decisions in a dynamic environment

AU - Han, Jihee

AU - Seo, Yoon Ho

PY - 2018/6/1

Y1 - 2018/6/1

N2 - 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.

AB - 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.

KW - Decision-making

KW - Distance propagation

KW - Dynamic environment

KW - Path replanning

UR - http://www.scopus.com/inward/record.url?scp=85044108780&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85044108780&partnerID=8YFLogxK

U2 - 10.1016/j.ins.2018.03.035

DO - 10.1016/j.ins.2018.03.035

M3 - Article

AN - SCOPUS:85044108780

VL - 450

SP - 39

EP - 52

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

ER -