• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.3
• /
• pp.313-320
• /
• 1999

The Lane-Curvature Method(LCM) presented in this paper is a new local obstacle avoidance method for indoor mobile robots. The method combines Curvature-Velocith Method(CVM) with a new directional method called the Lane Method. The Lane Method divides the environment into lanes taking the information on obstacles and desired heading of the robot into account ; then it chooses the best lane to follow to optimize travel along a desired heading. A local heading is then calculated for entering and following the best lane, and CVM uses this heading to determine the optimal translational and rotational velocity space methods, LCM yields safe collision-free motion as well as smooth motion taking the dynamics of the robot Xavier, show the efficiency of the proposed method.

• The Journal of Korea Robotics Society
• /
• v.1 no.1
• /
• pp.46-57
• /
• 2006

It is well known that mathematical solutions for multi-agent planning problems are very difficult to obtain due to the complexity of mutual interactions among multi-agent. Most of the past research results thus are based on the probabilistic completeness. However, the practicality and effectiveness of the solution from the probabilistic completeness is significantly reduced by heavy computational burden. In this paper, we propose a practically applicable solution technique for multi-agent planning problems, which assures a reasonable computation time and a real world application for more than 3 multi-agents for the case of general shaped paths in agent movement. First, to reduce the computation time, a collision map is utilized for detecting potential collisions and obtaining collision-free solutions for multi-agents. Second, to minimize the maximum of multi-agent task execution time, a method is developed for selecting an optimal priority order. Simulations are finally provided for more than 20 agents to emphasize the effectiveness of the proposed interactive approach to multi-agent planning problems.

• Journal of Navigation and Port Research
• /
• v.33 no.9
• /
• pp.603-608
• /
• 2009

In this paper, a 3m-class free running model ship will be introduced with its manoeuvring performance experiments. The results of turning circle test and zig-zag test will be explained. The developed system are equipped with GPS, main control computer, wireless LAN, IMU (Inertial Measurement Unit), self-propulsion propeller and driving rudder. Its motion can be controlled by RC (Radio Control) and wireless LAN from land based center. Automatic navigation is also available by pre-programmed algorithm. The trajectory of navigation can be acquired by GPS and it provides us with important data for ship's motion control experiments. The results of manoeuvring performance experiment have shown that the developed free running model ship can be used to verify the test of turning circle and zig-zag. For next step, other experimental researches such as ship collision avoidance system and automatic berthing can be considered in the future.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.37.2-37
• /
• 2002

1. Introduction 2. Problem Formulation 3. Avoidability Measure And Relative Distance 4. Artificial Potential Field in Terms of Relative Distance 5. Simulation Results 6. Conclusions 7. Reference

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.41 no.7
• /
• pp.809-822
• /
• 1992

A mathematical approach to solving the time-varying obstacle avoidance problem is pursued. The mathematical formulation of the problem is given in robot joint space(JS). View-time concept is used to deal with time-varying obstacles. The view-time is the period in which a time-varying obstacles. The view-time is the period in which a time-varying obstacle is viewed and approximated by an equivalent stationary obstacle. The equivalent stationary obstacle is the volume swept by the time-varying obstacle for the view-time. The swept volume is transformed into the JS obstacle that is the set of JS robot configurations causing the collision between the robot and the swept volume. In JS, the path avoiding the JS obstacle is planned, and a trajectory satisfying the constraints on robot motion planning is planned along the path. This method is applied to the collision-free motion planning of two SCARA robots, and the simulation results are given.

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10b
• /
• pp.951-957
• /
• 1988

A collision-free trajectory planning algorithm is proposed to optimally coordinate two robots working in a common 3-D workspace. Each link of the two robots is modeled as a line segment and by their motion priority, one of the two robots is chosen as the master and the other the slave. And the one-step-ahead minimum distance between the two robots is computed by moving the master to the next location on its specified trajectory. Then the nominal trajectory of the slave is modified such that the distance between the next locations of the master and the slave must be larger than a prespecified allowable minimum distance. Here the weighted sum of the trajectory error and the joint motions of the slave is minimized by using the linear programming technique under the constraints that joint angle and velocity limits are not violated. To show the validity of the proposed algorithm, a numerical example is illustrated by employing a two dof's and a three dof's planar robots.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10a
• /
• pp.726-730
• /
• 1990

In this paper, assuming that local range information is available, a collision-free path planning algorithm for multiple mobile robots is presented by using Hopfield neural optimization network. The energy function of the network is built using the present position and the goal position of each robot as well as its local range information. The proposed algorithm has several advantages such as the effective passing around obstacles with the directional safety distance, the easy implementation of robot motion planning including its rotation, the real-time path planning capability from the totally localized computations of path for each robot, and the adaptivity on arbitrary environment since any special shape of obstacles is not assumed.

• International Journal of Control, Automation, and Systems
• /
• v.5 no.3
• /
• pp.295-306
• /
• 2007

It is well known that mathematical solutions for multi-agent planning problems are very difficult to obtain due to the complexity of mutual interactions among multi-agents. Most of the past research results are thus based on the probabilistic completeness. However, the practicality and effectiveness of the solution from the probabilistic completeness is significantly reduced by heavy computational burden. In this paper, we propose a practically applicable solution technique for multi-agent planning problems, which assures a reasonable computation time and a real world application for more than 3 multi-agents, for the case of general shaped paths in agent movement. First, to reduce the computation time, an extended collision map is developed and utilized for detecting potential collisions and obtaining collision-free solutions for multi-agents. Second, a priority for multi-agents is considered for successive and interactive modifications of the agent movements with lower priority. Various solutions using speed reduction and time delay of the relevant agents are investigated and compared in terms of the computation time. A practical implementation is finally provided for three different types of agents to emphasize the effectiveness of the proposed interactive approach to multi-agent planning problems.

• Journal of the Korean Society for Precision Engineering
• /
• v.10 no.2
• /
• pp.170-177
• /
• 1993

In robotic arc welding, the roll (rotation) of the torch about its direction vector does not have any effect on the welding operation. Thus we could use this redundant degree of greedom for the motion control of the robot manipulator. This paper presents an algorithm for the pseudo- inverse kinematic motion control of the 6-axis robot, which utilizes the above mentioned redunancy. The prototype welding operation and the tool path are also graphically simulated. Since the proposed algorithm requires only the position and normal vector of the weldine as an input data, it is useful for the CAD-based off-line programming of the arc welding robot. In addition, it also has the advantages of the redundant manipulator motion control, like singularity avoidance and collision free motion planning, when compared with the other motion control method based on the direct inverse kinematics.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.945-949
• /
• 1988

In this paper, collision avoidance of two robots working in a common workspace is described. The workspace for a two robot system is defined and classified. JCM (Joint Constraint Map) is designed which shows the region of joint values that must be avoided for collision free motion, and application of the JCM is studied.