• Journal of the Institute of Convergence Signal Processing
• /
• v.21 no.2
• /
• pp.55-60
• /
• 2020

In this paper, we propose a fast block matching algorithm of motion estimation using early detection of optimal candidate with high priority and a threshold. Even though so many fast algorithms for motion estimation have been published to reduce computational reduction full search algorithm, still so many works to improve performance of motion estimation are being reported. The proposed algorithm calculates block matching error for each candidate with high priority from previous partial matching error. The proposed algorithm can be applied additionally to most of conventional fast block matching algorithms for more speed up. By doing that, we can find the minimum error point early and get speed up by reducing unnecessary computations of impossible candidates. The proposed algorithm uses smaller computation than conventional fast full search algorithms with the same prediction quality as the full search algorithm. Experimental results shows that the proposed algorithm reduces 30~70% compared with the computation of the PDE and full search algorithms without any degradation of prediction quality and further reduces it with other fast lossy algorithms.

• 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 Institute of Control, Robotics and Systems
• /
• v.5 no.7
• /
• pp.836-840
• /
• 1999

Linear motion and angular motion in task space are handled separately in joint velocity planning for redundant robot manipulators. In solving inverse kinematic equations with given joint velocity limits, we consider the order of priority for linear motion and angular motion. The proposed method will be useful in such applications where only linear motions are important than angular motions or vice versa.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.6
• /
• pp.107-115
• /
• 1998

A path planning using potential field method is very useful for the real-time navigation of mobile robots. However, the method needs high modeling cost to calculate the potential field because of complex preprocessing, and mobile robots may get stuck into local minima. In this paper, An efficient path planning algorithm for multiple mobile robots, based on the potential field method, was proposed. In the algorithm. the concepts of subgoals and obstacle priority were introduced. The subgoals can be used to escape local minima, or to design and change the paths of mobile robots in the work space. In obstacle priority, all the objects (obstacles and mobile robots) in the work space have their own priorities, and the object having lower priority should avoid the objects having higher priority than it has. In this paper, first, potential based path planning method was introduced, next an efficient collision-avoidance algorithm for multiple mobile robots, moving in the obstacle environment, was proposed by using subgoals and obstacle priority. Finally, the developed algorithm was demonstrated graphically to show the usefulness of the algorithm.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.1
• /
• pp.121-130
• /
• 2014

The goal of this study was to contemplate the impact of visual formative elements on the satisfaction level of visitors in websites of toy-style products. To attain the goal, the visual element of motion graphics in websites of toy-style products, i. e., color, layout, illustration, and, typography, were independent variables and the satisfaction level of visitors as a dependent variable. The variables were analyzed objectively. First, it appeared that visual formative elements of motion graphics appeared in websites of toy-style products exerted statistically significant impacts on the satisfaction level of visitors. Second, the element exerting the most significant impact on the satisfaction level of visitors among the visual formative elements in websites of toy-style products were appeared as 'illustration' and 'color'. Thus, it was concluded that it is necessary to give priority in 'illustration' and 'color' to enhance the satisfaction level of visitors.

• 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 Korea Society of Digital Industry and Information Management
• /
• v.9 no.4
• /
• pp.189-199
• /
• 2013

The goal of this study was to contemplate the impact of emotional elements of motion graphics on the brand preference in websites of TV products. To attain the goal, the emotional elements of motion graphics in websites of TV products, i.e., color, graphic image, typography, and layout, were set as independent variables and the brand preference as a dependent variable. The variables were analyzed objectively. Samples were collected from selected design students attending technical colleges. Among 282 samples collected, 15 were discarded as unfeasible and the remaining 267 were used in the analysis. Statistical analysis techniques used in the study included factor analysis, reliability analysis, correlation analysis, and multiple regression analysis; and 'SPSS Win. 11.5' was used to perform the statistical analysis. From the analysis, the following two results were obtained. First, it appeared that emotional elements of motion graphics appeared in websites of TV products exerted statistically significant impacts on the brand preference. Second, the element exerting the most significant impact on the brand preference among the emotional elements were appeared as 'graphic image' and 'color'. Thus, it was concluded that it is necessary to give priority in 'graphic image' and 'color' to enhance the brand preference.

• The Journal of Korea Robotics Society
• /
• v.7 no.1
• /
• pp.35-44
• /
• 2012

This paper presents a method to optimize motion planning for industrial manipulators with redundancy. For optimal motion planning, first of all, particular inverse kinematic solution is needed to improve efficiency for manipulators with redundancy working in various environments. In this paper, we propose three kinds of methods for solving inverse kinematics problems; numerical and combined approach. Also, we introduce methods for optimal motion planning using potential function considering the order of priority. For efficient movement in industrial settings, this paper presents methods to plan motions by considering colliding obstacles, joint limits, and interference between whole arms. To confirm improved performance of robot applying the proposed algorithms, we use two kinds of robots with redundancy. One is a single arm robot with 7DOF and another is a dual arm robot with 15DOF which consists of left arm, right arm with each 7DOF, and a torso part with 1DOF. The proposed algorithms are verified through several numerical examples as well as by real implementation in robot controllers.

• Journal of Biosystems Engineering
• /
• v.38 no.2
• /
• pp.138-148
• /
• 2013

Purpose: Determining an appropriate path is a top priority in order for a robot to maneuver in a dynamically efficient way especially in a pick-and-place task. In a non-standardized work environment, current robot arm executes its motion based on the kinematic displacements of joint variables, though resulting motion is not dynamically optimal. In this research we suggest analyzing and applying motion patterns of the human arm as an alternative to perform near optimum motion trajectory for arbitrary pick-and-place tasks. Methods: Since the motion of a human arm is very complicated and diverse, it was simplified into two links: one from the shoulder to the elbow, and the other from the elbow to the hand. Motion patterns were then divided into horizontal and vertical components and further analyzed using kinematic and dynamic methods. The kinematic analysis was performed based on the D-H parameters and the dynamic analysis was carried out to calculate various parameters such as velocity, acceleration, torque, and energy using the Newton-Euler equation of motion and Lagrange's equation. In an attempt to assess the efficacy of the analyzed human motion pattern it was compared to the virtual motion pattern created by the joint interpolation method. Results: To demonstrate the efficacy of the human arm motion mechanical and dynamical analyses were performed, followed by the comparison with the virtual robot motion path that was created by the joint interpolation method. Consequently, the human arm was observed to be in motion while the elbow was bent. In return this contributed to the increase of the manipulability and decrease of gravity and torque being exerted on the elbow. In addition, the energy required for the motion decreased. Such phenomenon was more apparent under vertical motion than horizontal motion patterns, and in shorter paths than in longer ones. Thus, one can minimize the abrasion of joints by lowering the stress applied to the bones, muscles, and joints. From the perspectives of energy and durability, the robot arm will be able to utilize its motor most effectively by adopting the motion pattern of human arm. Conclusions: By applying the motion pattern of human arm to the robot arm motion, increase in efficiency and durability is expected, which will eventually produce robots capable of moving in an energy-efficient manner.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.10
• /
• pp.855-868
• /
• 2004

There are several types of singularities in controlling robotic manipulators: kinematic singularity, algorithmic singularity, semi-kinematic singularity, semi-algorithmic singularity, and representation singularity. The kinematic and algorithmic singularities have been investigated intensively because they are not predictable or difficult to avoid. The problem with these singularities is an unnecessary performance reduction in non-singular region and the difficulty in performance tuning. Tn this paper, we propose a method of avoiding kinematic and algorithmic singularities by applying a task reconstruction approach while maximizing the task performance by calculating singularity measures. The proposed method is implemented by removing the component approaching the singularity calculated by using singularity measure in real time. The outstanding feature of the proposed task reconstruction method (TR-method) is that it is based on a local task reconstruction as opposed to the local joint reconstruction of many other approaches. And, this method has dynamic task priority assignment feature which ensures the system stability under singular regions owing to the change of task priority. The TR-method enables us to increase the task controller gain to improve the task performance whereas this increase can destabilize the system for the conventional algorithms in real experiments. In addition, the physical meaning of tuning parameters is very straightforward. Hence, we can maximize task performance even near the singular region while simultaneously obtaining the singularity-free motion. The advantage of the proposed method is experimentally tested by using the 7-dof spatial manipulator, and the result shows that the new method improves the performance several times over the existing algorithms.