• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 제36회 하계학술대회 논문집 D
• /
• pp.2790-2792
• /
• 2005

This paper proposes a path-planning algorithm that enables a robot to reach the goal position while avoiding obstacles. The proposed method, which is based on dynamic programming, finds an optimum path to follow using a modified skeleton map method which exploits information on obstacle positions. Simulation results show the feasibility of the proposed method.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(5)
• /
• pp.31-34
• /
• 2000

In this paper, we design an optimal path for multiple mobile robots. For this purpose, we propose a new method of path planning for multiple mobile robots in dynamic environment. First, every mobile robot searches a global path using a distance transform algorithm. Then we put subgoals at crooked path points and optimize them. And finally to obtain an optimal on-line local path, ever)r mobile robot searches a new path with static and dynamic obstacle avoidance.

• 대한전기학회논문지:전력기술부문A
• /
• 제54권11호
• /
• pp.507-517
• /
• 2005

This paper presents the results of critical contingency analysis for the Korean power system which is performed to identify the impact of the critical contingencies on the Korean power system and set up a short term system operation planning for the purpose of preventing large scale blackout. The static and dynamic simulation is carried out for each critical contingency and the simulation results for each contingency are shown under the peak load condition for the year 2005, 2007 and 2010.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2003년도 학술회의 논문집 정보 및 제어부문 B
• /
• pp.429-432
• /
• 2003

In this paper, a novel neural network approach is proposed for cleaning robot to complete coverage path planning with obstacle avoidance in stationary and dynamic environments. The dynamics of each neuron in the topologically organized neural network is characterized by a shunting equation derived from Hodgkin and Huxley's membrane equation. There are only local lateral connections among neurons. The robot path is autonomously generated from the dynamic activity landscape of the neural network and the previous robot location without any prior knowledge of the dynamic environment.

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

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

• 한국컴퓨터정보학회논문지
• /
• 제18권2호
• /
• pp.117-126
• /
• 2013

가상의 캐릭터가 이동하기 위해 경로를 계획하는 일은 컴퓨터 게임을 포함한 여러 응용 분야에서 필수적인 문제이다. 기존의 로봇 경로 계획과는 달리 하나 이상의 캐릭터가 그룹 이동을 하는 경우가 많으며 이 경우에는 이동 경로의 최단 여부보다는 자연스러운 그룹 이동 등의 질적인 면이 강조된다. 본 논문에서는 리더로 정해진 단일 캐릭터에 대해 정적인 환경에서의 전역 경로를 계획하고 이 경로를 따라 그룹이 이동하며 동적 장애물을 피하도록 지역 경로를 계획하는 2단계 경로 계획 방법을 제안한다. 그룹이 이동할 수 있는 공간은 리더를 중심으로한 정방형 격자 배열을 이용하여 확보하고 이를 격자창이라고 부른다. 멤버 캐릭터들은 격자창 공간 안에서 리더에 대한 상대적인 위치를 잡아 이동하며 격자창이 이동할 수 있는 경로를 계획하기 위해 정적 환경을 격자창에 대한 형태 공간으로 치환하여 로드맵을 구한다. 지역 경로 계획 단계에서는 리더에 대해 인공 포텐셜 필드를 이용하여 동적 장애물을 회피하도록 하고 나머지 멤버들에 대해서는 격자창 내에서 리더에 대한 상대적인 위치를 확보하는 방법으로 연산량을 줄인다. 제안하는 경로 계획 방법을 구현하기 위한 효율적인 알고리즘을 소개하며 정적 환경에서 계획된 경로를 따라 그룹이 이동하면서 동적 장애물에 대해 효과적으로 대처하는 것을 시뮬레이션을 통해 보여 준다.

• 전기학회논문지
• /
• 제64권10호
• /
• pp.1479-1485
• /
• 2015

Robot's technology was very simple and repetitive in the past. Nowadays, robots are required to perform intelligent operation. So, path planning has been studied extensively to create a path from start position to the goal position. In this paper, potential field algorithm was used for path planning in dynamic environments. It is used for a path plan of mobile robot because it is elegant mathematical analysis and simplicity. However, there are some problems. The problems are collision risk, avoidance path, time attrition. In order to resolve path problems, we amalgamated potential field algorithm with the artificial neural network system. The input of the neural network system is set using relative velocity and location between the robot and the obstacle. The output of the neural network system is used for the weighting factor of the repulsive potential function. The potential field algorithm problem of mobile robot's path planning can be improved by using artificial neural network system. The suggested algorithm was verified by simulations in various dynamic environments.

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

In this paper, we will present a deeper look on optimal design methods that are related to path-planning for a mobile robot. To control the motion of a mobile robot in a clustered environment, it's necessary to know a suitable trajectory assuming certain start and goal point. Up to now, there are many literatures that concern optimal path planning for an obstacle avoided mobile robot. Among those literatures, we have chosen 2 novel methods for our further analysis. The first approach [4] is based on HJB(Hamilton-Jacobi-Bellman) equation whose solution is the return-function that helps to generate a shortest path to the goal. The later [5] is called polynomial-path-planning approach, in this method, a shortest polynomial-shape path would become a solution if it was a collision-free path. The camera network plays the role as sensors to generate updated map which locates the static and dynamic objects in the space. Therefore, the exhibition of both path planning and dynamic obstacle avoidance by the updated map would be accomplished simultaneously. As we mentioned before, our research will include the motion control of a true mobile robot on those optimal planned paths which were generated by above algorithms. Base on the kinematic and dynamic simulation results, we can realize the affection of moving speed to the stable of motion on each generated path. Also, we can verify the time-optimal trajectory through velocity tuning. To simplify for our analysis, we assumed the obstacles are cylindrical circular objects with the same size.

• 전자공학회논문지B
• /
• 제29B권11호
• /
• pp.36-45
• /
• 1992

A numerical trajectory planning method for path-constrained trajectory planning is proposed which ensures collision-free and time-optimal motions for two robotic manipulators with limited actuator torques and velocities. For each robot, physical constraints of the robots such as limited torques or limited rotational velocities of the actuators are converted to the constraints on velocity and acceleration along the path, which is described by a scalar variable denoting the traveled distance from starting point. Collision region is determined on the coordination space according to the kinematic structures and the geometry of the paths of the robots. An Extended Coordination Space is then constructed` an element of the space determines the postures and the velocities of the robots, and all the constraints described before are transformed to some constraints on the behaviour of the coordination-velocity curves in the space. A dynamic programming technique is them provided with on the discretized Extended Coordination Space to derive a collision-free and time-optimal trajectory pair. Numerical example is included.

• 대한원격탐사학회지
• /
• 제27권6호
• /
• pp.743-752
• /
• 2011

One of main concerns of operators of the Earth observation satellite is taking images as many as possible under the constraints of satellite resources during fixed period. In order to achieve this goal, satellite operators are strongly required to generate the optimized image collection plans, and it is a very time consuming process to achieve an optimized image collection plan when it is done by manual. This paper suggests automation of image collection planning based on the dynamic programming algorithm to reduce the time required for image collection planning. The validity of the proposed method is tested using operating satellite system and the result is given in this paper.