EKF and K-means to Generate Optimized Paths of a Mobile Robot

Finding optimized path in the workspace is one of the fundamental problems to solve for an autonomous mobile robot. Avoiding obstacles and building an efficient trajectory is the key goal. For this reason, a mobile robot has to manage the free configuration space very efficiently for the purpose of path planning and navigation. Partitioning the configuration space will make the path planning task easy, faster and efficient. Also, data read by the sensor has some inherent noise. So we implement an algorithm to make an efficient estimation of the future states to build map that helps manage the environment efficiently to find the optimized paths to destination. We apply Extended Kalman Filter (EKF) to find the accurate estimation on sensor data and then K-means clustering algorithm to find the next landmarks avoiding the obstacles.

[1]  Howie Choset,et al.  Coverage for robotics – A survey of recent results , 2001, Annals of Mathematics and Artificial Intelligence.

[2]  Lydia E. Kavraki,et al.  Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..

[3]  Ralph L. Hollis,et al.  Contact sensor-based coverage of rectilinear environments , 1999, Proceedings of the 1999 IEEE International Symposium on Intelligent Control Intelligent Systems and Semiotics (Cat. No.99CH37014).

[4]  J. L. Roux An Introduction to the Kalman Filter , 2003 .

[5]  Rafael Murrieta-Cid,et al.  Exploration and map-building under uncertainty with multiple heterogeneous robots , 2011, 2011 IEEE International Conference on Robotics and Automation.

[6]  Yu-Cheol Lee,et al.  Practical map building method for service robot using EKF localization based on statistical distribution of noise parameters , 2009, RO-MAN 2009 - The 18th IEEE International Symposium on Robot and Human Interactive Communication.

[7]  Jie Chen,et al.  Combined complete coverage path planning for autonomous mobile robot in indoor environment , 2009, 2009 7th Asian Control Conference.

[8]  Ju Yong Park,et al.  A study on the cleaning algorithm for autonomous mobile robot under the unknown environment , 1997, Proceedings 6th IEEE International Workshop on Robot and Human Communication. RO-MAN'97 SENDAI.

[9]  Anthony Stentz,et al.  Optimal and efficient path planning for partially-known environments , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[10]  Thierry Siméon,et al.  Sampling-Based Path Planning on Configuration-Space Costmaps , 2010, IEEE Transactions on Robotics.

[11]  Wan Kyun Chung,et al.  Effective Maximum Likelihood Grid Map With Conflict Evaluation Filter Using Sonar Sensors , 2009, IEEE Transactions on Robotics.

[12]  Howie Choset,et al.  Principles of Robot Motion: Theory, Algorithms, and Implementation ERRATA!!!! 1 , 2007 .

[13]  Mark H. Overmars,et al.  Creating High-quality Paths for Motion Planning , 2007, Int. J. Robotics Res..

[14]  Vladimir J. Lumelsky,et al.  Dynamic path planning in sensor-based terrain acquisition , 1990, IEEE Trans. Robotics Autom..

[15]  Chaomin Luo,et al.  A Bioinspired Neural Network for Real-Time Concurrent Map Building and Complete Coverage Robot Navigation in Unknown Environments , 2008, IEEE Transactions on Neural Networks.

[16]  António Paulo Moreira,et al.  Localization of Mobile Robots Using an Extended Kalman Filter in a LEGO NXT , 2012, IEEE Transactions on Education.

[17]  S. LaValle Rapidly-exploring random trees : a new tool for path planning , 1998 .

[18]  D. Napoleon,et al.  An efficient K-Means clustering algorithm for reducing time complexity using uniform distribution data points , 2010, Trendz in Information Sciences & Computing(TISC2010).

[19]  Lydia E. Kavraki,et al.  Analysis of probabilistic roadmaps for path planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[20]  Rui Araújo,et al.  Prune-Able Fuzzy ART Neural Architecture for Robot Map Learning and Navigation in Dynamic Environments , 2006, IEEE Transactions on Neural Networks.

[21]  Makoto Yamada,et al.  Cleaning robot control , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[22]  Reda Guernane,et al.  Generating optimized paths for motion planning , 2011, Robotics Auton. Syst..

[23]  Nancy M. Amato,et al.  Extracting optimal paths from roadmaps for motion planning , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[24]  Yukinori Kobayashi,et al.  Robot Mapping Using k-means Clustering Of Laser Range Sensor Data , 2012 .

[25]  Jing-Yu Yang,et al.  Online topological map building and qualitative localization in large-scale environment , 2010, Robotics Auton. Syst..

[26]  Hyun Myung,et al.  Virtual Door-Based Coverage Path Planning for Mobile Robot , 2009, FIRA RoboWorld Congress.