• Proceedings of the KIEE Conference
• /
• 2008.10b
• /
• pp.355-356
• /
• 2008

자율이동로봇의 기구학 및 동력학 모델을 통해 로봇의 특성을 고려하여 목표점까지 이동시간이 최소화 되는 경로 생성 방법을 제안한다. 본 논문에서는 초기 전역 경로를 골격선 그래프와 딕스트라알고리즘으로 설정하고, 로봇 기구학 및 동력학 제악조건을 고려하여 동적 프로그래밍으로 경로를 개선한다. 개선된 경로는 자율이동로봇이 이동하는데 걸리는 시간을 단축한다. 마지막으로 시뮬레이션을 통해 제안하는 방법의 성능을 검증한다.

• Journal of Korean Society of Transportation
• /
• v.17 no.2
• /
• pp.163-178
• /
• 1999

Conventional shortest path searching a1gorithms are based on the partial searching method such as Dijsktra, Moore etc. The a1gorithms are effective to find a shortest path in mini-modal condition of a network. On the other hand, in multi-modal case they do not find a shortest path or calculate a shortest cost without network expansion. To copy with the problem, called Searching Area Problem (SAP), a global searching method is developed in this paper with Genetic Algorithm. From the results of two examples, we found that the a1gorithm is useful to solving SAP without network expansion.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.7
• /
• pp.4482-4488
• /
• 2014

This paper proposes the creation scheme of a threat map for robot global path planning. The threat map was generated using neural network theory by analyzing the robot's armament state and the menace information of an enemy or obstacle. In addition, the performance of the suggested method was verified using the compared result of the damage amount and existing robot path data.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.26 no.1
• /
• pp.31-43
• /
• 2023

In this paper, we propose a method for generating a global path for an unmanned vehicle using public data of road section information. First, the method of analyzing road section information of the Ministry of Land, Infrastructure and Transport is presented. Second, we propose a method of preprocessing the acquired road section information and processing it into meaningful data that can be used for global routes. Third, we present a method for generating a global path using the preprocessed road section information. The proposed method has proven its effectiveness through actual autonomous driving experiments of unmanned ground vehicles.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11c
• /
• pp.2431-2434
• /
• 2002

본 논문에서는 전체 영역 경로 계획인 CCPP(Complete Coverage Path Planning)를 이용해 전 청소 영역을 청소하는 방법을 나타내고 청소영역을 해석 하였다. 그리고, Template방법에 CD(Cell Decomposition)을 접목시킨 방법을 이용해 청소영역을 청소 후 재 경로계획으로 청소 안된 영역을 효율적으로 청소하는 방법을 연구하였다. 또한 청소기의 회전 및 직선 모션에 따른 청소 영역을 비교 해석해 최적 시간과 거리에 따른 경로 계획을 살펴보았다.

• ICROS
• /
• v.6 no.4
• /
• pp.28-37
• /
• 2000

본 논문에서는 관리제어시스템의 대상인 이산사건시스템을 하나의 전역 관리제어기 (global supervisor)가 아닌 여러 개의 국소 관리제어기(local supervisor)들의 동시수행 (concurrent action)을 통한 분산관리제어에 대해 알아본다. 반적으로 관리제어 대상시스 템 G 의 사양에 대해 관리제어가 설계가능하면 하나의 전역 관리제어기(S)를 설계하여 관리제어시스템의 언어 L(S/G)를 생성할 수 있다. 이에 반하여, 분산 관리제어이론은 주 어진 사양(specification)에 대해 여러 개의 국소 관리제어기(Si) 들의 동시수행(∧Si/G)를 생성함으로써 전역 관리제어기와 동등한 역할 즉 L(S/G)=L(∧Si/G)을 이루고자 하는 데 그 목적이 있다. 리제어 대상시스템 G의 발생가능한 사건들에 관해 제어가능성과 관측가 능성을 고려하여 모든 사건들이 관측가능할 경우와 관측불가능한 사건들이 존재하는 경 우로 구분하여 분산 관리제어시스템의 설계에 대해 알아본다. 또한 관측 불가능한 경우 와 관측불가능한 사건들이 존재하는 경우로 구분하여 분산 관리제어시스템의 설계에 대 해 알아본다. 또한 관측불가능한 사건들이 존재할 때 사양언어(specification language) K 가 여러 개의 국소사양 (local specification)들의 교집합으로 주어진 경우의 국소 분산 관 리제어와 하나의 전역사양(global specification)으로 주어진 경우의 전역 분산 관리제어 로 세분하여 각각의 분산 관리제어결과가 전역 관리제어결과와 서로 같아질 수 있는 조 건에 대해 알아본다

• Journal of Advanced Navigation Technology
• /
• v.22 no.6
• /
• pp.623-629
• /
• 2018

In this paper, we propose a real-time obstacle detection and avoidance path generation algorithm for UAV. 2-D Lidar is used to detect obstacles, and the detected obstacle data is used to generate real-time histogram for local avoidance path and a 2-D SLAM map used for global avoidance path generation to the target point. The VFH algorithm for local avoidance path generation generates a real-time histogram of how much the obstacles are distributed in the vector direction and distance, and this histogram is used to generate the local avoidance path when detecting near fixed or dynamic obstacles. We propose an algorithm, called modified $RRT^*-Smart$, to overcome existing limitations. That generates global avoidance path to the target point by creating lower costs because nodes are checked whether or not straight path to a target point, and given arbitrary lengths and directionality to the target points when nodes are created. In this paper, we prove the efficient avoidance maneuvering through various simulation experiment environment by creating efficient avoidance paths.

• Journal of Korean Society for Geospatial Information Science
• /
• v.20 no.2
• /
• pp.23-29
• /
• 2012

Existing pedestrian and evacuation models generally seek to find locally optimal solutions for the shortest or the least time paths to exits from individual locations considering pedestrian's characteristics (eg. speed, direction, sex, age, weight and size). These models are not designed to produce globally optimal solutions that reduce the total evacuation time of the entire pedestrians in a building when all of them evacuate at the same time. In this study, we suggest a globally optimal model for indoor pedestrian evacuation to minimize the total evacuation time of occupants in a building considering different distributions of them. We used the genetic algorithm, one of meta-heuristic techniques because minimizing the total evacuation time can not be easily solved by polynomial expressions. We found near-optimal evacuation path and time by expressing varying pedestrians distributions using chromosomes and repeatedly filtering solutions. In order to express and experiment our suggested algorithm, we used CA(cellular automata)-based simulator and applied to different indoor distributions and presented the results.

• The KIPS Transactions:PartB
• /
• v.10B no.3
• /
• pp.237-242
• /
• 2003

Ant Colony System (ACS) Algorithm is new meta heuristic for hard combinatorial optimization problem. It is a population based approach that uses exploitation of positive feedback as well as greedy search. It was first proposed for tackling the well known Traveling Salesman Problem (TSP). In this paper, we introduce ACS of new method that adds reinforcement value for each edge that visit to Local/Global updating rule. and the performance results under various conditions are conducted, and the comparision between the original ACS and the proposed method is shown. It turns out that our proposed method can compete with tile original ACS in terms of solution quality and computation speed to these problem.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.6 no.1
• /
• pp.59-67
• /
• 2003

Multipath is an inevitable error source in radio navigation system such as GPS, it causes signal tracking errors such as carrier tracking errors, code tracking errors. Since code tracking error is a dominant error in absolute positioning, this paper focuses on the improvement of code tracking performance. This paper proposes a method that detects the change of autocorrelation function's slope and mitigates the multipath error. Also, this paper shows the performance evaluation results by post-processing the digitized RF samples.