• The KIPS Transactions:PartB
• /
• v.16B no.5
• /
• pp.411-426
• /
• 2009

Most of the metaheuristics are made by imitating the action of the animals. In this paper, we proposed Mine Algorithm. The Mine Algorithm is a metaheuristic that imitates the action of the human being. Speaking of search, the field in which the know-how and the heuristics of the human being are melted best is the mining industry. In the Mine Algorithm we formalize the action pattern of the human being by focusing the mine business. The Mine Algorithm uses various searching techniques fluently and shows equally good performance for broad problems. That is, it has good generality. We show the improved generality of the Mine Algorithm by the comparing experiments with the conventional metaheuristics.

• The KIPS Transactions:PartB
• /
• v.18B no.2
• /
• pp.73-82
• /
• 2011

There are a lot of people trying to solve the Traveling Salesman Problem (TSP) by using the Meta Heuristic Algorithms. TSP is an NP-Hard problem, and is used in testing search algorithms and optimization algorithms. Also TSP is one of the models of social problems. Many methods are proposed like Hybrid methods and Custom-built methods in Meta Heuristic. In this paper, we propose the S-MINE Algorithm to use the MINE Algorithm introduced in 2009 on the TSP.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.12
• /
• pp.1243-1249
• /
• 2014

The naval mine is the explosives that are installed in the water in order to attack surface ships or submarines. So mine warfare is a very important component of naval operations. In this paper, first, understanding of the general concept about mine warfare. Second, introduce the mine hunting progress and mine sweeping progress. And then, suggest the system design method of mine counter measure warfare using several functions. The functions are mine area detection algorithm for side scan sonar image using Adaboost algorithm, and calculation to mine hunting progress rate and mine sweeping progress rate. And techniques that lead the mine disposal vehicle(MDV) to mine.

• Tunnel and Underground Space
• /
• v.24 no.1
• /
• pp.11-20
• /
• 2014

This study analyzed the optimal routes of auxiliary vehicles in an open-pit mine that need to traverse the entire mine through many working points. Unlike previous studies which usually used the Dijkstra's algorithm, this study utilized a heuristic algorithm for the Traveling Salesman Problem(TSP). Thus, the optimal routes of auxiliary vehicles could be determined by considering the visiting order of multiple working points. A case study at the Pasir open-pit coal mine, Indonesia was conducted to analyze the travel route of an auxiliary vehicle that monitors the working condition by traversing the entire mine without stopping. As a result, we could know that the heuristic TSP algorithm is more efficient than intuitive judgment in determining the optimal travel route; 20 minutes can be shortened when the auxiliary vehicle traverses the entire mine through 25 working points according to the route determined by the heuristic TSP algorithm. It is expected that the results of this study can be utilized as a basis to set the direction of future research for the system optimization of auxiliary vehicles in open-pit mines.

• Ocean and Polar Research
• /
• v.33 no.1
• /
• pp.69-76
• /
• 2011

A test miner named MineRo was constructed for the purpose of shallow water test of mining performance. In June of 2009, the performance test was conducted in depth of 100 m, 5 km away from Hupo-port (Korean East Sea), to assess if the developed system is able to collect and lift manganese nodules from seafloor. In August of 2010, in-situ test of automatic path tracking control of MineRo was performed in depth of 120 m at the same site. For path tracking control, a localization algorithm determining MineRo's position on seabed is prerequisite. This study proposes an improved underwater navigation algorithm through estimation of MineRo's kinematic parameters. In general, the kinematic parameters such as track slips and slip angle are indirectly calculated using the position data from USBL (Ultra-Short Base Line) system and heading data from gyro sensors. However, the obtained data values are likely to be different from the real values, primarily due to the random noise of position data. The aim of this study is to enhance the reliability of the algorithm by measuring kinematic parameters, track slips and slip angle.

• International Journal of Computer Science & Network Security
• /
• v.21 no.3
• /
• pp.145-152
• /
• 2021

In the Recent times, various technological enhancements in the field of artificial intelligence and big data has been noticed. This advancement coupled with the evolution of the 5G communication and Internet of Things technologies, has helped in the development in the domain of smart mine construction. The development of unmanned vehicles with enhanced and smart scheduling system for open-pit mine transportation is one such much needed application. Traditional open-pit mining systems, which often cause vehicle delays and congestion, are controlled by human authority. The number of sensors has been used to operate unmanned cars in an open-pit mine. The sensors haves been used to prove the real-time data in large quantity. Using this data, we analyses and create an improved transportation scheduling mechanism so as to optimize the paths for the vehicles. Considering the huge amount the data received and aggregated through various sensors or sources like, the GPS data of the unmanned vehicle, the equipment information, an intelligent, and multi-target, open-pit mine unmanned vehicle schedules model was developed. It is also matched with real open-pit mine product to reduce transport costs, overall unmanned vehicle wait times and fluctuation in ore quality. To resolve the issue of scheduling the transportation, we prefer to use algorithms based on artificial intelligence. To improve the convergence, distribution, and diversity of the classic, rapidly non-dominated genetic trial algorithm, to solve limited high-dimensional multi-objective problems, we propose a decomposition-based restricted genetic algorithm for dominance (DBCDP-NSGA-II).

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.8
• /
• pp.1998-2004
• /
• 2009

Recently, due to technical developments of various storage devices and networks, the amount of data increases rapidly. The large volume of data streams poses unique space and time constraints on the data mining process. The continuous characteristic of streaming data necessitates the use of algorithms that require only one scan over the stream for knowledge discovery. Most of the researches based on the support are concerned with the frequent itemsets, but ignore the infrequent itemsets even if it is crucial. In this paper, we propose an efficient method WSFI-Mine(Weighted Support Frequent Itemsets Mine) to mine all frequent itemsets by one scan from the data stream. This method can discover the closed frequent itemsets using DCT(Data Stream Closed Pattern Tree). We compare the performance of our algorithm with DSM-FI and THUI-Mine, under different minimum supports. As results show that WSFI-Mine not only run significant faster, but also consume less memory.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.12 no.5
• /
• pp.277-286
• /
• 2017

This paper introduces mathematical modelling and control algorithm of expendable mine disposal vehicle. This vehicle has two longitudinal thrusters, one vertical thruster and internal mass moving system which can control pitch rate. Also, the vehicle has an optical camera and forward looking sonar for underwater mine detection and classification. The vehicle is controlled via an optical cable connected with operating console on the mother ship. We describe the vehicle's 6DOF dynamic model and controller which can track the desired trajectory for the way-point tracking. These simulation results shows guidance and maneuvering performance which has other sensor data or not.

• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.3
• /
• pp.242-252
• /
• 2006

Data mining is the exploration and analysis of huge amounts of data to discover meaningful patterns. One of the most important data mining problems is association rule mining. Recent studies of mining association rules have proposed a closure mechanism. It is no longer necessary to mine the set of all of the frequent itemsets and their association rules. Rather, it is sufficient to mine the frequent closed itemsets and their corresponding rules. In the past, a number of algorithms for mining frequent closed itemsets have been based on items. In this paper, we use the transaction itself for mining frequent closed itemsets. An efficient algorithm is proposed that is based on a link structure between transactions. Our experimental results show that our algorithm is faster than previously proposed methods. Furthermore, our approach is significantly more efficient for dense databases.

• International Journal of Ocean System Engineering
• /
• v.1 no.2
• /
• pp.102-109
• /
• 2011

This paper describes the implementation of a precise underwater navigation solution using a multiple sensor fusion technique based on USBL, GPS, DVL and AHRS measurements for the operation of a remotely operated mine disposal vehicle (MDV). The estimation of accurate 6DOF positions and attitudes is the key factor in executing dangerous and complicated missions. To implement the precise underwater navigation, two strategies are chosen in this paper. Firstly, the sensor frame alignment to the body frame is conducted to enhance the performance of a standalone dead-reckoning algorithm. Secondly, absolute position data measured by USBL is fused to prevent cumulative integration error. The heading alignment error is identified by comparing the measured absolute positions with the DR algorithm results. The performance of the developed approach is evaluated with the experimental data acquired by MDV in the South-sea trial.