Small size autonomous mobile robot for finding the way out of a maze

• Autorzy: Olek K. , Mcura T. , Przystałka P.
• Języki publikacji: EN

Abstrakty

EN

The main objective of this paper focuses on the prototype of a small size autonomous mobile robot that can be used in order to solve the maze problem. This kind of robots are often called micromouse. The paper presents the most important considerations deal with the design and realization of the robot. As a consequence, the mechanical, electrical and software components of the robot are briefly described. Moreover, the paper also includes some results of verification tests that were obtained in the international competitions.

Słowa kluczowe

EN

mobile robot; issue maze; autonomous mobile robot

PL

robot mobilny; problem labiryntu; robot mobilny autonomiczny

• Wydawca: Instytut Automatyzacji Procesów Technologicznych i Zintegrowanych Systemów Wytwarzania Politechniki Śląskiej
• Czasopismo: Selected Engineering Problems
• Rocznik: 2012
• Tom: nr 3
• Strony: 161--166

Twórcy

autor

Olek K.

• Institute of Fundamentals of Machinery Design, Faculty of Mechanical Engineering, Silesian University of Technology, Gliwice, Poland

autor

Mcura T.

• Institute of Fundamentals of Machinery Design, Faculty of Mechanical Engineering, Silesian University of Technology, Gliwice, Poland

autor

Przystałka P.

• Institute of Fundamentals of Machinery Design, Faculty of Mechanical Engineering, Silesian University of Technology, Gliwice, Poland

Bibliografia

• 1.Szmigielski A. Ciesielski P., Sawoniewicz J.: Elementy robotyki mobilnej. Wydawnictwo PJWSTK, Warszawa, 2004, (In Polish).
• 2.Home site of the competition Robotic Arena: http://lirec.ict.pwr.wroc.pl/~arena/, 21.10.2012
• 3.Home site of the competition Robomaticon http://www.robomaticon.pl/pl/index, 20.10.2012
• 4. IEEE Region 2 Student Activities Conference 2007 - Micromouse Competition Rules,
• http://www.ieee.uc.edu/main/files/sac2007/mm_rules.pdf - 20.10.2012.
• 5.Cormen, Thomas H.; Leiserson, Charles E., Rivest, Ronald L.: Introduction to Algorithms. MIT Press and McGraw-Hill., Third Edition. MIT Press, 2009, Section 24.1: The Bellman–Ford algorithm, pp. 651–655.