Cited 0 time in
Cited 0 time in
Path planning algorithm using the values clustered by k-means
- Path planning algorithm using the values clustered by k-means
- Kang, W.-S.[Kang, W.-S.]; Lee, S.-H.[Lee, S.-H.]; Abibullaev, B.[Abibullaev, B.]; Kim, J.-W.[Kim, J]; An, J.[An, J.]
- DGIST Authors
- Kang, W.-S.[Kang, W.-S.]; Abibullaev, B.[Abibullaev, B.]; Kim, J.-W.[Kim, J]; An, J.[An, J.]
- Issue Date
- 15th International Symposium on Artificial Life and Robotics, AROB '10, 959-962
- Article Type
- Conference Paper
- 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.
- Springer Japan
- Related Researcher
There are no files associated with this item.
- Convergence Research Center for Wellness2. Conference Papers
ETC2. Conference Papers
Information and Communication EngineeringInfoLab2. Conference Papers
Division of IoT∙Robotics Convergence Research2. Conference Papers
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.