• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.04a
• /
• pp.139-143
• /
• 2004

Lee et al have proposed a framework for the linguistic map-based navigational planning of a mobile robot on dynamic environment and provided simulation results applied it to the static environment[1], In this paper, we extends the navigational planning of a mobile robot into dynamic environment. There are two kinds of dynamic obstacles： (1) Time-obstacles that change condition of obstacles with time. (2) Space-obstacles that move their position with time. We propose an algorithm which a mobile robot identifies and avoids the two kinds of dynamic obstacles. The proposed algorithm consists of two stages： (1) The fuzzy logic-based perception stage which identifies the dynamic obstacles around a mobile robot by using sensory data and fuzzy rules, (2) The planning stage which plans the path to goal by avoiding the dynamic obstacles[2-6]. We provide computer simulation results for a mobile robot in order to show the validity of the proposed algorithm.

• 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 the Korean Operations Research and Management Science Society
• /
• v.34 no.3
• /
• pp.71-84
• /
• 2009

This paper considers a remanufacturing and purchasing planning problem, in which either used products(or wastes) are remanufactured or remanufactured products(or final products) are purchased to satisfy dynamic demands of remanufactured products over a discrete and finite time horizon. Also, as remanufactured products are purchased more than or equal to a special quantity Q, a discount price policy is applied. The problem assumes that the related cost(remanufacturing and inventory holding costs of used products, and the purchasing and inventory holding costs of remanufactured products) functions are concave and backlogging is not allowed. The objective of this paper is to determine the optimal remanufacturing and purchasing policy that minimizes the total cost to satisfy dynamic demands of remanufactured products. This paper characterizes the properties of the optimal policy and then, based on these properties, presents a dynamic programming algorithm to find the optimal policy. Also, a network-based procedure is proposed for the case of a large quantity of low cost used products. A numerical example is then presented to demonstrate the procedure of the proposed algorithm.

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

• Journal of Electrical Engineering and Technology
• /
• v.12 no.2
• /
• pp.918-925
• /
• 2017

This paper presents a path planning problem for multi-robot system in the environment with dynamic obstacles. In order to guide the robots move along a collision-free path efficiently and reach the goal position quickly, a navigation method based on fuzzy logic controllers has been developed by using proximity sensors. There are two kinds of fuzzy controllers developed in this work, one is used for obstacle avoidance and the other is used for orientation to the target. Both static and dynamic obstacles are included in the environment and the dynamic obstacles are defined with no type of restriction of direction and velocity. Here, the environment is unknown for all the robots and the robots should detect the surrounding information only by the sensors installed on their bodies. The simulation results show that the proposed method has a positive effectiveness for the path planning problem.

• IE interfaces
• /
• v.14 no.1
• /
• pp.9-19
• /
• 2001

Production planning and control system plays an important role in manufacturing companies because it determines all production capacity planning, material procurement planning, and production scheduling which are needed in the process of producing products. Many researches on production planning and control system have been conducted for many manufacturing companies for recent decade. But, a considerable research achievement has mainly been obtained on the forecast-driven production for a make-to-stock and an assemble-to-order. The reason is that there are some hardships such as difficulties of standardizing product information, the frequent changes of design and material, and the unexpected dynamic events that influence the production of customer's order in a make-to-order or an engineering-to-order environments. By these characteristics and their complexities, some studies for production planning and control system in a make-to-order environment are presented recently. In this paper, we present the framework of the hietachical production planning and control for a make-to-order environment with dynamic events. In order to illustrate the usefulness of the proposed framework for a hietachical production planning and control, the information system for a make-to-order production was implemented with the object of the company of producing electricity transformer.

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

• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.3098-3100
• /
• 1999

A genetic algorithm for global and local path planning and collision avoidance of mobile robot in dynamic working environment is proposed. The genetic algorithm searches for a path in the entire and continuous free space and unifies global path planning and local path planning. The simulation shows the proposed method is an efficient and effective method when compared with the traditional collision avoidance algorithms.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2000.06a
• /
• pp.93-105
• /
• 2000

GIS is a powerful toolbox in managing spatial data associated with attribute data. However GIS is short of spatial analysis function and graphic user interface(GUI) function in dealing with dynamic planning problems. Decision Support Systems(DSS) make up for the shortage of GIS by providing GUI function, modeling function and database function. Spatial Decision Support Systems(SDSS), a new kind of DSS, incorporate display function, basic spatial analysis function and manipulation function of spatial data and attribute data of GIS and GUI function, modeling function and database function of DSS in dealing with spatial planning problems. Planning Support Systems(PSS) add more advanced spatial analysis function and intertemporal function to the functions of SDSS. This study focuses on the modeling of a PSS for capacity expansion of water-distribution network depending upon land use planning by using GIS, value engineering(VE) and life cycle costing(LCC). The PSS shows a guideline about the investment of water-distribution networks related to urban growth management through generating certain numbers of dynamic alternatives to supply the amount of water caused by land use planning.