• Journal of the Korean Society for Railway
• /
• v.12 no.1
• /
• pp.135-143
• /
• 2009

The majority of development projects fail to meet their target schedule and cost, with the overrun typically between 40 and 200 percent. These overruns happen because the planners underestimate the work or do not consider the need to rework at project planning. Representative schedule planning/management techniques such as Gantt Chart, PERT/CPM etc. that are used in domestic project planning are unable to reflect rework. This paper proposes a method to consider rework to provide more realistic estimates at schedule planning. Additionally, to prevent the underestimation of the work this paper proposes a simulation method that calculates a probabilistic estimated schedule and the associated variance based on the random variable modeling of individual task completion dates.

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

A new algorithm for planning a collision-free path based on algebraic curve is developed and the concept of collision-free Path Space (PS) is introduced. This paper presents a Geometry Mapping (GM) based on two straight curves in which the intermediate connection point is organized in elliptic locus ($\delta$, $\theta$). The GM produces two-dimensional PS that is used to create the shortest collision-free path. The elliptic locus of intermediate connection point has a special property in that the total distance between the focus points through a point on ellipse is the same regardless of the location of the intermediate connection point on the ellipse. Since the radial distance, a, represents the total length of the path, the collision-free path can be found as the GM proceeds from $\delta$=0 (the direct path) to $\delta$=$\delta$$\_$max/(the longest path) resulting in the minimum time search. The GM of elliptic workspace (EWS) requires calculation of interference in circumferential direction only. The procedure for GM includes categorization of obstacles to .educe necessary calculation. A GM based on rectangular workspace (RWS) using Cartesian coordinate is also considered to show yet another possible GM. The transformations of PS among Circular Workspace Geometry Mapping (CWS GM) , Elliptic Workspace Geometry Mapping (EWS GM) , and Rectangular Workspace Geometry Mapping (RWS GM), are also considered. The simulations for the EWS GM on various computer systems are carried out to measure performance of algorithm and the results are presented.

• Journal of Internet of Things and Convergence
• /
• v.10 no.5
• /
• pp.27-37
• /
• 2024

In the context of multi-vehicle and multi-task logistics distribution within a park, traditional algorithms are often hindered by high computational complexity and slow convergence rates. Particle Swarm Optimization (PSO) has gained popularity in path planning for autonomous delivery vehicles due to its straightforward algorithmic principles, broad applicability, and comprehensive search capabilities. However, the conventional PSO is susceptible to premature convergence, leading to local optima. To address this, this study incorporates the Tent map into the PSO to enhance the algorithm's global search ability and prevent premature convergence. Benchmark function tests demonstrate that the improved Particle Swarm Optimization algorithm (TPSO), as proposed in this study, exhibits faster convergence and greater accuracy.In the instance verification section, X Park was selected as an example to construct a multi-vehicle and multi-task model for the logistics distribution within the park. The TPSO algorithm proposed in this paper was used to solve the model, and finally, the superiority of the TPSO algorithm was verified through comparative simulation.

• Korean Journal of Health Education and Promotion
• /
• v.31 no.5
• /
• pp.159-166
• /
• 2014

Purpose: In spite of many Healthy Cities projects in Korea, there are few research about healthy urban planning. So we tried to use available recent models to a Healthy Cities project in a medium sized city in Gyeongnam province. Methods: Using mainly European Healthy Urban Planning Model and opinion leader survey, SWOT analysis, forum and discussion have been done to a city. Secondary city health indicator obtained from Ministry of Statistics. Results: There are strong need to develop health industry, green traffic and healthy living from survey using Healthy Cities policy direction of Korean Health Promotion Fund. Among the Healthy Urban Planning objectives, improvements of physical environments, prevention of accidents and crime, improvements of healthy esthetics rated highly. Although environmental pollution was problem local government push forward to the pilot healthy urban project as active healthy water-front development. Considering secondary healthy city indicators, change of external forces and internal capacity final task for healthy urban planning for Yangsan city were development of riverside physical education park and active living and anti-ageing environments etc. Conclusions: Comprehensive assessment and plan was possible through MAPP Model using European Healthy Urban Planning objectives to draw the direction of future urban planning for Healthy Cities Projects. Further research and formal introduction would be needed.

• Korean Journal of Remote Sensing
• /
• v.28 no.4
• /
• pp.459-466
• /
• 2012

Satellite operation is divided as user's request, image collection planning, product generation, distribution. Image collection planning is to make image collection plan of satellite to reflect user's request in proper time based on NTO (New Task Order) and AO (Archive Order) using limited satellite resources. Image collection planning has high computational cost because of considering several variables simultaneously, is to be performed identical process repeatedly. In this paper, optimization research of image collection planning is performed for efficient planning. First, formulation of image collection planning is made to require satellite image as much as possible and then Heuristic algorithm is suggested for solution of formulation.

• International Journal of Control, Automation, and Systems
• /
• v.2 no.1
• /
• pp.107-117
• /
• 2004

A new algorithm for planning a collision-free path based on an algebraic curve as well as the concept of path space is developed. Robot path planning has so far been concerned with generating a single collision-free path connecting two specified points in a given robot workspace with appropriate constraints. In this paper, a novel concept of path space (PS) is introduced. A PS is a set of points that represent a connection between two points in Euclidean metric space. A geometry mapping (GM) for the systematic construction of path space is also developed. A GM based on the 2$^{nd}$ order base curve, specifically Bezier curve of order two is investigated for the construction of PS and for collision-free path planning. The Bezier curve of order two consists of three vertices that are the start, S, the goal, G, and the middle vertex. The middle vertex is used to control the shape of the curve, and the origin of the local coordinate (p, $\theta$) is set at the centre of S and G. The extreme locus of the base curve should cover the entire area of actual workspace (AWS). The area defined by the extreme locus of the path is defined as quadratic workspace (QWS). The interference of the path with obstacles creates images in the PS. The clear areas of the PS that are not mapped by obstacle images identify collision-free paths. Hence, the PS approach converts path planning in Euclidean space into a point selection problem in path space. This also makes it possible to impose additional constraints such as determining the shortest path or the safest path in the search of the collision-free path. The QWS GM algorithm is implemented on various computer systems. Simulations are carried out to measure performance of the algorithm and show the execution time in the range of 0.0008 ~ 0.0014 sec.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.8
• /
• pp.1483-1490
• /
• 2009

This parer is presented multiple path-planning of unmanned autonomous forklift using modified genetic algorithm and fuzzy inference system. There are a task-level feedback method and a method that path is dynamically replaned in realtime while the autonomous vehicles are moving by means of an optimal algorithm for existing multiple path-planning. However, such methods cause malfunctions and inefficiency in the sense of time and energy, and path-planning should be dynamically replanned in realtime. To solve these problems, we propose multiple path-planning using modified genetic algorithm and fuzzy inference system and show the performance with autonomous vehicles. For experiment, we designed and built two autonomous mobile vehicles that equipped with the same driving control part used in actual autonomous forklift, and test the proposed multiple path-planning algorithm. Experimental result that actual autonomous mobile vehicle, we verified that fast optimized path-planning and efficient collision avoidance are possible.

• Journal of Korean Society of Rural Planning
• /
• v.2 no.1
• /
• pp.57-68
• /
• 1996

Village Renewal(Dorferneuerung) Policy Program in Germany, directly originated from Rural Beutification Movement between mid 18C and mid 19C, has several characteristics as follows. First, we can find out the planned approach in land use and settlement reorganization of Pillage Renewal Program. There are three ways to designate the planning area of the village rearrangement project in countryside. One is to designate the detailed B-plan district by urban plan for the village over some size defined legally. Another is to have a living space of settlement be contained in land allotment project area. In this case, residential areas of several villages related to agricultural land consolidation should be simultaneously designated as the project area. The last is only for the built environment focused on the living space. Second, the emphasis in German village encouragement program can be made on the integral approach through which sets of policy programs of the land allotment, the living environment improvement, the physical landscape management and the cultural resources conservation are intensively implemented together. Third, the bottom-up and community participation approach can be greatly stressed on the planning and implementation process, Community participation, subsidy application to local government by residents themselves, community consensus on architectural style and outdoor spatial form, etc. have been recognized as an effective strategy to accomplish the task of village activity promotion.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.12
• /
• pp.1232-1239
• /
• 2009

This paper proposes an exploration strategy to efficiently find a specific place in large unknown environments with wall-following based path planning. Many exploration methods proposed so far showed good performance but they focused only on efficient planning for modeling unknown environments. Therefore, to successfully accomplish the room finding task, two additional requirements should be considered. First, suitable path-planning is needed to recognize the room number. Most conventional exploration schemes used the gradient method to extract the optimal path. In these schemes, the paths are extracted in the middle of the free space which is usually far from the wall. If the robot follows such a path, it is not likely to recognize the room number written on the wall because room numbers are usually too small to be recognized by camera image from a distance. Second, the behavior which re-explores the explored area is needed. Even though the robot completes exploration, it is possible that some rooms are not registered in the constructed map for some reasons such as poor recognition performance, occlusion by a human and so on. With this scheme, the robot does not have to visit and model the whole environment. This proposed method is very simple but it guarantees that the robot can find a specific room in most cases. The proposed exploration strategy was verified by various experiments.

• Journal of Korean Society for Quality Management
• /
• v.41 no.1
• /
• pp.149-162
• /
• 2013

Purpose: The purpose of this study was to design of a probabilistic model for optimum manpower planning in R&D department by Montecarlo simulation. Methods: We investigate the process and the requirement of manpower planning and scheduling in R&D department. The empirical distributions of necessary time and manpower for R&D projects are developed. From the empirical distributions, we can estimate a probability distribution of optimum manpower in R&D department. A simulation method of estimating the probability distribution of optimum manpower is considered. It is a useful tool for obtaining the sum, the variance and other statistics of the distributions. Results: The real industry cases are given and the properties of the model are investigated by Montecarlo Simulation. we apply the model to the research laboratory of the global company, and investigate and compensate the weak points of the model. Conclusion: The proposed model provides various and correct information such as average, variance, percentile, minimum, maximum and so on. A decision maker of a company can easily develop the future plan and the task of researchers may be allocated properly. we expect that the productivity can be improved by this study. The results of this study can be also applied to other areas including shipbuilding, construction, and consulting areas.