• 한국군사과학기술학회지
• /
• 제20권5호
• /
• pp.647-653
• /
• 2017

In this paper, we deal with the experimental verification of 1D virtual force field algorithm based reflexive local path planning on uneven and dusty environment. The existing obstacle detection method on uneven and dusty environment and 1D virtual force field based reflexive local path planning algorithm simply are introduced. Although the 1D virtual force field algorithm is verified by various simulations, additional efforts are needed to verify this algorithm in the real-world. The introduced methods are combined with each other, installed to real mobile platforms and verified by various real experiments.

• 로봇학회논문지
• /
• 제14권4호
• /
• pp.285-292
• /
• 2019

Path planning is an important problem to solve in robotics and there has been many related studies so far. In the previous research, we proposed the Heterogeneous-Ants-Based Path Planner (HAB-PP) for the global path planning of mobile robots. The conventional path planners using grid map had discrete state transitions that constrain the only movement of an agent to multiples of 45 degrees. The HAB-PP provided the smoother path using the heterogeneous ants unlike the conventional path planners based on Ant Colony Optimization (ACO) algorithm. The planner, however, has the problem that the optimization of the path once found is fast but it takes a lot of time to find the first path to the goal point. Also, the HAB-PP often falls into a local optimum solution. To solve these problems, this paper proposes an improved ant-inspired path planner using the Rapidly-exploring Random Tree-star ($RRT^*$). The key ideas are to use $RRT^*$ as the characteristic of another heterogeneous ant and to share the information for the found path through the pheromone field. The comparative simulations with several scenarios verify the performance of the improved HAB-PP.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년도 제37회 하계학술대회 논문집 D
• /
• pp.1958-1959
• /
• 2006

This paper proposes a local path-planning algorithm that enables a mobile robot with vision sensor in a local area.The proposed method based on projective geometry and a wavefront method finds local-paths to avoid collisions using 3-D walls or obstacles map generated using projective geometry. Simulation results show the feasibility of the proposed method

• 전자공학회논문지B
• /
• 제33B권12호
• /
• pp.1-12
• /
• 1996

A new local path planning algorithm using DPH (distance profile histogram) is suggested in this paper. The proposed method makes a grid type world map using distance values from multiple ultrasonic sensors and genrates local points through which the mobile robot can avoid obstcles safely. The DPH (distance profile historgram) represents geometrical arrangement of obstacles around the robot in the local polar coordinate system which is assumed to be atached to the robot. To control robot's navigation, a three-layered control structure is adopted. The proposed local path planning algorithm is placed on the top level. And a point-to-point translation controller takes the middle level. The bottom level consists of a velcoity servo and sonar driver modules which take charge of driving physical hardwares. The validity of the propsoed method is demonstated through several experiments.

• 한국지능시스템학회논문지
• /
• 제21권1호
• /
• pp.19-24
• /
• 2011

본 논문은 국소 경로 계획법을 위한 2차원 센서 환경에서 무정형의 장애물의 회피에 대한 연구를 다루었다. 본 연구는 인공 포텐셜 함수(Artificial Potential Function, APF)를 사용하는 기존의 연구에서 점 형태의 장애물을 다루는 방법을 응용 및 확장한 것으로, 다양한 형태의 크기와 모양을 지니는 장애물에 대해서 두 가지 새로운 형태의 반발 포텐셜 함수를 제안한다. 제안된 방법에 의한 곡률 판단법은 장애물을 단순하게 파악하여, 경로계획에 효율적으로 사용되었다. 실제적인 국소경로 계획법에 맞게 직선 시야(Line of Sight, LOS)와 로봇의 인지범위(Range)등을 고려하는 알고리즘을 사용하였다. 여러장애물 세트(Set)에 대하여 시뮬레이션 결과를 통하여 제안한 방법과 기존 연구의 차이점을 알아보았으며, 제안한 방법의 장점에 대하여 확인하였다.

• 한국지능시스템학회논문지
• /
• 제8권4호
• /
• pp.27-35
• /
• 1998

자율 주행 로봇이 주어진 환경에 대한 정보를 이용하여 장애물을 회피하며 안전하고 효율적으로 목표지점까지 주행하기 위해서는 최적의 이동 경로가 생성되어야 한다. 본 논문에서는 유전 알고리즘을 이용하여 고정 및 움직이는 장애물이 존재하는 작업환경 내에서 전역경로 계획, 지역경로 계획을 결정하는 방법을 제안한다. 이동 로봇은 유전 알고리즘을 이용하여 먼저 최적의 전역 경로를 탐색하고 미지의 장애물을 발견하면 이와 충돌을 회피하기 위해 새로운 지역 경로를 탐색한다. 또한 움직이는 장애물이 작업공한내 존재하면 이동 로봇은 이를 피하기 위해 최적의 경로를 탐색한다. 본 논문에서는 제안한 유전 알고리즘은 기존의 알고리즘에 비해 국부적 최소 값에 빠지지 않고 경로 탐색능력이 효율적임을 확인하였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.421-424
• /
• 1998

본 논문에서는 지역최소점에 도달하는 문제가 발생하지 않으며 빠르고 간편한 방식으로 로보트의 장애물 회피를 할 수 있는 윈도우 분석법을 이용한 새로운 장애물 회피와 경로계획 알고리듬 알고리듬을 제안한다. 미지의 경로상에서 장애물 윈도우에서의 특징을 이용하여 안전한 주행 경로를 선택하며, 장애물 회피를 한다. 시뮬레이션의 결과를 통하여 이 방법의 신회성과 우수성을 입증한다.

• 전기학회논문지
• /
• 제60권2호
• /
• pp.389-397
• /
• 2011

The global dynamic window approach (DWA) is widely used to generate the shortest path of mobile robots considering obstacles and kinematic constraints. However, the dynamic constraints of robots should be considered to generate the minimum-time path. We propose a modified global DWA considering the dynamic constraints of robots. The reference path is generated using A* algorithm and smoothed by cardinal spline function. The trajectory is then generated to follows the reference path in the minimum time considering the robot dynamics. Finally, the local path is generated using the dynamic window which includes additional terms of speed and orientation. Simulation and experimental results are presented to verify the performance of the proposed method.

• 제어로봇시스템학회논문지
• /
• 제21권2호
• /
• pp.115-120
• /
• 2015

Recently, in automotive technology area, intelligent safety systems have been actively accomplished for drivers, passengers, and pedestrians. Also, many researches are focused on development of autonomous vehicles. This paper propose the application of LiDAR sensors, which takes major role in perceiving environment, terrain classification, obstacle data clustering method, and local map building for autonomous driving. Finally, based on these results, planning for lane change path that vehicle tracking possible were created and the reliability of path generation were experimented.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년도 제37회 하계학술대회 논문집 D
• /
• pp.1989-1990
• /
• 2006

This paper presents an escaping route method in a trap situation (a case that the robot is trapped in a local minimum by the potential of obstacles). In this scheme, the APFs for path planning have a multiplicative and auditive configuration between APFs for goal destination and APFs for obstacle avoidance unlike conventional configuration where APFs for obstacle avoidance is added to APFs for goal destination. The virtual escaping route method is proposed to allow a robot to escape from a local minimum in trap situation where the total forces composed of repulsive forces by obstacles and attractive force by a goal are zero.