• 한국정밀공학회지
• /
• 제15권6호
• /
• pp.107-115
• /
• 1998

A path planning using potential field method is very useful for the real-time navigation of mobile robots. However, the method needs high modeling cost to calculate the potential field because of complex preprocessing, and mobile robots may get stuck into local minima. In this paper, An efficient path planning algorithm for multiple mobile robots, based on the potential field method, was proposed. In the algorithm. the concepts of subgoals and obstacle priority were introduced. The subgoals can be used to escape local minima, or to design and change the paths of mobile robots in the work space. In obstacle priority, all the objects (obstacles and mobile robots) in the work space have their own priorities, and the object having lower priority should avoid the objects having higher priority than it has. In this paper, first, potential based path planning method was introduced, next an efficient collision-avoidance algorithm for multiple mobile robots, moving in the obstacle environment, was proposed by using subgoals and obstacle priority. Finally, the developed algorithm was demonstrated graphically to show the usefulness of the algorithm.

• 한국항공우주학회지
• /
• 제32권7호
• /
• pp.69-75
• /
• 2004

비행중인 다른 항공기를 회피하며 항공기를 목표점까지 유도하는 문제를 2차원 평면에서 고려하였다. 항공기는 속도의 크기가 일정한 질점이며, 제어입력으로 측가속도를 사용하는 것으로 가정하였다. 이동장애물에는 척력 포텐셜함수를 목적점에는 인력 포텐셜함수를 인공적으로 부여하여 항공기에 척력과 인력이 작용하도록 하였다. 유도/회피명령은 이들 포텐셜력과 상대속도를 사용하여 실시간으로 구현 가능한 유도/회피법칙을 구현하였다. Log 형태의 포텐셜함수를 사용하면 구현된 유도법칙은 잘 알려진 비례항법유도법칙이 되며, 회피법칙은 장애물까지 도달시간에 반비례하고 시선각 변화의 반대 방향으로 항공기를 회전시킨다. 제안된 유도/회피법칙은 시뮬레이션을 통하여 타당성을 검증하였다.

• 제어로봇시스템학회논문지
• /
• 제20권2호
• /
• pp.211-217
• /
• 2014

This paper addresses an algorithm of path planning for autonomous driving of a ground vehicle in waypoint navigation. The proposed algorithm is flexible in utilization under a large GPS positioning error and generates collision-free multiple paths while pursuing minimum traveling time. An optimal path reduces inefficient steering by minimizing lateral changes in generated waypoints along a path. Simulation results compare the proposed algorithm with the A* algorithm by manipulation of the steering wheel and traveling time, and show that the proposed algorithm realizes real-time obstacle avoidance by quick processing of path generation, and minimum time traveling by producing paths with small lateral changes while overcoming the very irregular positioning error from the GPS.

• 한국전자파학회:학술대회논문집
• /
• 한국전자파학회 2003년도 종합학술발표회 논문집 Vol.13 No.1
• /
• pp.203-207
• /
• 2003

Due to the inherent nature of the low flying UAV, obstacle detection is a fundamental requirement in the flight path to avoid the collision from obstacles as well as manned aircraft. In this paper, a preliminary sensor requirements of an obstacle detection system for UAV in low-altitude flight are analyzed, and the automated obstacle detection sensor system is proposed assessing both passive and active sensors such as EO camera, IR, Laser radar, microwave and millimeter radar. In addition, TCAS (Traffic Alert and Collision Avoidance System) are reviewed for the collision avoidance of the manned aircraft system. It is suggested that small-sized radar sensor is the best candidate for the smart UAV because an active radar can provide the real-time informations on range and range rate in the all-weather environment. However, an important constraints on small UAV should be resolved in terms of accommodation of the mass, volume, and power allocated in the payload of the UAV system design requirements.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2003년도 춘계학술대회 논문집
• /
• pp.1127-1130
• /
• 2003

This paper introduces histogramic in-motion mapping for real-time map building with the Eyebot in motion. A histogram grid used in HIMM is updated through three PSD sensors. HIMM makes it possible to make fast map-building and avoid obstacles in real-time. Fast map-building allows the robot to immediately use the mapped information in real-time obstacle-avoidance algorithms. HIMM has been tested on the Eyebot. The Eyebot sends PSD data to computer and computer builds a 3D-Map based on PSD data.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2003년도 춘계학술대회 논문집
• /
• pp.321-324
• /
• 2003

There are two steps to solve the self-collision avoidance problems for redundant manipulators. First, all links are regarded as cylinders. and then the collisions should be checked among all pairs of the links. Between two cylinders. we can get the collision information derived from the concept or configuration space obstacle in real time. Therefore. it is possible to detect the links where collisions are likely in real time by setting the risk radius which is larger than actual radius. Second. the configuration control points (CCP) should be placed at the ends of the detected links. A cost function is the sum of the distances between the CCPs. To maximize the cost function means the links go far away each other without self-collisions.

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

In this paper, we construct the infrastructure with wireless LAN for the teleoperating system of mobile robots. For the stable teleoperating system, we develope an algorithm that measure communication time delay on real-time. We propose the force-reflected teleoperation method that control the stiffness of joystick according to VFH(Vector Field Histogram). Also, an obstacle avoidance method using VFH is presented for the mobile robot to move to the indicated direction without collision. Experiments are conducted to demonstrate the feasibility of the proposed methods.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.59.6-59
• /
• 2001

A virtual obstacle method for escaping local minima encountered by sonar-based mobile robot navigation used in real-time obstacle avoidance is presented. The new algorithm judges the mobile robot falls into local minima and helps the mobile robot escape from Et, which regards a concave obstacle as convex or flat one, virtual obstacle method. In the algorithm, it starts to make virtual-obstacle when the mobile robot meets a certain condition, then the robot mores back slowly taking inside area of local minima as obstacle gradually The new algorithm is simulated. The experimental results are presented to demonstrate the usefulness of the method.

• 한국산업융합학회 논문집
• /
• 제17권2호
• /
• pp.42-53
• /
• 2014

Robust voice recognition (RVR) is essential for a robot to communicate with people. One of the main problems with RVR for robots is that robots inevitably real environment noises. The noise is captured with strong power by the microphones, because the noise sources are closed to the microphones. The signal-to-noise ratio of input voice becomes quite low. However, it is possible to estimate the noise by using information on the robot's own motions and postures, because a type of motion/gesture produces almost the same pattern of noise every time it is performed. In this paper, we propose an RVR system which can robustly recognize voice by adults and children in noisy environments. We evaluate the RVR system in a communication robot placed in a real noisy environment. Voice is captured using a wireless microphone. Navigation Strategy is shown Obstacle detection and local map, Design of Goal-seeking Behavior and Avoidance Behavior, Fuzzy Decision Maker and Lower level controller. The final hypothesis is selected based on posterior probability. We then select the task in the motion task library. In the motion control, we also integrate the obstacle avoidance control using ultrasonic sensors. Those are powerful for detecting obstacle with simple algorithm.

• 대한기계학회논문집
• /
• 제17권2호
• /
• pp.267-276
• /
• 1993

본 연구에서는 우선 네트워크의 기본 이론을 소개하고, 이를 바탕으로 로봇의 궤적계획에 이용하기 위한 변수, 구속조건, 에너지를 정의하며, 네트워크가 국부적 최 소 상태에 빠지는 것을 방지하기 위하여 Temperature Adding을 이용한 적절한 가중치 조절로 작업 공간상에 장애물이 정지하고 있는 경우와 장애물이 움직이는 경우, 같은 작업 공간상에서 동시에 움직이는 두 대의 로봇들의 충돌회피문제 등 여러 종류의 궤 적 계획 문제에 적용시켜 보고자 한다. 이와같이 궤적계획 문제를 신경회로를 이용 하여 다루게 되면, 신경회로망의 링크수나 장애물의 변화등 상황의 변화에 따르는 복 잡한 모델링 전개가 필요 없어지고, 여유 자유도를 가지는 경우에도 별도의 성능지수 를 위한 인위적인 조작을 요구하는 알고리즘의 개발이 필요없이 스스로가 최소의 에너 지 상태를 찾아가게 되며, 병렬실(parallel processing) 계산방식으로 각 링크의 위치 를 동시에 구할 수 있게 되어 실시간 제어의 가능성을 제시하여 준다.