• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2001년도 하계학술대회 논문집 D
• /
• pp.2417-2419
• /
• 2001

A path planning is one of the main subjects in a mobile robot. It is divided into two parts. One is a global path planning and another is a local path planning. This paper, using the formal two methods, presents that the mobile robot moves to multi-targets with avoiding unknown obstacles. For the shortest time and the lowest cost, the mobile robot has to find a optimal path between targets. To find a optimal global path, we used GA(Genetic Algorithm) that has advantage of optimization. After finding the global path, the mobile robot has to move toward targets without a collision. FLC(Fuzzy Logic Controller) is used for local path planning. FLC decides where and how faster the mobile robot moves. The validity of the study that searches the shortest global path using GA in multi targets and moves to targets without a collision using FLC, is verified by simulations.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.1193-1196
• /
• 1996

Genetic algorithm(GA) is useful to find optimal solution without any special mathematical modeling. This study presents to search optimal path of Autonomous Mobile Robot(AMR) by using GA without encoding and decoding procedure. Therefore, this paper shows that the proposed algorithm using GA can reduce the computation time to search the optimal path.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 학술대회 논문집 정보 및 제어부문
• /
• pp.92-94
• /
• 2005

Unmanned ground vehicles(UGVs) are expected to play a key role in the future army. These UGVs would be used for weapons platforms. logistics carriers, reconnaissance, surveillance, and target acquisition in the rough terrain. Most of path planning methodologies for UGVs offer an optimal or sub-optimal shortest-path in a 20 space. However, those methodologies do not consider increment and reduction effects of relative distance when a UGV climbs up or goes down in the slope of rough terrain. In this paper, we propose a novel path planning methodology using the modified distance transform algorithm. Our proposed path planning methodology employs two kinds of map. One is binary obstacle map. The other is the DEM. With these two maps, the modified distance transform algorithm in which distance between cells is increased or decreased by weighting function of slope is suggested. The proposed methodology is verified by various simulations on the randomly generated DEM and obstacle map.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 2000년도 춘계학술대회논문집 - 한국공작기계학회
• /
• pp.176-181
• /
• 2000

Collision free task planning for dual-arm robot which perform many subtasks in a common work space can be achieved in two steps : path planning and trajectory planning. path planning finds the order of tasks for each robot to minimize path lengths as well as to avoid collision with static obstacles. A trajectory planning strategy is to let each robot move along its path as fast as possible and delay one robot at its initial position or reduce speed at the middle of its path to avoid collision with the other robot.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.1419-1423
• /
• 2004

In this paper, we propose an algorithm for planning an optimal path to capture a moving object by a mobile robot in real-time. The direction and rotational angular velocity of the moving object are estimated using the Kalman filter, a state estimator. It is demonstrated that the moving object is tracked by using a 2-DOF active camera mounted on the mobile robot and then captured by a mobile manipulator. The optimal path to capture the moving object is dependent on the initial conditions of the mobile robot, and the real-time planning of the robot trajectory is definitely required for the successful capturing of the moving object. Therefore the algorithm that determines the optimal path to capture a moving object depending on the initial conditions of the mobile robot and the conditions of a moving object is proposed in this paper. For real-time implementation, the optimal representative blocks have been utilized for the experiments to show the effectiveness of the proposed algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.186-190
• /
• 2003

In this paper, we propose an algorithm for planning an optimal path to capture a moving object by a mobile robot in real-time. The direction and rotational angular velocity of the moving object are estimated using the Kalman filter, a state estimator. It is demonstrated that the moving object is tracked by using a 2-DOF active camera mounted on the mobile robot and then captured by a mobile manipulator. The optimal path to capture the moving object is dependent on the initial conditions of the mobile robot, and the real-time planning of the robot trajectory is definitely required for the successful capturing of the moving object. Therefore the algorithm that determines the optimal path to capture a moving object depending on the initial conditions of the mobile robot and the conditions of a moving object is proposed in this paper. For real-time implementation, the optimal representative blocks have been utilized for the experiments to show the effectiveness of the proposed algorithm.

• 한국지능시스템학회논문지
• /
• 제18권2호
• /
• pp.212-215
• /
• 2008

본 논문에서 개선된 Dijkstra 알고리즘과 입자 군집 최적화를 이용한 최적 경로 계획 알고리즘을 제안한다. 최적의 경로를 구하기 위해 우선 이동 로봇 공간에서 MAKLINK를 작성하고 MAKLINK와 관련한 그래프를 얻는다. 여기서 MAKLINK는 장애물의 꼭지점을 연결하면서 볼록집합이 만들어지도록 하는 모서리의 집합을 의미한다. 얻은 그래프에서 출발점과 도착점을 포함하여 Dijkstra 알고리즘을 이용하여 최소 비용 최적 경로를 얻고 이 최적의 경로에서 개선된 Dijkstra경로를 얻는다. 마지막으로 개선된 Dijkstra경로에서 입자 군집 최적화를 적용하여 최적의 경로를 얻는다. 제안된 방법이 논문[1]에 나온 결과보다 더 좋은 성능을 갖는다는 것을 실험을 통해 입증한다.

• 로봇학회논문지
• /
• 제2권2호
• /
• pp.183-190
• /
• 2007

The most important thing for navigation of a mobile robot is to find the most suitable path and avoid the obstacles in the static and dynamic environment. This paper presents a method to search the optimal path in start space extended to time domain with considering a velocity and a direction of moving obstacles. A modified version of $A^*$ algorithm has been applied for path planning in this work and proposed a method of path search to avoid a collision with moving obstacle in space-tim domain with a velocity and an orientation of obstacles. The velocity and the direction for moving obstacle are assumed as linear form. The simulation result shows that a mobile robot navigates safely among moving obstacles of constant linear velocity. This work can be applied for not only a moving robot but also a legged humanoid robot and all fields where the path planning is required.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 하계학술대회 논문집 B
• /
• pp.715-718
• /
• 1998

There are a lot of paths which connect between the mobile robot and the goat point. To make a mobile robot arrive at the goal point fastly, The optimal path is needed and a path palnning is necessary. In this paper, we propose a new method of path planning to find a path for mobile robot. It is based on Ginetic Algorithm for serching the optimal grobal path planning. Simulations show the efficiency for the grobal path planning.

• 한국정밀공학회지
• /
• 제13권6호
• /
• pp.122-127
• /
• 1996

The achievement of the optimal condition for the task of an industrial articulated robot used in many fields is an important problem to improve productivity. In this paper, a minimum-time trajectory for an articulated robot along the specified path is studied and simulated with a proper example. A general dynamic model of manipulator is represented as a function of path distance. Using this model, the velocity is produced as fast as possible at each point along the path. This minimum-time trajectory planning module together with the existing collision-free path planning modules is utilized to design the optimal path planning of robot in cases where obstacles present.