• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.39 no.6
• /
• pp.549-559
• /
• 2015

In this paper, an efficient dynamic reactive motion planning method for an autonomous vehicle in a dynamic environment is proposed. The purpose of the proposed method is to improve the robustness of autonomous robot motion planning capabilities within dynamic, uncertain environments by integrating a virtual plane-based reactive motion planning technique with a sensor fusion-based obstacle detection approach. The dynamic reactive motion planning method assumes a local observer in the virtual plane, which allows the effective transformation of complex dynamic planning problems into simple stationary ones proving the speed and orientation information between the robot and obstacles. In addition, the sensor fusion-based obstacle detection technique allows the pose estimation of moving obstacles using a Kinect sensor and sonar sensors, thus improving the accuracy and robustness of the reactive motion planning approach. The performance of the proposed method was demonstrated through not only simulation studies but also field experiments using multiple moving obstacles in hostile dynamic environments.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.1
• /
• pp.53-60
• /
• 2010

We propose a motion planning method for autonomous mobile robots. In order to minimize traveling time, a smooth path and a time optimal velocity profile should be generated under kinematic and dynamic constraints. In this paper, we develop an effective and practical method to generate a good solution with lower computation time. The initial path is obtained from voronoi diagram by Dijkstra's algorithm. Then the path is improved by changing the graph and path simultaneously. 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.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.

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

We build a local minimum free motion planning for mobile robots considering dynamic environments by simple sensor fusion assuming that there are unknown obstacles which can be detected only partially at a time by proximity sensors and can be cleaned up or moved slowly (dynamic environments). Potential field is used as a basic platform for the motion planning. To clear local minimum problem, the partial information on the obstacles should be memorized and integrated effectively. Sets of linked line segments (SLLS) are proposed as the integration method. Then robot's target point is replaced by virtual target considering the integrated sensing information. As for the main proximity sensors, we use laser slit emission and simple web camera since the system gives more continuous data information. Also, we use ultrasonic sensors as the auxiliary sensors for simple sensor fusion considering the advantages in that they give exact information about the presence of any obstacle within certain range. By using this sensor fusion, the dynamic environments can be dealt easily. The performance of our algorithm is validated via simulations and experiments.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.4
• /
• pp.126-135
• /
• 1997

A sensorless motion planner which succeeds in grasping a polygonal part firmly into a desired orientation has been developed through the dynamic analysis. The analytical results on the impact process with friction are used for modeling the contact motionduring the parallel-jaw grasp operation, which is com- posed of the pushing and the squeezing process. The developed planner succeeds in grasping a part into a specified orientation in the face of uncertainties of initial position and orientation of the part, motion direction of the finger, and the physical parameters such as the coefficients of friction and restitution. The motion planner has been fully implemented into a viable package on the computer system, and verified experimentally. The motion of parts is recorded using a high-speed video camera, and then compared to the results of the planner and the graphic simulation results that illustrate the simulated motion of the grasp operation.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.154-159
• /
• 1989

This paper presents a motion planning algorithm for conveyor tracking. We formulate the problem as the linear quadratic tracking problem in optimal control theory and solve it through dynamic programming. In the proposed algorithm, the steady-state tracking error is eliminated completely, and the joint torque, velocity, acceleration, and jerks are considered as some constraints. Numerical examples are then presented to demonstrate the utility of the proposed motion planning algorithm.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.11a
• /
• pp.787-792
• /
• 1996

The method of manipulation by striking a part and letting it slide until it comes to rest, has been very little studied. However, the manipulation method is not uncommon in our daily lives. We analyze the dynamic behavior of a rigid polygonal part being striked and sliding on a horizontal surface under the action of fiction. There are two parts in this problem; one is the impact problem, and the other is the sliding problem. We characterize the impact and sliding dynamics with friction for polygonal parts, and present the possibility of reverse calculation for motion planning of striking operations. Using a high speed video camera, the computer simulation results are experimentally verified.

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

• Electronics and Telecommunications Trends
• /
• v.39 no.4
• /
• pp.10-20
• /
• 2024

Recent advancements in autonomous flight technologies for Unmanned Aerial Vehicles (UAVs) have greatly expanded their applicability for various tasks, including delivery, agriculture, and rescue. This article presents a comprehensive survey of path planning techniques in autonomous navigation and exploration that are tailored for UAVs. The robotics literature has studied path and motion planning, from basic obstacle avoidance to sophisticated algorithms capable of dynamic decision-making in challenging environments. In this article, we introduce popular path and motion planning approaches such as grid-based, sampling-based, and optimization-based planners. We further describe the contributions from the state-of-the-art in exploration planning for UAVs, which have been derived from these well-studied planners. Recent research, including the method we are developing, has improved performance in terms of efficiency and scalability for exploration tasks in challenging environments without human intervention. On the basis of these research and development trends, this article discusses future directions in UAV path planning technologies, illustrating the potential for UAVs to perform complex tasks with increased autonomy and efficiency.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.47 no.5
• /
• pp.379-387
• /
• 2019

The complexity of path planning for visiting multiple mission points is even larger than that of single pair path planning. Deciding a path for visiting n mission points requires conducting $n^2+n$ times of single pair path planning. We propose Multiple Mission $D^*$ Lite($MMD^*L$) which is an optimal path planning algorithm for visiting multiple mission points in dynamic environments. $MMD^*L$ reduces the complexity by reusing the computational data of preceding single pair path planning. Simulation results show that the complexity reduction is significant while its path optimality is not compromised.