Application of Ɛ-testers algorithms under sketch and streaming calculation model in robot navigation

  • Authors:
  • Carlos Rodriguez Lucatero

  • Affiliations:
  • Universidad Autónoma Metropolitana, Department of Information Technology, Hidalgo, Mexico D.F., Mexico

  • Venue:
  • WSEAS Transactions on Computers
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The goal of this article is the application of efficient approximate testing methods for the robot tracking problem as well as for the building map problem. In the Databases field, one wish to classify uncertain data and to answer queries in an approximated way in the case that data sources are incoherent. Our interest is based on the fundamental problems in the randomized approximate testing algorithms. Concerning robot navigation we would like to apply efficient data sketching algorithms for testing the automata inferred on robot motion tracking problems as well as on maps sensorialy generated by robot exploration and building map process. In the case of the information generated by sensors, given that we have no complete access to the information, and given the inherent limitations on memory space, we will apply streaming algorithms for approximate efficiently the solution of computational problems that take place on robot navigation problems.