• 자동차안전학회지
• /
• 제11권2호
• /
• pp.29-34
• /
• 2019

This paper presents a new method for construction of a static obstacle map. A static obstacle is important since it is utilized to path planning and decision. Several established approaches generate static obstacle map by grid method and counting algorithm. However, these approaches are occasionally ineffective since the density of LiDAR layer is low. Our approach solved this problem by applying probability theory. First, we converted all LiDAR point to Gaussian distribution to considers an uncertainty of LiDAR point. This Gaussian distribution represents likelihood of obstacle. Second, we modeled dynamic transition of a static obstacle map by adopting the Hidden Markov Model. Due to the dynamic characteristics of the vehicle in relation to the conditions of the next stage only, a more accurate map of the obstacles can be obtained using the Hidden Markov Model. Experimental data obtained from test driving demonstrates that our approach is suitable for mapping static obstacles. In addition, this result shows that our algorithm has an advantage in estimating not only static obstacles but also dynamic characteristics of moving target such as driving vehicles.

• 한국전자통신학회논문지
• /
• 제18권1호
• /
• pp.77-84
• /
• 2023

자율 주행 로봇에서 장애물 회피 기능은 핵심적인 것이다. 포텐셜 필드는 이 분야에 가장 많이 사용되어온 방법이다. 이것은 장애물의 최근접 점을 실시간으로 계산해야 하는데 이를 위해 거리 센서 데이터 프로파일로 부터 안정적으로 장애물 영역을 분할해야 하는 어려움이 있다. 본 논문에서는 분할 없이 각 장애물의 최근접 점을 실시간으로 구할 수 있는 Active Min-Depth Filter를 제안한다. 다양한 센서 노이즈 환경에 대한 시뮬레이션을 통해 Active Min-Depth Filter의 강인성을 확인할 수 있었고 실제 이동 로봇 적용하여 성공적인 결과를 얻었다.

• 정보처리학회논문지B
• /
• 제18B권5호
• /
• pp.255-264
• /
• 2011

본 논문에서는 스테레오 비전기반의 컬럼 검출과 조감도 맵핑을 이용한 전방 차량 검출 알고리즘을 제안한다. 제안된 알고리즘은 실제 복잡한 도로 환경에서 전방 차량을 강건하게 검출할 수 있다. 전체적인 알고리즘은 도로 특징기반의 컬럼 검출, 조감도 기반의 장애물체 세그멘테이션, 차량 특징기반의 영역 재결합, 차량 검증으로 크게 네 단계로 구성되어 있다. 먼저 v-시차맵상에서 최대 빈도값을 이용하여 도로 특징 정보만을 추출한 후, 이를 기반으로 컬럼 검출을 수행한다. 도로 특징 정보는 기존의 중앙값과 달리 도로 환경에 영향을 받지 않아 도로상의 장애물체 유무를 판단하는 기준으로 적절하다. 그러나 다수의 장애물체가 동일한 장애물체로 검출되는 것을 해결하기 위하여 조감도 기반의 세그멘테이션을 수행한다. 조감도는 시차맵과 카메라 정보를 기반으로 계산된 장애물체들의 위치를 평면상에 표시함으로써 장애물체를 쉽게 분리할 수 있다. 그러나 분리된 장애물체 중에는 동일한 장애물체인 경우도 있으므로, 도로상의 차량 특징을 기반으로 장애물체가 동일한지를 판단하여 재결합하는 과정을 수행한다. 마지막으로 시차맵과 그레이 영상기반의 차량 검증 단계를 수행하여 차량만 검출한다. 제안된 알고리즘을 실제 복잡한 도로 영상에 적용함으로써 차량 검증 성능을 검증한다.

• 한국통신학회:학술대회논문집
• /
• 한국통신학회 1988년도 추계학술발표회 논문집
• /
• pp.126-130
• /
• 1988

In this paper the intensity variation of electromagnedtic wave is computed with Huygens Fresnel’s theory using diffraction plaenomethon. An obstacle or an aperture with pertangular type between a transmitter and a receiver is consider and the frequency is selcetde in a car phone system band(870~1500MHz) For numerical analysis Fresnel integral equation is developed which is based on the Kirchhoff’s diffraction theory. The result with the obstacle’s dimension from finite value to extremely large confirms the validity of computer simulation.

• 전기학회논문지
• /
• 제58권4호
• /
• pp.824-831
• /
• 2009

This paper proposes an obstacle avoidance algorithm for an autonomous mobile robot. The proposed method based on the circular navigation with probability distribution finds local-paths to avoid collisions. Futhermore, it makes mobile robots to achieve obstacle avoidance and optimal path planning due to the accurate decision of the final goal. Simulation results are included to show the feasibility of the proposed method.

• 한국수학사학회지
• /
• 제16권3호
• /
• pp.57-68
• /
• 2003

Infinity is very important concept in mathematics. In history of mathematics, potential infinity concept conflicts with actual infinity concept for a long time. It is reason that actual infinity concept causes difficulty in our perceptions. This phenomenon is called epistemological obstacle by Brousseau. So, in this paper, we examine the infinity in terms of mathematical didactics. First, we examine the history of development of infinity and reveal the similarity between the history of debate about infinity and episternological obstacle of students. Next, we investigate obstacle of students about infinity and the contents of curriculum which treat the infinity Finally, we suggest the methods for overcoming obstacle in learning of infinity concept.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.434-439
• /
• 1993

This paper present a sensor based obstacle avoidance method which is based on a VFH(Vector Field Histogram) method. The basic idea of obstacle avoidance is to find a minimum obstacle direction and distance. From the minimum sonar index and the target direction high level system determine steering angle of mobile robot. The sonar sensor system consists of 12 ultra sonic sensor, and each sensor have its direction and safety value. This method has advantage on calculation speed and small memory. This method is implemented on indoor autonomous vehicle'ALiVE-2'.

• 한국지능시스템학회논문지
• /
• 제14권7호
• /
• pp.883-888
• /
• 2004

In this paper, we propose a method to avoid obstacles that have unstable limit cycles in a chaos trajectory surface. We assume all obstacles in the chaos trajectory surface have a Van der Pol equation with an unstable limit cycle. When a chaos UAVs meet an obstacle in an Arnold equation, Chua's equation and hyper-chaos equation trajectory the obstacle reflects the UAV( Unmanned Aerial Vehicle).

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2000년도 추계학술대회 논문집
• /
• pp.691-694
• /
• 2000

In this paper, a motion control algorithm is proposed by using neural network system, which makes a robot arm successfully avoid unexpected obstacle when the robot is moving from the start to the goal position. During the motion, if there is an obstacle the vision system recognizes it. And in every time the optimization-algorithm quickly chooses a motion among the possible motions of robot. The proposed algorithm has a good avoidance characteristic in simulation.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1990년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 26-27 Oct. 1990
• /
• pp.388-393
• /
• 1990

A robot manipulator and an obstacle are described mathematically in joint space, with the mathematical representation for the collision between the robot manipulator and the obstacle. Using these descriptions, the robot motion planning problem is formulated which can be used to avoide a time varying obstacle. To solve the problem, the constraints on motion planning are discretized in joint space. An analytical method is proposed for planning the motion in joint space from a given starting point to the goal point. It is found that solving the inverse kinematics problem is not necessary to get the control input to the joint motion controller for collision avoidance.