Cited time in webofscience Cited time in scopus

Path planning algorithm using the values clustered by k-means

Title
Path planning algorithm using the values clustered by k-means
Author(s)
Kang, W.-S.Lee, S.-H.Abibullaev, B.Kim, JAn, J.
Issued Date
2010
Citation
15th International Symposium on Artificial Life and Robotics, AROB '10, pp.959 - 962
Type
Conference Paper
ISBN
9784990288044
Abstract
Path planning has been studied focusing on finding the shortest paths or smallest movements. The previous methods, however, are not suitable for stable movements on real environments in which various dynamic obstacles exist. In this paper, we suggest a path planning algorithm that makes the movement of an autonomous robot easier in a dynamic environment. Our focus is based on finding optimal movements for mobile robot to keep going on a stable situation but not on finding shortest paths or smallest movements. The proposed algorithm is based on GA and uses kmeans cluster analysis algorithm to recognize the much more information of obstacles distribution in real-life space. Simulation results confirmed to have better performance and stability of the proposed algorithm. In order to validate our results, we compared with a previous algorithm based on grid maps-based algorithm for static obstacles and dynamic obstacles environment. © 2010 ISAROB.
URI
http://hdl.handle.net/20.500.11750/3964
Publisher
Springer Japan
Related Researcher
  • 강원석 Kang, Won-Seok
  • Research Interests Digital Phenotyping; Data Mining & Machine Learning for Text & Multimedia; Brain-Sense-ICTConvergence Computing; Computational Olfaction Measurement; Simulation&Modeling
Files in This Item:

There are no files associated with this item.

Appears in Collections:
Division of Intelligent Robot 2. Conference Papers
Division of Intelligent Robot Brain Robot Augmented InteractioN(BRAIN) Laboratory 2. Conference Papers

qrcode

  • twitter
  • facebook
  • mendeley

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE