• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.12 no.3
• /
• pp.201-210
• /
• 2019

This paper proposes the AMCS(Agricultural Machine Control System that distinguishes farms using satellite photos or drone photos of farms and controls the self-driving and operation of farm drones and tractors. The AMCS consists of the LSM(Local Server Module) which separates farm boundaries from sensor data and video image of drones and tractors, reads remote control commands from the main server, and then delivers remote control commands within the management area through the link with drones and tractor sprinklers and the PSM that sets a path for drones and tractors to move from the farm to the farm and to handle work at low cost and high efficiency inside the farm. As a result of AMCS performance analysis proposed in this paper, the PSM showed a performance improvement of about 100% over Dijkstra algorithm when setting the path from external starting point to the farm and a higher working efficiency about 13% than the existing path when setting the path inside the farm. Therefore, the PSM can control tractors and drones more efficiently than conventional methods.

• Animal Bioscience
• /
• v.34 no.1
• /
• pp.36-47
• /
• 2021

Objective: This study determined the optimal ratio of whole plant corn silage (WPCS) to corn stover (stems+leaves) silage (CSS) (WPCS:CSS) to reach the greatest profit of dairy farmers and evaluated its consequences with corn available for other purposes, enteric methane production and milk nitrogen efficiency (MNE) at varying milk production levels. Methods: An optimization model was developed. Chemical composition, rumen undegradable protein and metabolizable energy (ME) of WPCS and CSS from 4 cultivars were determined to provide data for the model. Results: At production levels of 0, 10, 20, and 30 kg milk/cow/d, the WPCS:CSS to maximize the profit of dairy farmers was 16:84, 22:78, 44:56, and 88:12, respectively, and the land area needed to grow corn plants was 4.5, 31.4, 33.4, and 30.3 ha, respectively. The amount of corn available (ton DM/ha/yr) for other purposes saved from this land area decreased with higher producing cows. However, compared with high producing cows (30 kg/d milk), more low producing cows (10 kg/d milk) and more land area to grow corn and soybeans was needed to produce the same total amount of milk. Extra land is available to grow corn for a higher milk production, leading to more corn available for other purposes. Increasing ME content of CSS decreased the land area needed, increased the profit of dairy farms and provided more corn available for other purposes. At the optimal WPCS:CSS, MNE and enteric methane production was greater, but methane production per kg milk was lower, for high producing cows. Conclusion: The WPCS:CSS to maximize the profit for dairy farms increases with decreased milk production levels. At a fixed total amount of milk being produced, high producing cows increase corn available for other purposes. At the optimal WPCS:CSS, methane emission intensity is smaller and MNE is greater for high producing cows.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.12
• /
• pp.135-144
• /
• 2020

In graph theory, the least-cost path is discovered by searching the shortest path between a start node and destination node. The least cost is calculated as a one-dimensional value that represents the difference in distance or price between two nodes, and the nodes and edges that comprise the lowest sum of costs between the linked nodes is the shortest path. However, it is difficult to determine the shortest path if each node has multiple attributes because the number of cost types that can appear is equal to the number of attributes. In this paper, a shortest path search scheme is proposed that considers multiple attributes using the Euclidean distance to satisfy various user requirements. In simulation, we discovered that the shortest path calculated using one-dimensional values differs from that calculated using the Euclidean distance for two-dimensional attributes. The user's preferences are reflected in multi attributes and it was different from one-dimensional attribute. Consequently, user requirements could be satisfied simultaneously by considering multiple attributes.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.11
• /
• pp.159-167
• /
• 2009

The vehicles play a significant role in modern people's life as economy grows. The development of car navigation system(CNS) provides various convenience because it shows the driver where they are and how to get to the destination from the point of source. However, the existing map-based CNS does not consider any environments such as traffic congestion. Given the same starting point and destination, the system always provides the same route and the required time. This paper proposes a path planning method with traffic prediction by applying historical driving information to the Fuzzy theory and Bayesian update. Fuzzy theory classifies the historical driving information into groups of leaving time and speed rate, and the traffic condition of each time zone is calculated by Bayesian update. An ellipse area including starting and destination points is restricted in order to reduce the calculation time. The accuracy and practicality of the proposed scheme are verified by several experiments and comparisons with real navigation.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.29 no.3
• /
• pp.281-287
• /
• 2023

Establishing a ship's passage plan is an essential step before it starts to sail. The research related to the automatic generation of ship passage plans is attracting attention because of the development of maritime autonomous surface ships. In coastal water navigation, the land, islands, and navigation rules need to be considered. From the path planning algorithm's perspective, a ship's passage planning is a global path-planning problem. Because conventional global path-planning methods such as Dijkstra and A^* are time-consuming owing to the processes such as environmental modeling, it is difficult to modify a ship's passage plan during a voyage. Therefore, the D^* algorithm was used to address these problems. The starting point was near Busan New Port, and the destination was Ulsan Port. The navigable area was designated based on a combination of the ship trajectory data and grid in the target area. The initial path plan generated using the D^* algorithm was analyzed with 33 waypoints and a total distance of 113.946 km. The final path plan was simplified using the Douglas-Peucker algorithm. It was analyzed with a total distance of 110.156 km and 10 waypoints. This is approximately 3.05% less than the total distance of the initial passage plan of the ship. This study demonstrated the feasibility of automatically generating a path plan in coastal navigation for maritime autonomous surface ships using the D^* algorithm. Using the shortest distance-based path planning algorithm, the ship's fuel consumption and sailing time can be minimized.

• Journal of Intelligence and Information Systems
• /
• v.29 no.2
• /
• pp.101-114
• /
• 2023

In the wartime, aircraft carrying out a mission to strike the enemy deep in the depth are exposed to the risk of being shoot down. As a key combat force in mordern warfare, it takes a lot of time, effot and national budget to train military flight personnel who operate high-tech weapon systems. Therefore, this study studied the path problem of predicting the route of emergency escape from enemy territory to the target point to avoid obstacles, and through this, the possibility of safe recovery of emergency escape military flight personnel was increased. based problem, transforming the problem into a TSP, VRP, and Dijkstra algorithm, and approaching it with an optimization technique. However, if this problem is approached in a network problem, it is difficult to reflect the dynamic factors and uncertainties of the battlefield environment that military flight personnel in distress will face. So, MDP suitable for modeling dynamic environments was applied and studied. In addition, GIS was used to obtain topographic information data, and in the process of designing the reward structure of MDP, topographic information was reflected in more detail so that the model could be more realistic than previous studies. In this study, value iteration algorithms and deterministic methods were used to derive a path that allows the military flight personnel in distress to move to the shortest distance while making the most of the topographical advantages. In addition, it was intended to add the reality of the model by adding actual topographic information and obstacles that the military flight personnel in distress can meet in the process of escape and escape. Through this, it was possible to predict through which route the military flight personnel would escape and escape in the actual situation. The model presented in this study can be applied to various operational situations through redesign of the reward structure. In actual situations, decision support based on scientific techniques that reflect various factors in predicting the escape route of the military flight personnel in distress and conducting combat search and rescue operations will be possible.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.34 no.3
• /
• pp.273-282
• /
• 2016

There has been growing social interest recently in the movement rights of people with reduced mobility. However, it simply eliminates the temporary inconvenience of walking of people with reduced mobility because it focuses only on supply of institutional facilities. Therefore, we look forward to improving movement welfare by proposing an optimized path finding algorithm for people with reduced mobility that takes into consideration physical elements affecting their movement, such as slope, steps etc. We selected Walking barrier factor by analyzing previous studies and calculated the relative importance of Walking barrier factors using an Analytic Hierarchy Process(AHP). Next, through the fuzzy system, the Walking disturbance level of link, which integrates the weights of Walking barrier factors and the attributes of each link, is derived. Then, Walking path cost that takes into consideration the ‘length’ factors is calculated and an optimized path for people with reduced mobility is searched using Dijkstra’s Algorithm. Nineteen different paths were searched and we confirmed that the derived paths are meaningful in terms of improving the mobility of people with reduced mobility by conducting a field test. We look forward to improving movement welfare by providing a navigation service using the path finding algorithm proposed in this study.

• Journal of the Korean association of regional geographers
• /
• v.13 no.5
• /
• pp.563-575
• /
• 2007

This study aims to investigate a possibility of using topographic information by web mapping in open environments. Web mapping intends to focus on a map analysis and application of the function and geo-visualization. Functions of Web topographic info-map include a spatial analysis, enlargement and minimization, movement, landuse information, user-controling 3 dimension map, landform cross-section analysis, shortest path analysis. The web system adopts SVG(scalable vector graphics), MYSQL, PHP, XML for mapping. SVG has open source policy, so everyone can use it, as well, it is effective on flexible database linkage, cartographic representation. 3D map is intended to represent 3D map by user-controlled sunshine putting pixel opacity by elevation values after making DEM. Landform is designed to show a cross-section analysis and statistics by retrieving height information from database engine with clicking two points on the map. Shortest path analysis within regions uses Dijkstra's algorithm. Near future, resultantly, the area of WebGIS will have to meet more social demands for use-created geo-information and application, so more researches are needed to be web mapping more applicable for users.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.1 s.16
• /
• pp.107-118
• /
• 2006

In this paper, several network algorithms were tested to find an optimal one for telecommunication network design. Algorithms such as Dijkstra's shortest path algorithm, Ford-Bellman's shortest path algorithm, Prim's minimum spanning tree algorithm, and Kruscal's minimum spanning tree algorithm were reviewed and compared in terms of feasibility and resulted network construction cost. Then an optimal algorithm that is most suitable for telecommunication network design was selected. For more specific and quantitative analysis of the selected algorithm, it was implemented to a real telecommunication network construction site. The analyzed results showed that the suggested design method when compared with the conventional one, reduced the network construction cost considerably. The total network length estimated by the conventional method were 5267 meters while the suggested method resulted in 4807 meters. Thus the new method reduced the total network length by 8.7 percent which is equivalent to 97,469,000 Won of construction cost. Considering the frequent telecommunication network constructions, due to new urban developments in the nation, the economic benefit of the suggested telecommunication network design method will be significant. In addition to the construction cost savings, the suggested telecommunication network design procedure possesses several other economic benefits. Since the design procedure can be standardized and automatized, it can reduce the design cost itself and the skill acquirement periods required for new or inapt design crews. Further, due to the standardized and automatized design procedure, any telecommunication network design results can accessed more objectively.

• Tunnel and Underground Space
• /
• v.33 no.1
• /
• pp.57-69
• /
• 2023

In this study, we simulated induced seismicity in the Groningen natural gas reservoir using 2D hydro-mechanical coupled discrete element modelling (DEM). The code used is PFC2D (Particle Flow Code 2D), a commercial software developed by Itasca, and in order to apply to this study we further developed 1)initialization of inhomogeneous reservoir pressure distribution, 2)a non-linear pressure-time history boundary condition, 3)local stress field monitoring logic. We generated a 2D reservoir model with a size of 40 × 50 km² and a complex fault system, and simulated years of pressure depletion with a time range between 1960 and 2020. We simulated fault system failure induced by pressure depletion and reproduced the spatiotemporal distribution of induced seismicity and assessed its failure mechanism. Also, we estimated the ground subsidence distribution and confirmed its similarity to the field measurements in the Groningen region. Through this study, we confirm the feasibility of the presented 2D hydro-mechanical coupled DEM in simulating the deformation of a complex fault system by hydro-mechanical coupled processes.