• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.188-191
• /
• 2011

Path finding and path planning is crucial in today's world where time is an extremely valuable element. It is easy to plan the optimum path to a destination if provided a map but the same cannot be said for an unknown and unexplored environment. It will surely be exhaustive to search and explore for paths to reach the destination, not to mention planning for the optimum path. This is very much similar to finding for an exit of a maze. A very popular competition designed to tackle the maze solving ability of autonomous called Micromouse will be used as a guideline for us to design our maze. There are numerous ways one can think of to solve a maze such as Dijkstra's algorithm, flood fill algorithm, modified flood fill algorithm, partition-central algorithm [1], and potential maze solving algorithm [2]. We will analyze these algorithms from various aspects such as maze solving ability, computational complexity, and also feasibility to be implemented.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.165-167
• /
• 2011

Autonomous robots are intelligent machines that are capable of performing task in the world themselves with little or no human intervention. One of the main reason autonomous robots gained popularity in human's world is their ability to perform task with high degree of precision, accuracy and also consistency. One of the most studied fields in autonomous robot is the ability of decision making in robots. To tackle the ability of robots to make decision, this paper proposed an Autonomous Maze Solving Robot that is able to solve a maze using the optimum solution. The maze and the design of the robot are in compliance with IEEE Micromouse competition rules and regulation. Micromouse is an autonomous maze solving robot that shall be able to explore a maze on its own from a predefined starting location and find the optimum path to reach the predefined goal in the maze without human's intervention.

• Journal of The Korean Association of Information Education
• /
• v.13 no.1
• /
• pp.69-76
• /
• 2009

This paper proposes a teaching plan of programming language class for university of education students amusingly with LEGO Mindstorms NXT robot. The goal of class is not fragmentary knowledge acquirement but problem-solving of maze. This robot communicates with GUI named NXT-G installed in computer via USB. GUI is not text-based but icon-based programming tool. This paper designs a semester with 3 steps such as beginner, intermediate, high-rank. Beginner step is consists of learning of basic functions such as GUI usage and several sensors of robot. Intermediate step is consists of solving of maze problem with low complexity. High-rank step is consists of solving maze problem with medium and high complexity. All maze problem-solving have 3 process with algorithm, flowchart, and programming with stack.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.11
• /
• pp.4167-4173
• /
• 2010

ICT education guidelines revised in 2005 reinforce computer science elements such as algorithm, data structure, and programming covering all schools. It means that goal of computer education is improving problem-solving abilities not using of commercial software. So this paper suggests problem-solving method of maze escape through robots' cooperation in an effort of learning these elements. Problems robots should solve are first-search and role-exchange. First-search problem is that first robot searches maze and send informations about maze to the second robot in real time. Role-exchange problem is that first robot searches maze, but loses its function at any point. At this time second robot takes a role of first robot and performs first robot's missions to the end. To solve these two problems, it goes through four steps; problem analysis, algorithm description, flowchart and programming. Additional effects of our suggestion are chance of cooperation among students and use of queue in data structure. Further researches are use of more generalized mazes, application to real field and a talented curriculum.

• Journal of Digital Convergence
• /
• v.10 no.11
• /
• pp.613-618
• /
• 2012

ICT education guidelines revised in 2005 reinforce computer science elements such as algorithm, data structure, and programming covering all schools. And Ministry of Education emphasizes STEAM education. Most important is that "How instruct them". This means necessity of contents. So this paper suggests learning method of Stack and Queue using LEGO MINDSTORMS NXT. The main purpose is that how stack and queue are used, when robot explore realistic maze. Teaching and learning strategies are algorithm, flowchart, and NXT-G programming. Simple maze has path in left or right, but complex maze has three-way intersection. These are developed by authors. Master robot explores maze and push stack, and then return to entrance using stack. Master robot explores maze and transmits path to slave's queue. And then slave robot drives without exploration. Students can naturally learn principles and applications of them. Through these studies, it can improves ability of logical and creative thinking. Furthermore it can apply to ICT and STEAM education.

• Journal of Korea Game Society
• /
• v.4 no.2
• /
• pp.13-20
• /
• 2004

We have been interested in solving escapee-chaser game. In this game, with avoiding chaser, the escapee must escape from given male. The winning strategies of the escapee are driving the chaser to an intended place and closely evading from chaser by using some walls. According to our experience, some stages of the game are too difficult to solve manually. So we take the model checking method to get a solution of the game. Because the model checking with breadth fist search manner exhaustively searches the all state space of the game, the solution using model checking is best solution, shortest path. Fortunately, during the process of finding solution path, the state space explosion problem didn't occur, and the results of the game solving was applied to embedded system, Lego Mindstorm. Two agents, escapee and chaser, were implemented into robots and several experiments conformed the correctness of our solution.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.210-212
• /
• 2011

Human Computer Interaction is rapidly growing in different aspects and areas. One of the areas that grab many scholars and researchers interest is usability. Usability is a main factor and critical pillar of products success and acceptance. In this paper, we deeply analyze the current usability models that measure the user performance during the interaction with products. Then, we fairly compare between each model to discover and present the strength and weakness of each model for supporting developer and business organization with guidelines during the development process of the products before launching the actual and final one. Decomposing comparison between each model is performed based on specific criteria. Comparison is tabulated, graphically depicted, and analytically decomposed.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.297-298
• /
• 2009

우주나 심해지역과 같이 알려지지 않은 지역의 지형 정보는 알 수 없기 때문에 그 지역을 탐사할 때 시간을 단축하거나 효과적인 방법을 찾는 것은 중요하다. 본 논문에서는 군집 로봇을 통해 가상의 단순한 미로 상황에서 목표물을 운반하는 실험을 하였다. Pyro 시뮬레이션 환경에서 군집로봇을 이용해 미로를 탐색할 때 좌수법 알고리즘을 사용하였다. 단순한 미로 상황에서 하나의 리더 로봇으로 미로를 탐색하는 것과 두 개 이상의 로봇을 이용해 미로를 탐색할 때의 차이를 비교해보고 어떤 방법이 더 효율적인지 알아본다.