• Spatial Information Research
• /
• v.18 no.4
• /
• pp.89-98
• /
• 2010

Recently, the target of navigation system is moving from the cars to pedestrians. Many researches are in progress regarding pedestrian navigation, However, in most cases, the path-finding is based on the existing node/link network model. which is widely used for the car navigation, and thus showing its limitation. The reasons arc that a) unlike with a car, the paths that pedestrians take arc not limited to the roads, b) pedestrians an~ not restricted in rotation or direction, and c) they can freely move within the walkable space. No alternatives have been offered yet, especially for openspaces such as a park or square. Therefore, in this research, we suggested appropriate methods to create paths that can be used in pedestrian navigation service, by using motion-planning technology, which is used in the field of robotics for planning the motion of an object, and conducted tests for their applicability.

• Journal of the Korea Computer Graphics Society
• /
• v.14 no.2
• /
• pp.9-17
• /
• 2008

We propose a method to determine camera parameters for character motion, which confiders the motion by itself. The basic idea is to approximately compute the area swept by the motion of the character's links that are orthogonally projected onto the image plane, which we call "Motion Area". Using the motion area, we can determine good fixed camera parameters and camera paths for a given character motion in the off-line or real-time camera control. In our experimental results, we demonstrate that our camera path generation algorithms can compute a smooth moving camera path while the camera effectively displays the dynamic features of character motion. Our methods can be easily used in combination with the method for generating occlusion-free camera paths. We expect that our methods can also be utilized by the general camera planning method as one of heuristics for measuring the visual quality of the scenes that include dynamically moving characters.

• Journal of Mechanical Science and Technology
• /
• v.18 no.1
• /
• pp.132-144
• /
• 2004

This paper presents a new method driving multiple robots to their goal position without collision. To consider the movement of the robots in a work area, we adopt the concept of avoidability measure. The avoidability measure figures the degree of how easily a robot can avoid other robots considering the velocity of the robots. To implement the concept to avoid collision among multiple robots, relative distance between the robots is proposed. The relative distance is a virtual distance between robots indicating the threat of collision between the robots. Based on the relative distance, the method calculates repulsive force against a robot from the other robots. Also, attractive force toward the goal position is calculated in terms of the relative distance. These repulsive force and attractive force are added to form the driving force for robot motion. The proposed method is simulated for several cases. The results show that the proposed method steers robots to open space anticipating the approach of other robots. In contrast, since the usual potential field method initiates avoidance motion later than the proposed method, it sometimes fails preventing collision or causes hasty motion to avoid other robots. The proposed method works as a local collision-free motion coordination method in conjunction with higher level of task planning and path planning method for multiple robots to do a collaborative job.

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

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.38 no.12
• /
• pp.995-1006
• /
• 1989

If robots have the ability to track the parts on a moving conveyor belt, the efficiency of the manipulation tasks will be increased. This paper presents a motion planning algorithm for conveyor tracking. Tracking trajectory of a robot manipulator is determined by belt speed, initial part position, and initial robot position. Torque limit, maximum velocity, maximum acceleration and maximum jerk are also taken into account. To obtain the tracking solution, the problem is converted to the linear quadratic tracking problem. We describe the manipulator dynamics as second order state equation using parametric functions. Constraints on torques and smoothness are converted to those on input and state variables. The solution of the state equation which minimizes the performance index is obtained by dynamic programming method. Numerical examples are then presented to demonstrate the utility of the motion planning method developed.

• Journal of Power System Engineering
• /
• v.16 no.4
• /
• pp.17-23
• /
• 2012

In this study, the numerical simulation and basin model test have been performed to evaluate sea worthiness and resistance performance for a small pre-planning three type of leisure boats which are U, V, Y shapes of hull forms. As a well known commercial CFD code, Maxsurf, was applied for modeling hull forms used as the solver of motion analysis. Also the model resistance test was carried out to estimate the effective power of boat in the basin tank. Numerical simulation and model test results show that Y-shaped hull is better than the other types in terms of heave and pitch motion, having a key effect on a boat sea worthiness. But V-type hull is more efficiency than others cases in resistance performance.

• The Journal of Korea Robotics Society
• /
• v.2 no.3
• /
• pp.234-241
• /
• 2007

Effective tools which can alleviate the complexity and computational load problem in collision-free motion planning for multi-agent system have steadily been demanded in robotics field. To reduce the complexity, the extended collision map (ECM) which adopts decoupled approach and prioritization is already proposed. In ECM, the collision regions which represent the potential collision of robots are calculated using the computational power; the complexity problem is not resolved completely. In this paper, we propose a mathematical analysis of the extended collision map; as a result, we formulate the collision region as an equation with 5-8 variables. For mathematical analysis, we introduce realistic assumptions as follows; the path of each robot can be approximated to a straight line or an arc and every robot moves with uniform velocity or constant acceleration near the intersection between paths. Our result reduces the computational complexity in comparison with the previous result without losing optimality, because we use simple but exact equations of the collision regions. This result can be widely applicable to coordinated multi-agent motion planning.

• Journal of Auto-vehicle Safety Association
• /
• v.11 no.3
• /
• pp.30-36
• /
• 2019

This paper suggests a car-following algorithm for urban environment, with multiple target candidates. Until now, advanced driver assistant systems (ADASs) and self-driving technologies have been researched to cope with diverse possible scenarios. Among them, car-following driving has been formed the groundwork of autonomous vehicle for its integrity and flexibility to other modes such as smart cruise system (SCC) and platooning. Although the field has a rich history, most researches has been focused on the shape of target trajectory, such as the order of interpolated polynomial, in simple single-lane situation. However, to introduce the car-following mode in urban environment, realistic situation should be reflected: multi-lane road, target's unstable driving tendency, obstacles. Therefore, the suggested car-following system includes both in-lane preceding vehicle and other factors such as side-lane targets. The algorithm is comprised of three parts: path candidate generation and optimal trajectory selection. In the first part, initial guesses of desired paths are calculated as polynomial function connecting host vehicle's state and vicinal vehicle's predicted future states. In the second part, final target trajectory is selected using quadratic cost function reflecting safeness, control input efficiency, and initial objective such as velocity. Finally, adjusted path and control input are calculated using model predictive control (MPC). The suggested algorithm's performance is verified using off-line simulation using Matlab; the results shows reasonable car-following motion planning.

• The Journal of Korea Robotics Society
• /
• v.19 no.3
• /
• pp.236-243
• /
• 2024

This paper introduces a dual manipulator system designed to automate the packaging process of industrial coils, which exhibit higher variability than other structured industrial fields due to diverse commercial requirements. The conventional solution involves the direct-teaching method, where an operator instructs the robot on a target configuration. However, this method has distinct limitations, such as low flexibility in dealing with varied sizes and safety concerns for the operators handling large products. In this sense, this paper proposes a two-step approach for coil packaging: motion planning and assembly execution. The motion planning includes a Rapidly-exploring Random Tree algorithm and a smoothing method, allowing the robot to reach the target configuration. In the assembly execution, the packaging is considered a peg-in-hole assembly. Unlike typical peg-in-hole assembly handling two workpieces, the packaging includes three workpieces (e.g., coil, inner ring, side plate). To address this assembly, the paper suggests a suitable strategy for dual manipulation. Finally, the validity of the proposed system is demonstrated through experiments with three different sizes of coils, replicating real-world packaging situations.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.168-173
• /
• 2003

In this paper, we will present a deeper look on optimal design methods that are related to path-planning for a mobile robot. To control the motion of a mobile robot in a clustered environment, it's necessary to know a suitable trajectory assuming certain start and goal point. Up to now, there are many literatures that concern optimal path planning for an obstacle avoided mobile robot. Among those literatures, we have chosen 2 novel methods for our further analysis. The first approach [4] is based on HJB(Hamilton-Jacobi-Bellman) equation whose solution is the return-function that helps to generate a shortest path to the goal. The later [5] is called polynomial-path-planning approach, in this method, a shortest polynomial-shape path would become a solution if it was a collision-free path. The camera network plays the role as sensors to generate updated map which locates the static and dynamic objects in the space. Therefore, the exhibition of both path planning and dynamic obstacle avoidance by the updated map would be accomplished simultaneously. As we mentioned before, our research will include the motion control of a true mobile robot on those optimal planned paths which were generated by above algorithms. Base on the kinematic and dynamic simulation results, we can realize the affection of moving speed to the stable of motion on each generated path. Also, we can verify the time-optimal trajectory through velocity tuning. To simplify for our analysis, we assumed the obstacles are cylindrical circular objects with the same size.