• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.6
• /
• pp.456-465
• /
• 2003

It is well-known that bio-systems does not calculate inverse dynamics for trajectory planning, but they move by proper modulation of system impedances. Inspired by bio-systems, a biomimetic trajectory planning method is proposed in this work. This scheme is based on employment of redundant actuation which prevails in bio-systems. We discuss that for the generation of the biomimetic trajectory, intelligent structure of bio-systems plays an important role. Redundant actuation and kinematic redundancy fall into such a category of intelligent structure. The proposed biomimetic trajectory planning modulates the complete dynamic behavior such as natural frequencies and damping ratios by using the intelligent structure. Experimental work is illustrated to show the effectiveness of the proposed biomimetic trajectory planning for a five-bar mechanism with redundant actuators.

• The Journal of Korea Robotics Society
• /
• v.2 no.4
• /
• pp.304-309
• /
• 2007

This paper describes an efficient path generation method for area coverage. Its applications include robots for de-mining, cleaning, painting, and so on. Our method is basically based on a divide and conquer strategy. We developed a novel cell decomposition algorithm that divides a given area into several cells. Each cell is covered by a robot motion that requires minimum time to cover the cell. Using this method, completeness and time efficiency of coverage are easily achieved. For the completeness of coverage in dynamic environments, we also propose a path following method that makes the robot cover missed areas as a result of the presence of unknown obstacles. The effectiveness of the method is verified using computer simulations.

• The Journal of Korea Robotics Society
• /
• v.12 no.2
• /
• pp.152-160
• /
• 2017

Recent studies on automatic parking have actively adopted the technology developed for mobile robots. Among them, the path planning scheme plans a route for a vehicle to reach a target parking position while satisfying the kinematic constraints of the vehicle. However, previous methods require a large amount of computation and/or cannot be easily applied to different environmental conditions. Therefore, there is a need for a path planning scheme that is fast, efficient, and versatile. In this study, we use a multi-dimensional path grid map to solve the above problem. This multi-dimensional path grid map contains a route which has taken a vehicle's kinematic constraints into account; it can be used with the $A^*$ algorithm to plan an efficient path. The proposed method was verified using Prescan which is a simulation program based on MATLAB. It is shown that the proposed scheme can successfully be applied to both parallel and vertical parking in an efficient manner.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1028-1031
• /
• 1996

Dynamic scheduling is very important in constructing CIM and improving productivity of chemical processing systems. Computation at the scheduling level requires mostly a long time to generate an optimal schedule, so it is difficult to immediately respond to actual process events in real-time. To solve these problems, we developed dynamic scheduling algorithms such as DSMM(Dynamic Shift Modification Method), PUOM(Parallel Unit Operation Method) and UVVM(Unit Validity Verification Method). Their main functions are to minimize the effects of unexpected disturbances such as process time variations and unit failure, to predict a makespan of the updated dynamic schedule and to modify schedule desirably in real-time responding to process time variations. As a result, the algorithms generate a new pertinent schedule in real-time which is close to the original schedule but provides an efficient way of responding to the variation of process environment. Examples in a shampoo production batch process illustrate the efficiency of the algorithms.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.896-899
• /
• 1996

A new algorithm for planning a collision free path is developed based on linear parametric curve. A collision-free path is viewed as a connected space curve in which the path consists of two straight curve connecting start to target point. A single intermediate connection point is considered in this paper and is used to manipulate the shape of path by organizing the control point in polar coordinate (.theta.,.rho.). The algorithm checks interference with obstacles, defined as GM (Geometry Mapping), and maps obstacles in Euclidean Space into images in CPS (Connection Point Space). The GM for all obstacles produces overlapping images of obstacle in CPS. The clear area of CPS that is not occupied by obstacle images represents collision-free paths in Euclidean Space. Any points from the clear area of CPS is a candidate for a collision-free path. A simulation of GM for number of cases are carried out and results are presented including mapped images of GM and performances of algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1128-1131
• /
• 1996

The collision-free path planning presented here uses linear parametric curve with one intermediate connection point between start and target points. The algorithm, in which connection point is organized in elliptic chord.(.theta., .delta.), maps objects in Euclidean Space into images in CPS through intersection check between path and obstacles a process defined as GM. Elliptic locus has special property that the total distance between focus points through a point on ellipse is the same regardless of .theta.. Hence by locating the start and target points to focus points of ellipse, and organizing connection point in elliptic coordinate, the .delta.-axis of CPS represents length of path. The GM of EWS requires calculation of interference in circumferential direction only. The procedures for GM is developed which include categorization of obstacles to reduce calculation amount. Simulations of GM of EWS, on a PC with Pentium/90MHz, is carried out to measure performance of algorithm and the results are reported on a table. The simulations are done for number of cases with different number of obstacles and location of start/target points.

• ICROS
• /
• v.2 no.2
• /
• pp.35-40
• /
• 1996

이 글에서는 자동차 Body 전자제어 시스템 개요 및 개발동향에 대하여 살펴보았다. 향후 Body 전자제어 분야에서는 사고예방을 위한 첨단 안전 시스템 개발, 정보 및 통신시스템을 이용한 Navigation 시스템 개발, 차량 LAN구축, ECU(Electronic Control Unit) 통합기술 개발을 위한 노력이 가속화될 것으로 전망된다. 이러한 시스템의 개발을 위해서는 자동차 부문과 관련 전자 부문의 긴밀한 공동 연구체제가 확립되어야 함과 동시에 통신기능을 갖춘 지능형 도로 시스템 구축, 교통전용 방송국 운용 등 정부차원에서의 Infra-structure 건설이 시급한 상황이다. 이를 위하여 정부 주관하에 자동차 각사, 유관업체 및 연구기관의 참여로 전국 도로에 대한 Digital Map 개발을 위한 G-7 Project 등의 다양한 계획이 진행중이거나 추진 예정으로 있는 바 성공적으로 수행될 경우 2005년을 전후로 하여 안전성 및 편의성 측면에서 완벽한 시스템을 구축할 수 있을 것으로 사료된다.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.11
• /
• pp.1003-1012
• /
• 2000

When a robot hand grasp an object, the number of ways to grasp it stably are infinite and thus an optimal grasp planning is needed to find the optimal grasp points for satisfying the objective of the given task. In this paper, we first define some grasp indices to evaluate the quality of each feasible grasp and then a weighted composite grasp index by combining all of the grasp indices is also defined. Next, we propose a method to find the optimal grasp points of the given object by comparing the defined weighted composite grasp index for each feasible grasp points. By simulation results, we show the effectiveness of the proposed optimal grasp planning method and also discuss the trend of each grasp index as the grasp polygon.

• 한국HCI학회:학술대회논문집
• /
• 2007.02a
• /
• pp.578-584
• /
• 2007

사용자는 햅틱 장비를 통해 촉감을 느낄 수 있다. 하지만 일반적인 햅틱 장비들은 바닥에 고정된 형태이고, 또한 장치의 크기가 제한되어 있으므로, 제한된 작업공간을 가진다. 이로 인해 사용자들은 햅틱 장비의 작업공간보다 작은 물체 혹은 작업공간에 맞게 축소된 물체만을 느낄 수 있다. 이러한 햅틱 장비의 한계를 극복하고자, 햅틱 장비와 이동형 로봇을 결합한 이동형 햅틱 디스플레이를 제안한다. 이동형 햅틱 디스플레이를 위한 시스템 구성을 소개하고, 이동형 로봇의 움직임을 조종하기 위한 새로운 알고리즘을 제안한다. 이러한 이동형 햅틱 디스플레이를 사용하면 사용자는 햅틱 장비의 작업공간보다 큰 물체를 느낄 수 있으며, 가상 환경을 자유롭게 이동하면서 햅틱 피드백을 받을 수 있다.

• Journal of Institute of Control, Robotics and Systems
• /
• v.3 no.5
• /
• pp.490-496
• /
• 1997

This paper describes a new process-plan selection method using a modified Fuzzy Quantification Theory(FQT). The problem of process-plan selection can be characterized by multiple attributes and used subjective, uncertain information. Fuzzy Quantification Theory is used for handling such information because it is a useful tool when human judgment or evaluation is quantified via linguistic variables, and the proposed method is concerned with the selection of a process plan by derivation of the values of categories for each attribute. In this paper, a modified Fuzzy Quantification Theory(FQT) is described and the procedure of this approach is explained and examples illustrated.