• 산업경영시스템학회지
• /
• 제21권45호
• /
• pp.47-56
• /
• 1998

This paper describes a moving path generation method for the Autonomous vehicles (AV) to search for paths in an unknown environment by using fixed obstacle information. Algorithms for the AV which were recently proposed have some problems, so it was difficult to utilize these algorithms in the real world. The purpose of this research is to examine the applicability of real-time control and efficient improvement by reducing calculation iterations. In the network which is constructed by the cell-decomposition method, a gate is installed in each cell. By verifying the possibility of gate pass-over, the number of cells which should be considered to find the solution can be reduce. Therefore, algorithm iterations can be dramatically improved. In this paper we have proven that path-generated algorithms are efficient by using simulation.

• 한국정밀공학회지
• /
• 제17권1호
• /
• pp.93-100
• /
• 2000

Die-casting burr due to casting process is removed by post-process for assembly and quality control of product. Though robot has been widely used for deburring job before, CNC exclusive machine is currently developed f3r high power, high speed machining and quick tool change. Deburring tool path with complex 3D curve type is defined to make out deburring NC program. But there is no efficient method to define it currently used methods with teaching probe on machine. In this study the efficient method to make out deburring NC program is developed. 5-axis digitizing machine is used to receive data of deburring path. And the post processor for NC program generation is developed in consideration of the machining conditions. The developed system is not dependent on the skill of operator and has the advantage to maintain the flexibility of job to modify NC program due to the wear of tool and aging of the die casting.

• ETRI Journal
• /
• 제43권6호
• /
• pp.1013-1023
• /
• 2021

In this study, we propose a practical path planning method that combines the A^* search algorithm and minimum snap trajectory generation. The A^* search algorithm determines a set of waypoints to avoid collisions with surrounding obstacles from a starting to a destination point. Only essential waypoints (waypoints necessary to generate smooth trajectories) are extracted from the waypoints determined by the A^* search algorithm, and an appropriate time between two adjacent waypoints is allocated. The waypoints so determined are connected by a smooth minimum snap trajectory, a dynamically executable trajectory for the quadrotor. If the generated trajectory is invalid, we methodically determine when intermediate waypoints are needed and how to insert the points to modify the trajectory. We verified the performance of the proposed method by various simulation experiments and a real-world experiment in a forested outdoor environment.

• 한국정밀공학회지
• /
• 제13권9호
• /
• pp.62-69
• /
• 1996

Interpolator is a very important element in NC machines in that it controls tool path and speed. In this paper, studied were extensive interpolation characteristics of reference pulse method among various interpolation and pulse generation methods. Specifically, processing speed and path error of DDA, SPD and SFG methods were compared and analyzed against line, circle and elipse. As a result, in the point of processing speed, SPD method was found to be the best for line interpolation, SFG method for circle and ellipse, and DDA method was found to be the slowest for all paths. In the point of path error, DDA method was found to have the biggest error for all kinds of paths.

• 한국레이저가공학회지
• /
• 제13권4호
• /
• pp.14-20
• /
• 2010

Robot path generation and laser welding technology for manufacturing automotive body are studied. Laser welding and industrial robot systems are used with the robot based laser welding system. The laser system used in this study is 1.6kW Fiber laser, while the robot system is 6 axes Industrial robot (payload: 130kg). The robot based laser welding system is equipped with laser scanner system for remote laser welding. The laser source, robot and laser scanner system are used to increase the processing speed and to improve the process efficiency. The welding joints of steel plate are butt and lapped joints. The quality test of the laser welding are through the observation the shape of bead on plate and cross-section of welding part. The 3 dimensional laser welding for non-linear pipe welding line is performed. This paper introduces the robot based laser welding system to resolve the limited welding speed and accuracy of the conventional spot welding system.

• 한국항공우주학회지
• /
• 제37권11호
• /
• pp.1104-1111
• /
• 2009

항공기는 저고도에서 임무를 수행할 때, 대공 미사일과 지형 장애물 같은 다양한 위협들에 제약을 받는다. 특히, 항공기는 지면 근처에서 항상 지형과의 충돌 위험을 갖는다. 본 연구에서는 이 문제에 효과적으로 대비하기 위하여, 지형 회피가 고려된 비행경로 생성 알고리듬을 개발하였다. 비행경로 생성 알고리듬에서는 먼저 등고선의 그룹화를 통해 경로점을 생성하고, Dijkstra 알고리듬을 이용하여 적절한 경로점 조합을 구성한다. 구성된 경로점 조합에 대해서는 최적제어 이론을 기반으로 한 최적 경로점 유도법칙을 적용하여, 제어에너지를 최소로 하는 최적의 비행경로를 제시한다.

• 정보처리학회논문지:소프트웨어 및 데이터공학
• /
• 제8권4호
• /
• pp.137-144
• /
• 2019

무기체계 기술의 국산화 과정에서 경험과 기술이 부족한 상태로 개발 중인 체계에 대한 테스트 기술의 성숙도는 매우 중요하다. 테스트에서 발견하지 못한 결함은 시스템 운용 중 막대한 영향을 미친다. 잠수함에서 실시간 정보공유 체계는 신속한 지휘결심과 임무능력으로 이어진다. 데이터 분산 시스템은 매우 중요한 정보 공유체계이며 제조사나 데이터 형태가 다른 체계들 간에 이루어진다. 본 논문에서는 데이터 분산 시스템의 데이터 분산 특성을 분석하여 데이터별 체계를 그룹핑하고, 경로 테스트 기법에 트리순회 방법인 후위트리순회, 전위트리순회를 이용하여 테스트케이스 생성기법을 제시한다. 제시한 기법은 기존기법들에 비해 73.7% 테스팅 리소스를 감소시킬 수 있다.

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

본 논문은 웹기반 게임 컨텐츠로써의 최적 미로 게임 개발에 대한 논문이다. 웹을 이용한 클라이언트 접속자는 자바 애플릿을 이용하여 웹상에서 접근 가능하고 Java Bytecode의 다운로드에 의해 각 클라이언트 접속자의 하드웨어시스템에 무관하게 작동가능하다. 본 논문에서 개발된 최적 미로 게임은 랜덤 미로 생성기, 미로 내 경로 입력기, 가중 최적 경로 탐색기, 및 비교기 등으로 구성되어 있다. 최적 미로 탐색 알고리즘으로 탐색된 경로와 사용자가 선택한 경로의 cost 비교를 통하여 사용자의 지리적 인지력을 정량적으로 평가 및 도시함으로써 사용자의 지리적 인지력 향상을 유도할 수 있다.

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

This paper presents a new method that generates a path that has no collision with the obstacles or the characters by using the three motion parameters, and automatically creates natural motions of characters that are confined to the path. Our method consists of three parameters: the joint information parameter, the behavior information parameter, and the environment information parameter. The joint information parameters are extracted from the joint angle data of the character and this information is used when creating a path following motion by finding the relation-function of the parameters on each joint. A user can set the behavior information parameter such as velocity, status, and preference and this information is used for creating different paths, motions, and collision avoidance patterns. A user can create the virtual environment such as road and obstacle, also. The environment is stored as environment information parameters to be used later in generating a path without collision. The path is generated using Hermit-curve and each control point is set at important places.

• International Journal of Control, Automation, and Systems
• /
• 제6권3호
• /
• pp.401-412
• /
• 2008

This paper discusses a design methodology of cooperative path planning for dynamical multi-agent systems with spatial and temporal constraints. The cooperative behavior of the multi-agent systems is specified in terms of the objective function in an optimization formulation. The path of achieving cooperative tasks is then generated by the optimization formulation constructed based on a differential flatness approach. Three scenarios of multi-agent tasking are proposed at the cooperative task planning framework. Given agent dynamics, both spatial and temporal constraints are considered in the path planning. The path planning algorithm first finds trajectory curves in a lower-dimensional space and then parameterizes the curves by a set of B-spline representations. The coefficients of the B-spline curves are further solved by a sequential quadratic programming solver to achieve the optimization objective and satisfy these constraints. Finally, several illustrative examples of cooperative path/task planning are presented.