• 제어로봇시스템학회논문지
• /
• 제3권3호
• /
• pp.259-264
• /
• 1997

널리 쓰이는 진화 알고리즘은 크게 두가지가 있다. 유전 알고리즘과 진화 기법이 그것이다. 이들 알고리즘은 실행 전에 사용자가 정해주어야 하는 변수들을 가지고 있다. 본 논문에서는 이 두 알고리즘을 일반화시키고 집단의 크기, 교차변이 연산자 적용 확률 그리고 돌연변이 연산자 적용 확률과 같은 변수들을 알고리즘이 수행되는 동안 스스로 정하는 일반화된 자기 형성 진화 알고리즘을 제안한다. 제안된 알고리즘의 타당성과 효용성은 시스템 동정화와 다개체 시스템 제어의 두가지 복잡한 제어 문제에 대한 적용을 통해 보여진다.

• 로봇학회논문지
• /
• 제1권1호
• /
• pp.46-57
• /
• 2006

It is well known that mathematical solutions for multi-agent planning problems are very difficult to obtain due to the complexity of mutual interactions among multi-agent. Most of the past research results thus are based on the probabilistic completeness. However, the practicality and effectiveness of the solution from the probabilistic completeness is significantly reduced by heavy computational burden. In this paper, we propose a practically applicable solution technique for multi-agent planning problems, which assures a reasonable computation time and a real world application for more than 3 multi-agents for the case of general shaped paths in agent movement. First, to reduce the computation time, a collision map is utilized for detecting potential collisions and obtaining collision-free solutions for multi-agents. Second, to minimize the maximum of multi-agent task execution time, a method is developed for selecting an optimal priority order. Simulations are finally provided for more than 20 agents to emphasize the effectiveness of the proposed interactive approach to multi-agent planning problems.

• 로봇학회논문지
• /
• 제6권1호
• /
• pp.1-9
• /
• 2011

An increasing number of researches and developments for personal or professional service robots are attracting a lot of attention and interest industrially and academically during the past decade. Furthermore, the development of intelligent robots is intensively fostered as strategic industry. Until now, most of practical and commercial service robots are worked by remotely operated controller. The most important technical issue of remote control is a wireless communication, especially in the indoor and unstructured environments where communication infrastructures might be destroyed by various disasters. Therefore we propose a multi-robot following navigation method for securing the valid communication distance extension of the remote control based on WPAN(Wireless Personal Area Networks). The concept and implementation of following navigation are introduced and the performance verification is performed through real navigation experiments in real or test-bed environments.

• 제어로봇시스템학회논문지
• /
• 제18권12호
• /
• pp.1122-1131
• /
• 2012

This paper presents obstacle avoidance method for scout robot or industrial robot in unknown environment by using IR sensor and vision system. In the proposed method, robots share the information where the obstacles are located in real-time, thus the robots can choose the best path for obstacle avoidance. Using IR sensor and vision system, multiple robots efficiently evade the obstacles by the proposed cooperation method. No landmark is used at wall or floor in experiment environment. The obstacles don't have specific color or shape. To get the information of the obstacle, vision system extracts the obstacle coordinate by using an image labeling method. The information obtained by IR sensor is about the obstacle range and the locomotion direction to decide the optimal path for avoiding obstacle. The experiment was conducted in $7m{\times}7m$ indoor environment with two-wheeled mobile robots. It is shown that multiple robots efficiently move along the optimal path in cooperation with each other in the space where obstacles are located.

• 제어로봇시스템학회논문지
• /
• 제16권5호
• /
• pp.433-439
• /
• 2010

This paper proposes a beacon color code scheduling algorithm for the localization of multiple robots in a multi-block workspace. With the developments of intelligent robotics and ubiquitous technology, service robots are applicable for the wide area such as airports and train stations where multiple indoor GPS systems are required for the localization of the mobile robots. Indoor localization schemes using ultrasonic sensors have been widely studied due to its cheap price and high accuracy. However, ultrasonic sensors have some shortages of short transmission range and interferences with other ultrasonic signals. In order to use multiple robots in wide workspace concurrently, it is necessary to resolve the interference problem among the multiple robots in the localization process. This paper proposes an indoor localization system for concurrent multiple robots localization in a wide service area which is divided into multi-block for the reliable sensor operation. The beacon color code scheduling algorithm is developed to avoid the signal interferences and to achieve efficient localization with high accuracy and short sampling time. The performance of the proposed localization system is verified through the simulations and the real experiments.

• 전자공학회논문지
• /
• 제51권2호
• /
• pp.220-226
• /
• 2014

본 논문에서는 Passive RFID system으로 구성된 Smart Floor 환경에서 다 개체 로봇의 효율적인 영역 탐색 방법을 제안한다. 연구에서 사용된 Passive RFID system 은 RF 안테나의 인식 범위 내에 있는 RF 태그에 사용자가 원하는 정보를 저장하고 읽을 수 있다. 본 연구에서는 명시적인 위치정보를 저장한 RF 태그를 바닥에 매설한 Smart Floor 라는 환경을 구축하였고, 로봇에 설치되어 있는 안테나를 통하여 태그로부터 받아들인 위치정보를 논문에서 제안하는 방법으로 가공하여 모바일 로봇의 위치를 추정함과 동시에 Smart Floor 내의 다른 로봇에게 자신의 이동 흔적을 남김으로써 기존 탐색 기법에 비해 전체 영역 탐색 시간을 단축하여 효율을 높였다. 본 논문에서는 Smart Floor 환경을 활용하여 모바일 로봇의 효율적인 이동 알고리즘을 제안한다.

• 제어로봇시스템학회논문지
• /
• 제19권5호
• /
• pp.390-397
• /
• 2013

This paper presents a consensus algorithm for uMAS (uncertain Multi-Agent Systems). Unlike previous results in which only nominal models for agents are considered, it is assumed that the uncertain agent model belongs to a known polytope set. In the middle of deriving the proposed algorithm, a convex set is found which includes all uncertainties in the problem using convexity of the polytope set. This set plays an important role in designing the consensus algorithm for uMAS. Based on the set, a consensus condition for uMAS is proposed and the corresponding consensus design problem is solved using LMI (Linear Matrix Inequality). Simulation result shows that the proposed consensus algorithm successfully leads to consensus of the state of uMAS.

• 제어로봇시스템학회논문지
• /
• 제20권12호
• /
• pp.1225-1230
• /
• 2014

This paper investigates the group average-consensus and group formation-consensus problems for first-order multi-agent systems. The control protocol for group consensus is designed by considering the positive adjacency elements. Since each intra-group Laplacian matrix cannot be satisfied with the in-degree balance because of the positive adjacency elements between groups, we decompose the Laplacian matrix into an intra-group Laplacian matrix and an inter-group Laplacian matrix. Moreover, average matrices are used in the control protocol to analyze the stability of multi-agent systems with a fixed and undirected communication topology. Using the graph theory and the Lyapunov functional, stability analysis is performed for group average-consensus and group formation-consensus, respectively. Finally, some simulation results are presented to validate the effectiveness of the proposed control protocol for group consensus.

• 로봇학회논문지
• /
• 제2권3호
• /
• pp.234-241
• /
• 2007

Effective tools which can alleviate the complexity and computational load problem in collision-free motion planning for multi-agent system have steadily been demanded in robotics field. To reduce the complexity, the extended collision map (ECM) which adopts decoupled approach and prioritization is already proposed. In ECM, the collision regions which represent the potential collision of robots are calculated using the computational power; the complexity problem is not resolved completely. In this paper, we propose a mathematical analysis of the extended collision map; as a result, we formulate the collision region as an equation with 5-8 variables. For mathematical analysis, we introduce realistic assumptions as follows; the path of each robot can be approximated to a straight line or an arc and every robot moves with uniform velocity or constant acceleration near the intersection between paths. Our result reduces the computational complexity in comparison with the previous result without losing optimality, because we use simple but exact equations of the collision regions. This result can be widely applicable to coordinated multi-agent motion planning.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2009년도 제40회 하계학술대회
• /
• pp.1638_1639
• /
• 2009

This paper propose a mobile robot for the obstacle avoidance control. The proposed method based on self-organization method is a way to escape of obstacle. Optimal path planning and obstacle avoidance, depending on its final goal will arrive at exactly the mobile robot. Simulation results show the validity of the proposed method.