• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.6 no.3
• /
• pp.264-269
• /
• 2006

This paper presents the strategy for searching a hidden object in an unknown area for using by multiple distributed autonomous robotic systems (DARS). To search the target in Markovian space, DARS should recognize th ε ir surrounding at where they are located and generate some rules to act upon by themselves. First of all, DARS obtain 6-distances from itself to environment by infrared sensor which are hexagonally allocated around itself. Second, it calculates 6-areas with those distances then take an action, i.e., turn and move toward where the widest space will be guaranteed. After the action is taken, the value of Q will be updated by relative formula at the state. We set up an experimental environment with five small mobile robots, obstacles, and a target object, and tried to research for a target object while navigating in a un known hallway where some obstacles were placed. In the end of this paper, we present the results of three algorithms - a random search, an area-based action making process to determine the next action of the robot and hexagon-based Q-learning to enhance the area-based action making process.

• Journal of the Society of Naval Architects of Korea
• /
• v.48 no.3
• /
• pp.207-214
• /
• 2011

Ship design requirements described in the building specification should be reflected in the design process. This paper identifies the configuration of requirements mentioned in the building specification using Ontology Representation Language (OWL). Ontology-based semantic search system specifies the requirement items. Through this extraction, building specifications mentioned for each entry are configured to the tree. Tracking requirements for ship design and a set of procedures to instruct is also used for the V model of systems engineering. The semantic search engine of robot agent and ontology can search the requirements specification document and extract the design information. Thereafter, design requirements for the tracking model that proposes the relationship between the associated BOM(bill of material) and product structure.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.3
• /
• pp.291-296
• /
• 2008

This paper presents the dodecagon-based Q-leaning and SVM algorithm for object search with multiple robots. We organized an experimental environment with several mobile robots, obstacles, and an object. Then we sent the robots to a hallway, where some obstacles were tying about, to search for a hidden object. In experiment, we used four different control methods: a random search, a fusion model with Distance-based action making(DBAM) and Area-based action making(ABAM) process to determine the next action of the robots, and hexagon-based Q-learning and dodecagon-based Q-learning and SVM to enhance the fusion model with Distance-based action making(DBAM) and Area-based action making(ABAM) process.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.227-230
• /
• 2007

본 논문에서는 로봇의 목표물 추적을 위하여 SVM을 이용한 12각형 기반의 Q-learning 알고리즘을 제안한다. 제안한 알고리즘의 유효성을 보이기 위해 본 논문에서는 두 대의 로봇과 장애물 그리고 하나의 목표물로 정하고, 각각의 로봇이 숨겨진 목표물을 찾아내는 실험을 가정하여 무작위, DBAM과 AMAB의 융합 모델, 마지막으로는 본 논문에서 제안한 SVM과 12각형 기반의 Q-learning 알고리즘을 이용하여 실험을 수행하고, 이 3가지 방법을 비교하여 본 논문의 유효성을 검증하였다.

• 한국정보교육학회:학술대회논문집
• /
• 2007.08a
• /
• pp.161-166
• /
• 2007

앞으로 우리의 삶에서 로봇은 빼 놓을 수 없는 존재이기에 미래를 지향하는 우리의 교육은 이에 걸 맞는 교육을 설계하고 시행해야 하지만 로봇을 구입해야 하는 재정적 여건으로 실시되지 못 하는 학교가 많다. 그래서 본 논문은 로봇교육 내용 중 높은 사고력과 문제 해결력을 요구하는 미로탐색 알고리즘 내용을 분석하여 초등학생의 수준에 맞는 교육내용을 설계하고자 한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.293-298
• /
• 1993

In this paper, methods for computing the time-optimal motion of a robotic manipulator are presented that considers the nonlinear manipulator dynamics, actuator constraints, joint limits, and obstacles. The optimization problem can be reduced to a search for the time-optimal path in the n-dimensional position space. These paths are further optimized with a local path optimization to yield a global optimal solution. Time-optimal motion of a robot with an articulated arm is presented as an example.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.1
• /
• pp.130-134
• /
• 2012

In this paper, we propose a space partitioning technique for swarm robots by using the Centroidal Voronoi Tessellation. The proposed method consists of two parts such as space partition and collision avoidance. The space partition for searching a given space is carried out by a density function which is generated by some accidents. The collision avoidance is implemented by the potential field method. Finally, the numerical experiments show the effectiveness and feasibility of the proposed method.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.1
• /
• pp.58-63
• /
• 2020

This paper proposes the method for improving the localization accuracy of the mobile robot based on the stereo camera. To restore the position information from stereo images obtained by the stereo camera, the corresponding point which corresponds to one pixel on the left image should be found on the right image. For this, there is the general method to search for corresponding point by calculating the similarity of pixel with pixels on the epipolar line. However, there are some disadvantages because all pixels on the epipolar line should be calculated and the similarity is calculated by only pixel value like RGB color space. To make up for this weak point, this paper implements the method to search for the corresponding point simply by calculating the gap of x-coordinate when the feature points, which are extracted by feature extraction and matched by feature matching method, are a pair and located on the same y-coordinate on the left/right image. In addition, the proposed method tries to preserve the number of feature points as much as possible by finding the corresponding points through the conventional algorithm in case of unmatched features. Because the number of the feature points has effect on the accuracy of the localization. The position of the mobile robot is compensated based on 3-D coordinates of the features which are restored by the feature points and corresponding points. As experimental results, by the proposed method, the number of the feature points are increased for compensating the position and the position of the mobile robot can be compensated more than only feature extraction.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1048-1053
• /
• 2005

This paper presents design and integration of the ROBHAZ-DT3, which is a newly developed mobile robot system with chained double-track mechanisms. A passive adaptation mechanism equipped between the front and rear body enables the ROBHAZ-DT3 to have good adaptability to uneven terrains including stairs. The passive adaptation mechanism reduces energy consumption when moving on uneven terrain as well as its simplicity in design and remote control, since no actuator is necessary for adaptation. Based on this novel mobile platform, a rescue version of the ROBHAZ-DT3 with appropriate sensors and a semi-autonomous mapping and localization algorithm is developed to participate in the RoboCup2004 US-Open: Urban Search and Rescue Competition. From the various experiments in the realistic rescue arena, we can verify that the ROBHAZ-DT3 is reliable in traveling rugged terrain and the proposed mapping and localization algorithm are effective in the unstructured environment with uneven ground. The another application is an military robot for an EOD(Explosive Ordnance Disposal) and reconnaissance mission. The military version of the ROBHAZ-DT3 with a water disrupter, a thermal scope and a long distance wireless communication device is developed and sent to the area of military tactics in Iraq. Consequently, the feasibility of the military version of ROBHAZ-DT3 is verified.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.4
• /
• pp.25-32
• /
• 2015

The Genetic algorithm is a search algorithm using evaluation, genetic operator, natural selection to populational solution iteratively. The convergence and divergence characteristic of genetic algorithm are affected by selection strategy, generation replacement method, genetic operator when genetic algorithm is designed. This paper proposes fast convergence genetic algorithm for time-limited robot path planning. In urgent situation, genetic algorithm for robot path planning does not have enough time for computation, resulting in quality degradation of found path. Proposed genetic algorithm uses fast converging selection strategy and generation replacement method. Proposed genetic algorithm also uses not only traditional crossover and mutation operator but additional genetic operator for shortening the distance of found path. In this way, proposed genetic algorithm find reasonable path in time-limited situation.