• 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.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.7
• /
• pp.614-619
• /
• 2013

In multi-robot systems, ultrasonic sensors are widely used for localization and/or obstacle detection. However, conventional ultrasonic sensors have a drawback, that is, the interference problem among ultrasonic transmitters. There are some previous studies to avoid interferences, such as TDMA (Time Division Multiple Access) and CDMA (Code Division Multiple Access). In multiple autonomous mobile robots systems, the Doppler-effect has to be considered because ultrasonic transceivers are attached to the moving robots. To overcome this problem, we find out the ASK (Amplitude Shift Keying)-CDMA technique is more robust to the Doppler-effect than the BPSK (Binary Phase Shift Keying)-CDMA technique. In this paper, we propose a new code-expression method and a Monte-Carlo based algorithm that optimizes the ultrasonic code combination in the ASK-CDMA ultrasonic system. The experimental results show that the proposed algorithm improves the performance of the ultrasonic multiple accessing capacity in the ASK-CDMA ultrasonic system.

• The Journal of the Korea Contents Association
• /
• v.21 no.1
• /
• pp.541-551
• /
• 2021

Among the numerous duties of a librarian in a library, the work of arranging books is a job that the librarian has to do one by one. Thus, the cost of labor and time is large. In order to solve this problem, the interest in book-arranging robots based on artificial intelligence has recently increased. In this paper, we propose the K-ACO algorithm, which is the shortest path algorithm for multi-stops that can be applied to the library book arrangement robots. The proposed K-ACO algorithm assumes multiple robots rather than one robot. In addition, the K-ACO improves the ANT algorithm to create K clusters and provides the shortest path for each cluster. In this paper, the performance analysis of the proposed algorithm was carried out from the perspective of book arrangement time. The proposed algorithm, the K-ACO algorithm, was applied to a university library and compared with the current book arrangement algorithm. Through the simulation, we found that the proposed algorithm can allocate fairly, without biasing the work of arranging books, and ultimately significantly reduce the time to complete the entire work. Through the results of this study, we expect to improve quality services in the library by reducing the labor and time costs required for arranging books.

• Journal of the Institute of Convergence Signal Processing
• /
• v.19 no.2
• /
• pp.77-88
• /
• 2018

This paper proposes a RBFNN(Radial Basis Function Neural Network) based decentralized adaptive tracking control scheme using PSO(Particle Swarm Optimization) for an uncertain electrically driven robot system with input saturation. Practically, the magnitudes of input voltage and current signals are limited due to the saturation of actuators in robot systems. The proposed controller overcomes this input saturation and does not require any robot link and actuator model parameters. The fitness function used in the presented PSO scheme is expressed as a multi-objective function including the magnitudes of voltages and currents as well as the tracking errors. Using a PSO scheme, the control gains and the number of the RBFs are tuned automatically and thus the performance of the control system is improved. The stability of the total control system is guaranteed by the Lyapunov stability analysis. The validity and robustness of the proposed control scheme are verified through simulation results.

• ICROS
• /
• v.18 no.2
• /
• pp.21-29
• /
• 2012

최근 자동차 연구개발에 있어 내연기관을 대체하는 친환경 자동차기술과 더불어 무인자동차, 자율주행기술이 많은 부분에서 시도되고 실현되어가고 있다. 지능형 자동차라는 개념에서 적용되었던 운전자안전보조시스템, 편의지원과 사고경감 시스템 등이 하나로 통합되어 무인자동차 기술로 발전하고 있다. 또 차량에 고가의 센서를 장착하여 주변환경이나 운전자를 모니터링하는 방식에서 IT 융합기술을 이용한 네트워크기술 (V2I, V2V, V2N & V2X)을 접목시키는 방안을 통하여 개개의 차량은 물론 교통체계의 전체적인 변화를 추구하고 있다. 이러한 첨단차량기술은 새로운 교통문화(차량공유시스템, 군집주행)의 개발과 또다른 교통체계의 연구로 확장되어가고 있다.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.5
• /
• pp.385-389
• /
• 2013

This paper proposes the leader-follower based formation control method for multiple mobile robots. The controller is designed using the measurements of the follower robot such as the relative distance and angle between the leader and the follower. This means that the follower robot does not require the information of the leader robot while keeping the desired formation. Therefore, the proposed control method can reduce the communication loss and the cost for hardware. From Lyapunov stability theory, it is shown that all error signals in the closed-loop system are uniformly ultimately bounded. Finally, simulation results demonstrate the effectiveness of the proposed control system.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2013.05a
• /
• pp.425-426
• /
• 2013

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.11a
• /
• pp.64-65
• /
• 2010

• 한국HCI학회:학술대회논문집
• /
• 2006.02a
• /
• pp.1289-1297
• /
• 2006

모든 곳에 존재하는 네트워크 환경을 의미하는 '유비쿼터스' 시대와 최신 기술로 구현되어 인간을 도와주는 '지능형 로봇'의 시대가 도래하고 있다. 기술의 흐름은, 이제 우리에게 공장과 공원 등의 공공 장소뿐 만이 아니라, 생활의 기본이 되는 가정 안에서의 로봇을 받아들일 준비를 요구하고 있다. 로봇과 사용자는 실제 생활 속에서 많은 상호 작용을 하게 되며, 필연적으로 여러 가지의 불확실성을 내포하게 되는데, 각각의 요청들과 상황들은, 미리 정해진 규칙에 의거해 처리하기에는 너무 다양하다. 그 어려움을 극복하는 방법으로, 어떤 상황에 적응하는 방법으로 기억을 사용 하는 인간과 마찬가지로, 로봇은 새로운 요청을 처리하기 위해 과거의 기록을 사용할 수 있다. 여러 가지 과거의 기록들을 잘 정리해서 분류하여 저장해둔 후, 현재의 요청에 대한 답으로, 가장 가능성 있는 과거의 기록을 찾아내는 것이다. 본 논문에서는 사용자와 로봇 사이에서 상호 작용에서 발생할 수 있는 불확실성을 과거기록의 탐색을 통해 해결하고자 하였다. 과거 기록은 시간, 장소, 대상 물건, 행동 유형으로 구분되어 저장하였으며, 각각의 유사 가능성(Possibility)들의 합을 기준으로, 전체 기록을 K-Means 알고리즘을 통하여 군집화하고 협력 필터링을 기반으로 현재의 요청이 담고 있는 불확실성에 대한 가능성 있는 값을 추천해 주었다. 제한된 공간과 제한된 자료의 수에 의한 실험 결과로서의 한계를 가지고 있지만, 실제 가정용 로봇에서의 적용 가능성을 보여주었다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.6
• /
• pp.1441-1446
• /
• 2014

For the escape from a maze, the cooperative method by robot swarm was proposed in this paper. The robots can freely move by collecting essential data and making a decision in the use of sensors; however, a central control system is required to organize all robots for the escape from the maze. The robots explore new mazes and then send the information to the system for analyzing and mapping the escaping route. Three issues were considered as follows for the effective escape by multiple robots from the mazes in this paper. In the first, the mazes began to divide and secondly, dead-ends should be blocked. Finally, after the first arrivals at the destination, a shortcut should be provided for rapid escaping from the maze. The parallel-escape algorithms were applied to the different size of mazes, so that robot swarm can effectively get away the mazes.