Surveying Robot Routing Algorithms With Data Mining Approach

  • Maghsoudi R
  • Hoseini S
  • Heidari Y
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Data mining knowledge in response to technological advances in various Rmynh, foot arena is built there. Data Mining face a different situation that the data size is large and we want to build a small model and not too complicated and yet the data as well as describe. Necessity to use data analysis to reduce the amount and the huge volume of information. One important and practical issues in the world of machine intelligence and is robotics robots routing. Robot router has obstacle detection and how to deal with the decision with obstacle. For routing, algorithms including probabilistic methods (filtering particulate), evolutionary algorithms such as genetic, ants social and optimization particle mass, neural methods - Fuzzy, inequality of matrix method based on gradient methods combined sensor information, etc. There are data mining methods in the years 2010-2008 as a technique for routing and a complete robot has been used and still is in progress. Overview of the methods in the paper mentioned in various articles since 2000 has so far. Although many data mining methods include, but mentioned in this article with specific literature data mining will deal with the routing problem.

Cite

CITATION STYLE

APA

Maghsoudi, R., Hoseini, S., & Heidari, Y. (2011). Surveying Robot Routing Algorithms With Data Mining Approach. Journal of Mathematics and Computer Science, 02(02), 284–294. https://doi.org/10.22436/jmcs.002.02.08

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free