• 한국정보통신학회논문지
• /
• 제13권4호
• /
• pp.785-796
• /
• 2009

본 논문에서는 이동로봇의 슬립 감소를 위한 이동경로계획 및 슬립으로 인해 발생하는 기록센서 오차를 보상하는 방식을 제안하였다. 제안하는 로봇의 이동경로계획은 로봇의 슬립을 고려하여 퍼텐셜 필드 방식에서 장애물에 대한 퍼텐셜 장벽을 평탄 화함으로써 로봇의 슬립을 감소하였다. 또한 슬립으로 인해 발생하는 기록센서의 오차를 퍼지 논리 시스템을 이용하여 보상하였다. 제안한 방식의 유용성을 시뮬레이션 및 제작한 이동로봇을 이용하여 실험을 통하여 확인하였다.

• 제어로봇시스템학회논문지
• /
• 제16권1호
• /
• pp.53-60
• /
• 2010

We propose a motion planning method for autonomous mobile robots. In order to minimize traveling time, a smooth path and a time optimal velocity profile should be generated under kinematic and dynamic constraints. In this paper, we develop an effective and practical method to generate a good solution with lower computation time. The initial path is obtained from voronoi diagram by Dijkstra's algorithm. Then the path is improved by changing the graph and path simultaneously. We apply the dynamic programming algorithm into the stage of improvement. Simulation results are presented to verify the performance of the proposed method.

• 한국시뮬레이션학회논문지
• /
• 제12권1호
• /
• pp.11-19
• /
• 2003

Dubins showed that any shortest path of a car-like robot consists of exactly three path segment which are either arcs of circles of radius r(denoted C), or straight line segments(denoted S). Possible six types classified into two families, i.e. CSC and CCC. CSC includes 2 types(LRL and RLR) and CSC includes 4 types(LSL, RSR, LSR, RSL). This paper proposes new formulae for CSC family to find the shortest smooth path between the initial and final configurations of a car-like robot. The formulae is used for finding connection points explicitly between C\longrightarrowS and S\longrightarrowC which are necessary for real applications. The formulae have simple forms mainly because they are transformed into origin of their original coordinates of initial and target configuration, and derived from a standard forms which are a representative configuration of LSL and LSR type respectively. The proposed formulae, which are derived from the standard forms, are simple and new method.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2006년도 춘계종합학술대회
• /
• pp.701-705
• /
• 2006

본 논문에서는 바퀴로 구성된 이동 로봇의 슬립 방지를 위한 경로 계획은 제안한다. 제안한 방식은 퍼텐셜 필드 경로 계획에서 척력에 대한 인위적인 힘을 평탄화 시키는 방식이다. 제안한 방식의 유용성을 확인하기 위하여 이동 로봇의 활동 영역에 C-obstacle이 존재하는 경우에 대해 시뮬레이션하여 제안한 방식의 성능이 기존 퍼텐셜 필드 방식보다 우수함을 확인하였다.

• 한국정밀공학회지
• /
• 제27권10호
• /
• pp.34-39
• /
• 2010

We developed a path algorithm for ultrafast/wide area laser processing. Demands for high precision laser processing with a wide area has been increasing for a number of applications such as in solar cell battery, display parts, electronic component and automobile industry. Expansion of the area in which laser processing is an important factor to handle the ultrafast/wide area processing, it will require a processing path. Processing path is path of 2- axis stage and stage of change in velocity can be smooth as possible. In this paper, we proposed a smoothingnurbs method of improved speed profile. This method creates soft path from edge part, it is main purpose that scan area ($50mm{\times}50mm$) inside processing path makes path of topology of possible straight line. We developed a simulation tool using Visual C++.

• 제어로봇시스템학회논문지
• /
• 제17권5호
• /
• pp.405-411
• /
• 2011

This paper presents a hierarchical trajectory planning method which can handle a collision-free of the planned path in complex and dynamic environments. A PV (Path & Velocity profile) planning method minimizes a sharp change of orientation and waiting time to avoid a collision with moving obstacle through detour path. The path generation problem is solved by three steps. In the first step, a smooth global path is generated using $A^*$ algorithm. The second step sets up the velocity profile for the optimization problem considering the maximum velocity and acceleration. In the third step, the velocity profile for obtaining the shortest path is optimized using the fuzzy and genetic algorithm. To show the validity and effectiveness of the proposed method, realistic simulations are performed.

• 제어로봇시스템학회논문지
• /
• 제14권12호
• /
• pp.1238-1243
• /
• 2008

This paper presents an HILS(Hardware in the Loop Simulations) based experimental study for the UAV's flight trajectory planning/generation algorithms and guidance/control laws. For the various mission that is loaded on each waypoint, proper trajectory planning and generation algorithms are applied to achieve best performances. Specially, the 'smoothing path' generation and the 'tangent orbit path' guidance laws are presented for the smooth path transitions and in-circle loitering mission, respectively. For the control laws that can minimize the effects of side wind, side slip angle($\beta$) feedback to the rudder scheme is implemented. Finally, being implemented on real hardwares, all the proposed algorithms are validated with integrations of hardware and software altogether via HILS.

• 대한기계학회논문집A
• /
• 제20권10호
• /
• pp.3160-3172
• /
• 1996

A search algorithm for the collision free, time optimal transport path of overhead cranes has been proposed in this paper. The map for the working environment of overhead cranes was constructed in the form of three dimensional grid. The obstacle occupied region and unoccupied region of the map has been represented using the octree model. The best-first search method with a suitable estimation function was applied to select the knot points on the collision free transport path to the octree model. The optimization technique, minimizing the travel time required for transporting objects to the goal while subjected to the dynamic constraints of the crane system, was developed to find the smooth time optimal path in the form of cubic spline functions which interpolate the selected knot points. Several simulation results showed that the selected estimation function worked effectively insearching the knot points on the collision free transport path and that the resulting transport path was time optimal path while satisfying the dynamic constraints of the crane system.

• 제어로봇시스템학회논문지
• /
• 제17권5호
• /
• pp.471-478
• /
• 2011

This UGV (Unmanned Ground Vehicle) is not only widely used in various practical applications but is also currently being researched in many disciplines. In particular, obstacle avoidance is considered one of the most important technologies in the navigation of an unmanned vehicle. In this paper, we introduce a simple algorithm for path planning in order to reach a destination while avoiding a polygonal-shaped static obstacle. To effectively avoid such an obstacle, a path planned near the obstacle is much shorter than a path planned far from the obstacle, on the condition that both paths guarantee that the robot will not collide with the obstacle. So, to generate a path near the obstacle, we have developed an algorithm that combines an edge detection method and a limit-cycle navigation method. The edge detection method, based on Hough Transform and IR sensors, finds an obstacle's edge, and the limit-cycle navigation method generates a path that is smooth enough to reach a detected obstacle's edge. And we proposed novel algorithm to solve local minima using the virtual wall in the local vision. Finally, we verify performances of the proposed algorithm through simulations and experiments.

• 한국컴퓨터정보학회논문지
• /
• 제10권3호
• /
• pp.219-227
• /
• 2005

모바일 환경에서 멀티캐스트는 패킷 전달 기법과 위치 독립적 주소를 사용하는데 본 논문에서는 멀티캐스트의 그룹 관리 및 경로 설정 방법을 이용하여 이동성을 제공하는 기법과 선가입을 통해 멀티미디어 서비스를 위한 smooth 핸드오프 기법을 제안한다. 제안된 기법은 호스트의 이동 방향 예측을 통한 선가입 기법을 이용하여 멀티미디어 서비스시 핸드오프로 인한 지연을 최소화할 수 있다. NS-2 네트워크 모의실험 프로그램을 확장하여 실험하였는데 실험 결과 제안된 기법이 이동성을 지원하는 여러 기법들보다 핸드오프 지연과 수신되는 데이터의 처리량에서 우수한 성능을 나타내었다.