• Journal of Ocean Engineering and Technology
• /
• v.18 no.4 s.59
• /
• pp.65-70
• /
• 2004

Many port states, such as New Zealand, U.S.A., Australia, and Canada, have strict regulations to prevent arriving ships from discharging polluted ballast water that contains harmful aquatic organisms and pathogens. They are notified that transfer of polluted ballast water can cause serious injury to public health and damage to property and environment. For this reason, ballast exchange in deep sea is perceived as the most effective method of emptying ballast water. The ballast management plan contains the effective exchange method, ballast system, and safety considerations. In this study, we pursued both nautical engineering analysis and optimization of the algorithm, in order to generate the sequence of stability and rapidity. A heuristic algorithm was chosen on the basis of optimality and applicability to a sequential exchange problem. We have built an optimized algorithm for the automatic exchange of ballast water, by redefining core elements of the A$\ast$ algorithm, such as node, operator, and evaluation function. The final version of the optimized algorithm has been applied to existing bulk carrier, and the performance of the algorithm has been successfully verified.

• Proceedings of the Korean Institute of IIIuminating and Electrical Installation Engineers Conference
• /
• 2002.11a
• /
• pp.363-368
• /
• 2002

Performance-based course design on the job of receiving substation installations is presented to achieve a work based curriculum development. It includes a job analysis method called ISD(Instructional Systems Design & Development) and DACUM(Developing a Curriculum) which is designed to accept various requirements of industrial fields. It is provided with course profile, key contents, terminal learning objectives, intermediate learning objectives, instruction strategy, instruction sequence, case study, action learning and lesson plan.

• Proceedings of the Korean Institute of IIIuminating and Electrical Installation Engineers Conference
• /
• 2001.11a
• /
• pp.151-156
• /
• 2001

Performance-based course design on the job of receiving substation installations is presented to achieve a work based curriculum development. It includes a job analysis method called ISD(Instructional Systems Design & Development) and DACUM(Developing a Curriculum) which is designed to accept various requirements of industrial fields. It is provided with course profile, key contents, terminal learning objectives, intermediate learning objectives, instruction strategy, instruction sequence, case study, action learning and lesson plan.

• Investigative Magnetic Resonance Imaging
• /
• v.4 no.1
• /
• pp.1-6
• /
• 2000

Protocol이란 Dorland의 의학사전에 의하면 "어떤 술기의 절차에 대한 명백하고 상세한 계획서(an explicit detiled plan of a procedure)"로 정의된다. 그래서 liver MR imaging protocol은 간에 발생한 병적 문제를 해결하기 위해서, 자기공명 영상술을 실시하는 구체적이고 세부적인 지침서를 말하게 된다. 그러나 현실적으로 병원에 따라 imaging protocol은 조금씩 다르다. 왜냐하면 자기공명영상 장비가 다르고, 적절한 펄스파형(pulse sequence)에 대한 통일된 안이 없기 때문이다. 자기공명영상술은 지금도 계속해서 빠르게 발전하고 있기 때문에, 현재 통용되는 영상 술기에 대한 자세한 지침은 곧 소용이 없게 된다. 그래서 본 소고에서는 간의 자기공명영상화의 병변의 특성화에 대한 기본적인 면에 더욱 중점을 두고 기술하고자 한다.

• Proceedings of the KSMRM Conference
• /
• 1999.04a
• /
• pp.43-54
• /
• 1999

Protocol이란 Dorland의 의학사전에 의하면 "어떤 술기의 절차에 대한 명백하고 상세한 계획서(an explicit detailed plan of a procedure)"로 정의된다. 그래서 liver MR imaging protocol은 간에 발생한 병적 문제를 해결하기 위해서, 자기공명영상술을 실시하는 구체적이고 세부적인 지침서를 말하게 된다. 그러나 현실적으로 병원에 따라 imaging protocol은 조금씩 다르다. 왜냐하면 MR장비가 다르고, 적절한 펄스파형(pulse sequence)에 대한 통일된 안이 없기 때문이다. 자기공명영상술은 지금도 계속해서 빠르게 발전하고 있기 때문에, 현재 통용되는 영상 술기에 대한 자세한 지침은 곧 소용이 없게 된다. 그래서 본 소고에서는 간의 MR 영상화와 병변의 특성화에 대한 기본 적인 면에 더욱 중점을 두고 기술하고자 한다. 기술하고자 한다.

• Journal of KIISE:Software and Applications
• /
• v.33 no.7
• /
• pp.624-635
• /
• 2006

This paper applies simulated annealing algorithm to the problem of generating a plan for intra-block remarshalling with multiple transfer cranes. Intra-block remarshalling refers to the task of rearranging containers scattered around within a block into certain designated target areas of the block so that they can be efficiently loaded onto a ship. In generating a remarshalling plan, the predetermined container loading sequence should be considered carefully to avoid re-handlings that may delay the loading operations. In addition, the required time for the remarshalling operation itself should be minimized. A candidate solution in our search space specifies target locations of the containers to be rearranged. A candidate solution is evaluated by deriving a container moving plan and estimating the time needed to execute the plan using two cranes with minimum interference. Simulation experiments have shown that our method can generate efficient remarshalling plans in various situations.

• Journal of Navigation and Port Research
• /
• v.44 no.3
• /
• pp.219-226
• /
• 2020

The container terminal operators established a re-marshalling plan to reduce the loading operation time and the release operation time. Re-marshalling is to rearrange the containers in the container yard to the advantageous position to shorten the working time using the spare time of the automated yard crane. This study assumed the automated container terminal with a perpendicular layout and deals with the inter-bay re-marshalling planning problem in a yard block. The inter-bay re-marshalling plan determines the container to be moved, the location to be relocated, and the sequence of relocation operations. This study presents a mixed integer programming model that simultaneously determines the storage location and the operation sequence while satisfying the spatial availability during the re-marshalling. Numerical experiments are conducted to understand re-marshalling operation using a beam search method.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.6
• /
• pp.89-97
• /
• 2016

This paper addresses the problem of the construction planning of artillery positions, for which we present an optimization model and propose a heuristic algorithm to solve problems of practical size. The artillery position construction plan includes the assignment of engineers to support the artillery and the schedule of the support team construction sequence. Currently, in the army, managers construct the plan based on their experience. We formulate the problem as a mixed integer program and present a heuristic that utilizes the decomposition of the mixed integer model. We tested the efficacy of the proposed algorithm by conducting computational experiments on both small-size test problems and large-size practical problems. The average optimality gap in the small-size test problem was 6.44% in our experiments. Also, the average computation time to solve the large-size practical problems consisting of more than 200 artillery positions was 79.8 seconds on a personal computer. The result of our computational experiments shows that the proposed approach is a viable option to consider for practical use.

• Journal of Mechanical Science and Technology
• /
• v.18 no.8
• /
• pp.1349-1357
• /
• 2004

Computer-Aided Inspection Planning (CAIP) is the integration bridge between CAD/CAM and Computer Aided Inspection (CAI). A CAIP system for On-Machine Measurement (OMM) is proposed to inspect the complicated mechanical parts efficiently during machining or after machining. The inspection planning consists of Global Inspection Planning (GIP) and Local Inspection Planning (LIP). In the GIP, the system creates the optimal inspection sequence of the features in a part by analyzing the various feature information such as the relationship of the features, Probe Approach Directions (PAD), etc. Feature groups are formed for effective planning, and special feature groups are determined for sequencing. The integrated process and inspection plan is generated based on the sequences of the feature groups and the features in a feature group. A series of heuristic rules are developed to accomplish it. In the LIP of Part II, the system generates inspection parameters. The integrated inspection planning is able to determine optimum manufacturing sequence for inspection and machining processes. Finally, the results are simulated and analyzed to verify the effectiveness of the proposed CAIP.

• The Journal of Korea Robotics Society
• /
• v.3 no.1
• /
• pp.23-32
• /
• 2008

This paper presents a task planning system for a steward robot, which has been developed as an interactive intermediate agent between an end-user and a complex smart home environment called the ISH (Intelligent Sweet Home) at KAIST (Korea Advanced Institute of Science and Technology). The ISH is a large-scale robotic environment with various assistive robots and home appliances for independent living of the elderly and the people with disabilities. In particular, as an approach for achieving human-friendly human-robot interaction, we aim at 'simplification of task commands' by the user. In this sense, a task planning system has been proposed to generate a sequence of actions effectively for coordinating subtasks of the target subsystems from the given high-level task command. Basically, the task planning is performed under the framework of STRIPS (Stanford Research Institute Problem Solver) representation and the split planning method. In addition, we applied a state-partitioning technique to the backward split planning method to reduce computational time. By analyzing the obtained graph, the planning system decomposes an original planning problem into several independent sub-problems, and then, the planning system generates a proper sequence of actions. To show the effectiveness of the proposed system, we deal with a scenario of a planning problem in the ISH.