• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.33 no.3
• /
• pp.1191-1202
• /
• 2013

The former researches on earthwork automation were mainly focused on GPS and sensor application, environment modelling, equipment path planning, work information management, and remote control etc. Recently, reducing $CO_2$ emission becomes one of main focuses for an automation research. In the case of earthwork operations, many kinds of construction machines or robots are involved, which can cause high level of $CO_2$ in a construction site. An effective earthwork plan and construction machine operation can both increase productivity and safety and decrease $CO_2$ emission level. In this research, some automation concepts for green earthworks are suggested such as a 3D construction site model, a 3D earthwork distribution based on two different earthwork methods, and an earthwork package construction method. A excel-based simulator is developed to generate the 3D earthwork distribution and to estimate the level of $CO_2$ emission for the given earthwork.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.155-156
• /
• 2009

In this paper we present 3D image analysis of liver and blood vessels using MDCT. The purpose is to enhance the performance of clinician in assessing anatomical information of liver and blood vessels. The system consists of two parts: 3D image reconstruction and analysis of the 3D liver and blood vessel image. The central vein of the liver is the most important blood vessel for the liver transplantation. We will find the central vein's location and characteristic, and will scheme out a computer assistant liver transplantation planning. It will be an effective tool for interventional radiology, surgical planning, and quantitative diagnosis.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.44 no.6
• /
• pp.71-82
• /
• 2002

The purpose of this study is to develop a 3 dimensional spatial planning model (3DSPLAM) for facilities allocation and visual evaluation in improvement planning of rural village. For the model development, this study developed both planning layers and a modelling process for spatial planning of rural villages. The 3DSPLAM generates road networks and village facilities location automatically from built area plan map and digital elevation model generated by geographic information system. The model also simulates 3-dimensional villagescape for visual presentation of the planned results. The 3DSPLAM could be conveniently used for automatic allocation of roads, easy partition of land lots and reasonable locating of facilities. The planned results could be also presented in the stereoscopic models with varied viewing positions and angles.

• Korean Journal of Computational Design and Engineering
• /
• v.17 no.4
• /
• pp.253-261
• /
• 2012

In order to make dental implant surgery successful, it is important to perform proper planning for dental implant placement. In this paper, we propose a decent approach to dental implant placement planning based on geometric processing of 3D models of jawbones, a nerve curve and neighboring teeth around a missing tooth. Basically, the minimum enclosing cylinders of the neighboring teeth around the missing tooth are properly used to determine the position and direction of the implant placement. The position is computed according to the radii of the cylinders and the center points of their top faces. The direction is computed by the weighted average of the axes of the cylinders. For a cylinder whose axis passes the position along the direction, its largest radius and longest length are estimated such that it does not interfere with the neighboring teeth and the nerve curve, and they are used to select the size and type of an implant fixture. From the geometric and spatial information of the jawbones, the teeth and the fixture, we can construct the 3D model of a surgical guide stent which is crucial to perform the drilling operation with ease and accuracy. We have shown the validity of the proposed approach by performing the finite element analysis of the influence of implant placement on bone stress distribution. Adopted in 3D simulation of dental implant placement, the approach can be used to provide dental students with good educational contents. It is also expected that, with further work, the approach can be used as a useful tool to plan for dental implant surgery.

• KIPS Transactions on Software and Data Engineering
• /
• v.11 no.9
• /
• pp.363-370
• /
• 2022

Grasping a target object among clutter objects without collision requires machine intelligence. Machine intelligence includes environment recognition, target & obstacle recognition, collision-free path planning, and object grasping intelligence of robot hands. In this work, we implement such system in simulation and hardware to grasp a target object without collision. We use a RGB-D image sensor to recognize the environment and objects. Various path-finding algorithms been implemented and tested to find collision-free paths. Finally for an anthropomorphic robot hand, object grasping intelligence is learned through deep reinforcement learning. In our simulation environment, grasping a target out of five clutter objects, showed an average success rate of 78.8%and a collision rate of 34% without path planning. Whereas our system combined with path planning showed an average success rate of 94% and an average collision rate of 20%. In our hardware environment grasping a target out of three clutter objects showed an average success rate of 30% and a collision rate of 97% without path planning whereas our system combined with path planning showed an average success rate of 90% and an average collision rate of 23%. Our results show that grasping a target object in clutter is feasible with vision intelligence, path planning, and deep RL.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.50 no.3
• /
• pp.157-164
• /
• 2022

In this paper, we describe how to implement the mountainous terrain, radar, and air defense network for UAV path planning in a 3-D environment, and perform path planning and re-planning using the PRM algorithm, a sampling-based path planning algorithm. In the case of the original PRM algorithm, the calculation to check whether there is an obstacle between the nodes is performed 1:1 between nodes and is performed continuously, so the amount of calculation is greatly affected by the number of nodes or the linked distance between nodes. To improve this part, the proposed LineGridMask method simplifies the method of checking whether obstacles exist, and reduces the calculation time of the path planning through parallelization. Finally, comparing performance with existing PRM algorithms confirmed that computational time was reduced by up to 88% in path planning and up to 94% in re-planning.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.16 no.3
• /
• pp.1-8
• /
• 2017

Tool path generation is a part of process planning in 3D printing. This is done before actual printing by a computer rather than an AM machine. The mesh geometry of the 3D model is sliced layer-by-layer along the Z-axis and tool paths are generated from the sliced layers. Each 2-dimensional layer can have two types of printing paths: (i) shell and (ii) infill. Shell paths are made of offset loops. During shell generation, twists can be produced in offset loops which will cause twisted tool paths. As a twisted tool path cannot be printed, it is necessary to remove these twists during process planning. In this research, An algorithm is presented to remove twists from the offset loops. To do so the path segments are traversed to identify twisted points. Outer offset loops are represented in the counter-clockwise segment order and clockwise rotation for the inner offset loop to decide which twisted loop should be removed. After testing practical 3D models, the proposed algorithm is verified to use in tool path generation for 3D printing.

• Journal of Korea Technology Innovation Society
• /
• v.2 no.3
• /
• pp.118-128
• /
• 1999

This study attempts to provide an efficient method for managing the Nuclear R&D projects. It should be noted that the technology and experiences to develop a well-balanced plan and mon-itoring for the R&D project are not yet well established when compared with the commercial con-structionand engineering projects. This study recommends that the R&D project manager utilize the scheduling techniques to establish an integral management system taking in to account the un-certainties in the research environment. Based upon the results of a case study for the Liquid Metal Reactor Design Technology Development Project which is led by the KAERI this study also con-firms that it is possible to run the national nuclear R&D projects with the Scheduling & Planning.

• The Journal of Korea Robotics Society
• /
• v.13 no.2
• /
• pp.121-128
• /
• 2018

Obstacle avoidance is one of the most important parts of autonomous mobile robot. In this study, we proposed safe and efficient local path planning of robot for obstacle avoidance. The proposed method detects and tracks obstacles using the 3D depth information of an RGB-D sensor for path prediction. Based on the tracked information of obstacles, the paths of the obstacles are predicted with probability circle-based spatial search (PCSS) method and Gaussian modeling is performed to reduce uncertainty and to create the cost function of caution. The possibility of collision with the robot is considered through the predicted path of the obstacles, and a local path is generated. This enables safe and efficient navigation of the robot. The results in various experiments show that the proposed method enables robots to navigate safely and effectively.

• Journal of the Society of Naval Architects of Korea
• /
• v.51 no.3
• /
• pp.239-245
• /
• 2014

This paper deal with the block storage planning problem of storing and retrieving assembly blocks in a temporary storage yard with limited capacity, which is one of the critical managerial problems in shipbuilding. The block storage planning problem is required to minimize the number of relocations of blocks while the constraints for storage and retrieval time windows are satisfied. We first show NP-hardness of the block storage planning problem. Next we propose a heuristic algorithm to generate good quality solutions for larger instances in very short computational time. The proposed heuristic algorithm was validated by comparing the results with the mathematical model presented in the previous study.