• DocumentCode
    2752047
  • Title

    Algorithms for Micro-mouse

  • Author

    Sharma, Mukesh ; Robeonics, K.

  • fYear
    2009
  • fDate
    3-5 April 2009
  • Firstpage
    581
  • Lastpage
    585
  • Abstract
    Robotics is not a new word. It has attracted people from all phases of life. The failure of a project in any field mostly occurs due to incomplete analysis of problem or improper planning. Such disappointments can be avoided by adapting a proper approach towards solving a given task. The problem of micro-mouse is 30 years old but its importance in the field of robotics is unparalleled, as it requires a complete analysis & proper planning to solve this problem. This paper covers one of the most important areas of robot, ldquoDecision making Algorithmrdquo or in lay-manpsilas language, ldquoIntelligencerdquo. The environment around the robot is not known, so it must have decision-making capabilities. For starting in the field of micro-mouse it is very difficult to begin with highly sophisticated algorithms. This paper begins with very basic wall follower logic to solve the maze. And gradually improves the algorithm to accurately solve the maze in shortest time with some more intelligence. The Algorithm is developed up to some sophisticated level as Flood fill algorithm.
  • Keywords
    decision making; robots; decision making algorithm; flood fill algorithm; intelligence; micromouse; robotics; Continuous improvement; Decision making; Failure analysis; Floods; Hardware; Intelligent robots; Logic; Navigation; Robotic assembly; Robotics and automation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Future Computer and Communication, 2009. ICFCC 2009. International Conference on
  • Conference_Location
    Kuala Lumpar
  • Print_ISBN
    978-0-7695-3591-3
  • Type

    conf

  • DOI
    10.1109/ICFCC.2009.38
  • Filename
    5189850