• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.6
• /
• pp.543-549
• /
• 2005

This paper deals with modeling and analysis fer the landing motion of a human-body model. First, the dynamic model of a floating human body is derived. The external impulse exerted on the ground as well as the internal impulse experienced at the joints of the human body model is analyzed. Second, a motion planning algorithm exploiting the kinematic redundancy is suggested to ensure stability in terms of ZMP stability condition during a series of landing phases. Four phases of landing motion are investigated. In simulation, the external and internal impulses experienced at the human joints and the ZMP history resulting from the motion planning are analyzed for two different configurations. h desired landing posture is suggested by comparison of the simulation results.

• 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.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.30.6-30
• /
• 2001

We build near minimum-time trajectory planning algorithm for Wheeled mobile robots (WMRs) With Piece-Wise Constant control voltages satisfying i) initial and final postures and velocities as well as ii) voltage constraints We consider trajectory planning problem for cornering motion with a path-deviation requirement for obstacle avoidance. We divide our trajectory planning algorithm for cornering motion into five ordered sections: translational, transient, rotational, transient, and translational sections. Transforming dynamics into uncorrelated form with respect to translational and rotational velocities, we can make controls for translation/rotational velocities to be independent. By planning each section with constant voltages, and integrating five sections with adjustment of numbers of steps, the overall trajectory is planned. The performance is very close to the minimum-time solution, which is validated via simulation studies.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.545-550
• /
• 1991

Recently, the use of robots for painting operations has received much attention, as it is a powerful means for automation and quality improvement. Collision-avoidance is a key issue in the path planning for painting operations. In this paper, we develop a computationally efficient algorithm for the generation of collision-free path for two types of motion: a) Gross motion when the robot approaches the painting area, and b) Fine motion while spraying the surface. The former is a typical collision-avoidance problem, but the latter calls for special attention as the painting mechanics has to be incorporated into path planning. The developed algorithm is applied for the internal coating of the car body whose structure is the major source of collision.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.1034-1039
• /
• 1991

A robot motion planning algorithm for time-varying obstacle avoidance is proposed. The robot motion planning problem is replaced with the optimization problem by using the distance function with the divided configuration space. To divide the configuration space, the polar coordinate system is used. For each divided configuration space, the admissible region where the robot can reach without collisions is obtained using the distance function. For an object moving in a plane, the admissible region is described by linear constraints on the polar coordinate system. A numerical algorithm that solves the optimization problem is shown and the computer simulation is carried out.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• 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.

• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.9
• /
• pp.133-144
• /
• 2000

The dynamic walking planning and the inverse dynamics of the biped robot is investigated in this paper. The biped robot is modeled with 14 degrees of freedom rigid bodies considering the walking pattern and kinematic construction of humanoid. The method of the computer aided multibody dynamics is applied to the dynamic analysis. The equations of motion of biped are initially represented as terms of the Cartesian corrdinates then they are converted to the minimum number of equations of motion in terms of the joint coordinates using the velocity transformation matrix. For the consideration of the relationships between the ground and foot the holonomic constraints are added or deleted on the equations of motion. the number of these constraints can be changed by types of walking patterns with three modes. In order for the dynamic walking to be stabilizable optimized trunk positions are iteratively determined by satisfying the system ZMP(Zero Moment Point) and ground conditions.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.1
• /
• pp.161-166
• /
• 2011

This paper addresses the vision based autonomous walking control system. To handle the obstacles which exist beyond the field of view(FOV), we used the 3d panoramic depth image. Moreover, to decide the avoidance direction and walking motion of a humanoid robot for the obstacle avoidance by itself, we proposed the vision based path planning using 3d panoramic depth image. In the vision based path planning, the path and walking motion are decided under environment condition such as the size of obstacle and available avoidance space. The vision based path planning is applied to a humanoid robot, URIA. The results from these evaluations show that the proposed method can be effectively applied to decide the avoidance direction and the walking motion of a practical humanoid robot.

• Journal of the Korean Society for Precision Engineering
• /
• v.22 no.5 s.170
• /
• pp.95-102
• /
• 2005

The coordination of locomotion and manipulation has been the typical and main issue for a mobile manipulator. This is particularly because the solution for the control parameters is redundant and the accuracies of controlling the each joints are different. This paper presents a motion planning method for which the mobile base locomotion is less precise than the manipulator control. In such a case, it is appropriate to move the mobile base to discrete poses and then to move the manipulator to track a prescribed path of the end effector, while the base is stationary. It uses a variant of the conventional manipulability measure that is developed for the trajectory control of the end effector of the mobile manipulator along an arbitrary path in the three dimensional space. The proposed method was implemented on the simulation and the experiments of a mobile manipulator and showed its effectiveness.

• Advances in aircraft and spacecraft science
• /
• v.7 no.1
• /
• pp.53-78
• /
• 2020

Automatic trajectory planning is an important task that will have to be performed by truly autonomous vehicles. The main method proposed, for unmanned airplanes to do this, consists in concatenating elementary segments of trajectories such as rectilinear, circular and helical segments. It is argued here that because these cannot be expected to all be flyable at a same constant speed, it is necessary to consider segments on which the airplane accelerates or decelerates. In order to preserve the planning advantages that result from having the speed constant, it is proposed to do all speed changes at maximum deceleration or acceleration, so that they are as brief as possible. The constraints on the load factor, the lift and the power required for the motion are derived. The equation of motion for such accelerated motions is solved numerically. New results are obtained concerning the value of the angle and the speed for which the longest distance and the longest duration glides happen, and then for which the steepest, the fastest and the most fuel economical climbs happen. The values obtained differ from those found in most airplane dynamics textbooks. Example of tables are produced that show how general speed changes can be effected efficiently; showing the time required for the changes, the horizontal distance traveled and the amount of fuel required. The results obtained apply to all internal combustion engine-propeller driven airplanes.