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

While Ethernet and TCP/IP are the most widely used protocol, for Real-time system, it is not applicable because it doesn't guarantee the deterministic transmission time. Furthermore, the TCP acknowledgement scheme and sliding window algorithm enforce to collide packets. Although various Collision-Free CSMA protocol was presented, it is very difficult to implement in well known OS(UNIX, WilidowsNT) because we have to modify network kernel. This paper presents another transmission protocol based on modified UDP. The colliding probability can be minimized by avoiding successive packet transmission and decreasing competition duration. The proposed algorithm can be used for the soft real-time industrial automation network.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.2102-2107
• /
• 2005

In this paper, a real-time optimization method for nonlinear dynamical systems is proposed. The proposed method is based on the algorithms of numerical solutions for optimal control problems. We deal with a real-time collision-free motion control of a nonholonomic mobile robot, which has input restrictions of actuators. The effectiveness of the algorithmic method is demonstrated through numerical and experimental results. The mobile robot which we have developed is able to avoid moving obstacles skillfully. Therefore the proposed controller works well in real time.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2008년도 하계종합학술대회
• /
• pp.709-710
• /
• 2008

무선 시스템에서는 수신도 송신처럼 에너지를 소모한다. 이러한 전력소모는 배터리를 전원으로 오랜시간 동작해야하는 센서 망에서는 치명적이다. 특히 센서 네트워크를 위해 제안된 경쟁기반 방식의 MAC은 에너지 소모를 야기하는 패킷간의 충돌을 최소화 하고 전송지연 을 줄이는 프로토콜이 필요하다. 본 논문에서는 adaptive S-MAC의 방식을 그대로 사용하면서 간섭에 의한 충돌을 줄이는 알고리즘을 이용하여 한 SYNC interval 내에서 최대 3홉까지 전송 가능한 MAC 프로토콜을 제안하였다. NS2의 시뮬레이션을 통해 제안한 MAC 프로토콜의 성능을 기존 MAC과 비교하여 증명하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.131.4-131
• /
• 2001

A lot of path planning algorithms have been developed to find the collision-free path with minimum cost. But most of them require complicated computations. In this paper, a thinning method, which is one of the image processing schemes, was adopted to simplify the path planning procedure. In addition, critical points are used to find the shortest-distance path among all possible paths from the start to the goal point. Since the critical points contain the information on the neighboring paths, a new path can be quickly obtained on the map even when the start and goal points change. To investigate the validity of the proposed algorithm, various simulations have been performed for the environment where the obstacles with arbitrary shapes exist. It is shown that the optimal paths can be found with relative easiness.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.120.3-120
• /
• 2001

We propose a new method of path planning for cleaning robots. Path planning problem for cleaning robots is different from conventional path planning problems in which finding a collision-free trajectory from a start point to a goal point is focused. In the case of cleaning robots, however, a planned path should cover all area to be cleaned. To resolve this problem in a systematic way, we propose a method based on a graph model as follows: at first, partition a given map into proper regions, then transform a divided region to a vertex and a connectivity between regions to an edge of a graph. Finally, a region is divided into sub-regions so that the graph has a unary tree which is the simplest Hamilton path. The effectiveness of the proposed method is shown by computer simulation results.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.1040-1045
• /
• 1991

An approach to time-varying obstacle avoidance problem is pursued. The mathematical formulation of the problem is given in Cartesian space and in joint space. To deal with the time-varying obstacles, view-time is introduced. A view-time is the time interval viewing the time-varying obstacles to model equivalent stationary obstacles. For the analysis of the properties of the view-time, avoidability measure is defined as a measure of easiness for a robot to avoid obstacles. Based on the properties, a motion planning strategy to avoid time-varying obstacles is derived. An application of the strategy to the collision-free motion planning of two SCARA robots and the simulation on the application are given.

• 제어로봇시스템학회논문지
• /
• 제14권4호
• /
• pp.392-398
• /
• 2008

We propose a new path planning method for autonomous mobile robots. To maximize the utility of mobile robots, the collision-free shortest path should be generated by on-line computation. In this paper, we develop an effective and practical method to generate a good solution by lower computation time. The initial path is obtained from skeleton graph by Dijkstra's algorithm. Then the path is improved by changing the graph and path dynamically. We apply the dynamic programming algorithm into the stage of improvement. Simulation results are presented to verify the performance of the proposed method.

• 대한기계학회논문집A
• /
• 제26권12호
• /
• pp.2678-2686
• /
• 2002

A novel approach is developed for avoidance of obstacles in unknown environment. This paper proposes a new way of intelligent autonomous wheelchairs for the handicapped to move safely and comfortably. It is the objective of this paper to develop delayed time fuzzy control algorithms to deal with various obstacles. This new algorithm gives the benefit of the collision free movement in real time and optimal path to the moving target. The computer simulations and the experiments are demonstrated to the effect of the suggested control method.

• 한국정밀공학회지
• /
• 제24권7호
• /
• pp.39-48
• /
• 2007

This paper presents a method of a line balanced assembly sequence generation based on the verification of a disassemblability and a work time. To derive the disassemblability for a part to be disassembled, first we inference collision free assembly directions by extracting separable directions fur the part. And we determine the disassemblability defined by the separability and stability cost. The separability cost represents a facility of the part disassembly operation, and the stability cost which represents a degree of the stability for the base assembly motion. Based upon the results, we propose a new approach of evaluating work time using neural networks. The proposed assembly sequence generation provides an effective means of solving the line balancing problem and gives a design guidance of planning assembly lay-out in flexible manufacturing application. Example study is given to illustrate the concepts and procedure of the proposed schemes.

• 대한기계학회논문집A
• /
• 제31권1호
• /
• pp.1-10
• /
• 2007

This paper presents a design guidance of jig/fixture for flexible manufacturing system based on the verification of a base assembly motion instability. In flexible assembly system, the base assembly needs to be maintained in its assembled state without being taken apart. This requires stability in motion while the base assembly is handled or tilted. Therefore, the instability of the base assembly motion should be considered when determining the guide line of designing jig/fixture by evaluating a degree of the motion instability of the base assembly. To derive the instability, first we inference collision free assembly directions by extracting separable directions for the mating parts and calculate the separability which gives informations as to how the parts can be easily separated. Using these results, we determine the instability evaluated by summing all the modified separabilities of each component part within base assembly.