• 제어로봇시스템학회논문지
• /
• 제14권11호
• /
• pp.1130-1138
• /
• 2008

A mobile robot should be designed to navigate with collision avoidance capability in the real world, coping with the changing environment flexibly. In this paper, a novel navigation method is proposed for fast moving mobile robots using limit-cycle characteristics of the 2nd-order nonlinear function. It can be applied to robots in dynamically changing environment such as the robot soccer. By adjusting the radius of the motion circle and the direction of the obstacle avoidance, the mobile robot can avoid the collision with obstacles and move to the destination point. To demonstrate the effectiveness and applicability, it is applied to the robot soccer. Simulations and real experiments ascertain the merits of the proposed method.

• 대한기계학회논문집A
• /
• 제26권12호
• /
• pp.2678-2686
• /
• 2002

A novel approach is developed for avoidance of obstacles in unknown environment. This paper proposes a new way of intelligent autonomous wheelchairs for the handicapped to move safely and comfortably. It is the objective of this paper to develop delayed time fuzzy control algorithms to deal with various obstacles. This new algorithm gives the benefit of the collision free movement in real time and optimal path to the moving target. The computer simulations and the experiments are demonstrated to the effect of the suggested control method.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.74-79
• /
• 2005

In this paper, we propose a novel approach to decentralized motion planning and conflict-resolution for multiple mobile agents working in an environment with unexpected moving obstacles. Our proposed motion planner has two characteristics. One is a real-time collision prognosis based on modified collision map. Collision map is a famous centralized motion planner with low computation load, and the collision prognosis hands over these characteristics. And the collision prognosis is based on current robots status, maximum robot speeds, maximum robot accelerations, and path information produced from off-line path planning procedure, so it is applicable to motion planner for multiple agents in a dynamic environment. The other characteristic is that motion controller architecture is based on potential field method, which is capable of integrating robot guidance to the goals with collision avoidance. For the architecture, we define virtual obstacles making delay time for collision avoidance from the real-time collision prognosis. Finally the results obtained from realistic simulation of a multi-robot environment with unknown moving obstacles demonstrate safety and efficiency of the proposed method.

• 대한기계학회논문집A
• /
• 제38권11호
• /
• pp.1193-1199
• /
• 2014

서비스 로봇이 충돌안전성을 확보한 상태에서 고속 주행 임무를 수행하기 위해서는 동적 장애물의 속도를 고려한 궤적 계획이 필요하다. 정적 장애물만을 고려한 상태에서 궤적을 계획하는 경우 장애물과의 상대속도로 인해서 로봇이 장애물과 충돌할 수 있다. 본 연구에서는 동적 장애물의 속도를 고려한 궤적시간조정기법을 제안한다. 제안된 기법을 통해서 기존에 생성된 궤적의 시간을 조정해서 장애물 회피가 가능한지를 평가할 수 있다. 만일 회피가 불가능할 경우 생성된 경로가 아닌 다른 경로를 선택할 수 있다. 모의 시험 결과를 통해서 제안된 기법을 통해서 짧은 시간 내에 장애물 회피를 수행할 수 있음을 보였다.

• 전자공학회논문지SC
• /
• 제43권6호
• /
• pp.1-8
• /
• 2006

이동로봇의 경로 설정과 장애물 회피에 관한 문제는 이동로봇을 제어하기 위한 기본적인 문제로서 지금까지 많은 연구가 진행되어 오고 있다. 다양한 센서들로부터 얻어지는 정보는 로봇이 진행하기 위한 경로에 대한 결정과 장애물에 대한 정보를 제공해준다. 대부분의 연구들은 제한 조건이 존재하는 경우에서 그 상황에 알맞은 방법들이 대부분이며, 다른 상황을 해결하기에는 어려움이 있다. 또한, 최적화된 경로에 대한 좋은 결과를 만들기 위해서는 복잡한 계산 과정을 통해서 시간 지연이 발생하게 된다. 이와 같은 처리 방법은 움직이는 장애물의 회피와 같이 빠른 처리를 필요로 하는 상황에서 단점으로 작용한다. 본 논문에서는 장애물과 이동 가능한 경로들의 영역을 작은 영역들이 분포하는 공간으로 변형하고 이와 같이 구성된 공간에서 밀도와 연결 상태를 통해 이동 로봇이 진행 할 수 있는 최단 경로를 결정하는 방법을 제안한다. 제안된 방법에서 작은 영역들은 자신의 번호를 가지게 되며, 주변 영역들의 개수를 통해 이동 경로를 결정하게 된다.

• 한국산업융합학회 논문집
• /
• 제25권5호
• /
• pp.853-859
• /
• 2022

In this study, we analyzed the instantaneous trajectory generation capability and target arrival rate of a mobile robot by changing the parameter of the TEB (Timed Elastic Band) Local Planner among local planners that affect the instantaneous obstacle avoidance ability of the mobile robot using ROS (Robot Operating System) simulation and real experience. As a result, we can expect a decrease in the target arrival time of the mobile robot through a decrease in the parameter values of the TEB Local Planner's min_obstacle_dist, inflation_dist, and penalty_epsilon. However, if this parameter is reduced too much, the risk of obstacle collision of the moving robot is increases, so it is important to combine the appropriate values to construct the parameter.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.486-491
• /
• 2005

There come various types of robot with researches for mobile robot. This paper introduces the multi-joint snake robot having 16 degree of freedom and composing of eight-axis. The biological snake robot uses the forward movement friction and the proposed artificial snake robot uses the un-powered wheel instead of the body of snake. To determine the enable joint angle of each joint, the controller inputs are considered such as color and distance using PC Camera and ultra-sonic sensor module, respectively. The movement method of snake robot is sequential moving from head to tail through body. The target for movement direction is decided by a certain article be displayed in the PC Camera. In moving toward that target, if there is any obstacle then the snake robot can avoid by itself. In this paper, we show the method of snake robot for tracing the target with experiment.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -2
• /
• pp.790-793
• /
• 2002

In this paper, dynamic path planning of two mobile robots using a modified Hopfield neural network is studied. An area which excludes obstacles and allows gradually changing of activation level of neurons is derived in each step. Next moving step can be determined by searching the next highest activated neuron. By learning repeatedly, the steps will be generated from starting to goal points. A path will be constructed from these steps. Simulation showed the constructed paths of two mobile robots, which are moving across each other to their goals.

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

We present algebraic algorithms for collision-avoidance robot motion planning problems with planar geometric models. By decomposing the collision-free space into horizontal vertex visibility cells and connecting these cells into a connectivity graph, we represent the global topological structure of collision-free space. Using the C-space obstacle boundaries and this connectivity graph we generate exact (non-heuristic) compliant and gross motion paths of planar curved objects moving with a fixed orientation amidst similar obstacles. The gross motion planning algorithm is further extended (though using approximations) to the case of objects moving with both translational and rotational degrees of freedom by taking slices of the overall orientations into finite segments.

• 전기학회논문지
• /
• 제67권3호
• /
• pp.440-447
• /
• 2018

Double parking is very common in a parking lot where there is not sufficient parking space. When we double-park a car, we leave transmission gear in neutral position and release the emergency brake so that the double-parked car can be moved just by pushing it. However, moving a double-parked car by pushing is very hard and dangerous especially for the old and the weak. So, we propose an omni-directional mobile robot for moving a double-parked car easily and safely. The developed omni-directional mobile robot moves a double-parked car by rotating a wheel of a double-parked car. It has two specially designed rollers to rotate a wheel of a double-parked car and is designed so that the height of the robot is very low to be able to enter beneath a double-parked car. It can move a double-parked car safely by detecting obstacles in the way with five ultrasonic sensors. We verified by several experiments that the developed omni-directional mobile robot can be used to move a double-parked car easily and safely.