• The KIPS Transactions:PartD
• /
• v.16D no.4
• /
• pp.571-582
• /
• 2009

This paper provides a way to overcome limitations of general collaborative software development tools that completely restrict co-ownership of resources among individuals in a team oriented developmental environment. It also provides a solution for users to co-own resources and at the same time manage version control and collision problems that may occur due to the co-ownership of resources.The cooperative development support tool of developed software uses the conventional optimistic technique but employs the algorithm which is improved to reduce costs and efforts required for solving collision. The collaborative software development tool presented in this paper is made up of the classical client/server structure with the P2P(peer to peer) method which supports information exchange among individuals. This tool is developed based on open source software CVS(Concurrent Version System). Functional efficiency was confirmed by comparing it to the utility of prior existing collaborative software development tools.

• ETRI Journal
• /
• v.39 no.4
• /
• pp.493-501
• /
• 2017

This paper introduces a new motion-synthesis technique for animating multiple characters. At a high level, we introduce a hub-sub-control-point scheme that automatically generates many different spline curves from a user scribble. Then, each spline curve becomes a trajectory along which a 3D character moves. Based on the given curves, our algorithm synthesizes motions using a cyclic motion. In this process, space-time warp curves, which are time-warp curves, are embedded in the 3D environment to control the speed of the motions. Since the space-time warp curve represents a trajectory over the time domain, it enables us to verify whether the trajectory causes any collisions between characters by simply checking whether two space-time warp curves intersect. In addition, it is possible to edit space-time warp curves at run time to change the speed of the characters. We use several experiments to demonstrate that the proposed algorithm can efficiently synthesize a group of character motions. Our method creates collision-avoiding trajectories ten times faster than those created manually.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.563-566
• /
• 2006

In this paper, we studied about AGVs modeling and material handling automation simulation using a virtual AGV. The proposed virtual AGV model that operates independently each other is based on a real AGV. Continuous straight-line and workstation model using vector drawing method that could easily, rapidly work system modeling are suggested. Centralized traffic control, which could collision avoidance in intersection and should not stop AGV as possible, and algorithm for detour routing which performs when another AGV is working in pre-routed path are proposed. The traffic control and the algorithm have been proved efficiently by simulation.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.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.

• Journal of the Korean Society for Precision Engineering
• /
• v.23 no.4 s.181
• /
• pp.83-90
• /
• 2006

A robot manipulator is usually operated in two modes: free and constrained motion modes, depending on whether the robot is in contact with an environment or not. At the moment of contact, an impact occurs and can exert harmful effects to the robot or the object. In case of teleoperation, since a user may give an inadequately excessive velocity command to the slave due to insufficient visual information, the robot nay collide the object with an excessive speed and it possibly deteriorates the robot's performance causing vibrations and at worst, shortens its lifetime by its fracture. In this article, a new algorithm is proposed by introducing a command signal modification method on the basis of impedance control and validity of the proposed algorithm is demonstrated by performing simulations and experiments.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.2
• /
• pp.278-281
• /
• 2008

Linear motor (LM) based shuttle cars will play an important role in the future transportation systems of marine terminals to cope with increasing container flows. These systems are known as agile port terminals because of their significant advantages. However, routing for multiple shuttle cars is still an open issue. We present a network model of a container yard and propose constrained dynamic programming (DP) for its routing strategy with collision avoidance. The algorithm is a modified version of typical DP which is used to find an optimal path for a single traveler. We evaluate the new algorithm through simulation results for three shuttle cars in a mesh-type container yard.

• Proceedings of the KSME Conference
• /
• 2004.04a
• /
• pp.929-933
• /
• 2004

A robot manipulator is usually operated in two modes: free motion and constraint motion according to the fact whether the robot comes into contact with the environment or not. At the moment of contact, impact occurs, and sometimes, it can possibly degrade the robot's performance such as vibration and at worst, shortens its lifetime. In this article, a new proposed algorithm is described by introducing a command signal modification method on the basis of impedance control and a validity of the proposed algorithm is demonstrated by showing the simulation study.

• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.3
• /
• pp.334-341
• /
• 1998

This paper proposes an algorithm to obtain the time-to-contact between an observer and a target and surface orientation of the target. These two physical elements are computed from the image deformation of a known shape, which is extracted by supervised classification of detected line segments based on MAP and Mahalanobis distance. The proposed algorithm was applied to the natural outdoor traffic scene and would contribute to the development for a collision avoidance system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.3
• /
• pp.188-190
• /
• 2014

In mobile ad hoc networks(MANETs), each node rebroadcast received route request packets for route discovery. Flooding from large number of nodes induces the broadcast storm problem which causes severe degradation in network performance due to redundant retransmission, collision and contention. This paper presents a node status algorithm based on probabilistic scheme to alleviate the broadcast storm problem for wireless ad hoc networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.123-140
• /
• 2011

In this paper, we propose an Energy Efficient Media Access Control (EE-MAC) protocol for wireless sensor networks. The proposed scheme is designed to save power consumption and guarantee quality-of-service for real-time traffic. EE-MAC uses the superframe structure which is bounded by the transmission of a beacon frame and can have an active and an inactive portion. The active period is divided into the contention free period (CFP) for real-time traffic transmission and the contention access period (CAP) for non-real-time traffic transmission. We propose the exclusively allocated backoff scheme which assigns a unique backoff time value to each real-time node based on bandwidth allocation and admission control. This scheme can avoid collision between real-time nodes by controlling distributed fashion and take effect a statistical time division multiple access. We also propose the algorithm to change the duty cycle adaptively according to channel utilization of media depending on network traffic load. This algorithm can prolong network lifetime by reducing the amount of energy wasted on idle listening.