• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10a
• /
• pp.857-862
• /
• 1987

Given a network with k specified vertices bi called centers, a cardinality constrained cover is a family {Bi} of k subsets covering the vertex set of a network, such that each subset Bi corresponds to and contains center bi, and satisfies a given cardinality constraint. A set of cardinality constrained overlapping territories is a cardinality constrained cover such that the total sum of T(B$_{i}$) for all subsets is minimum among all cardinality constrained covers, where T(B$_{i}$) is the summation of the shortest path lengths from center bi to every vertex in B$_{I}$. This paper considers a problem of finding a set of cardinality constrained overlapping territories. and proposes an algorithm for the Problem which has the time and space complexities are O(k$^{3}$$\mid$V$\mid$$^{2}$) and O(k$\mid$V$\mid$+$\mid$E$\mid$), respectively, where V and E are the sets of vertices and edges of a given network, respectively. The concept of overlapping territories has a possibility to be applied to a job assignment problem.oblem.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.2
• /
• pp.453-460
• /
• 2000

This paper introduces TIGS(Touring Information Guidance System) which provides information with faster access time than the human service. This system is designed specifically for a traveler. This TIGS provides tourists the informations such as destination, current map information, touring courses according to schedules, and lodging information. Furthermore, this system is implemented with touch screen for the user to apply easily. The presented shortest path algorithm using duality theory is applied to schedule the touring courses to reduce the time and the cost. The used map is raster manner instead of vectorial manner to provide user convenience. If this developed system should be established in the public space such as station, airport, and bus station, the useful touring information can be provided the tourists. This system can be easily applied to different local area.

• Journal of Power System Engineering
• /
• v.12 no.6
• /
• pp.18-23
• /
• 2008

This paper describes development of real-time condition monitoring system to observe state of a container crane in a port. To analyze the state of a crane, the strength and the direction of wind are measured with sensors along with the load resulted a crane at the moment. The measured signals are processed by especially developed conditioning board and converted into digital data. Measured data are analyzed to define the state of the crane at an indicator. For transmission of these data to the indicator, we implemented wireless sensor network based on IEEE 802.15.4 MAC(Media Access Control) protocol and Bluetooth network protocol. To extend the networking distance between the indicator and sensor nodes, the shortest path routing algorithm was applied for WSN(Wireless Sensor Network) networks. The indicator sends the state information of the crane to monitoring server through IEEE 802.11 b wireless LAN(Local Area Network). Monitoring server decides whether alarm should be issued or not. The performance of developed WSN and Bluetooth network were evaluated and analyzed in terms of communication delay and throughput.

• Journal of the Korea Society for Simulation
• /
• v.14 no.2
• /
• pp.93-103
• /
• 2005

This paper presents characteristics of a virtual human's navigation using a limited perception-based mapping. Previous approaches to virtual human navigation have used an omniscient perception requiring full layout of a virtual environment in advance. However, these approaches have a limitation on being a fundamental solution for a human-likeness of a virtual human, because behaviors of humans are basically based on their limited perception instead of omniscient perception. In this paper, we integrated Hill's mapping algorithm with a virtual human to experiment virtual human's navigation with the limited perception. This approach does not require full layout of the virtual environment, 360-degree's field of view, and vision through walls. In addition to static objects such as buildings, we consider enemy emergence that can affect an virtual human's navigation. The enemy emergence is used as the variable on the experiment of this present research. As the number of enemies varies, the changes in arrival rate and time taken to reach the goal position were observed. The virtual human navigates by two conditions. One is to take the shortest path to the goal position, and the other is to avoid enemies when the virtual human encounters them. The acquired result indicates that the virtual human's navigation corresponds to a human cognitive process, and thus this research can be a framework for human-likeness of virtual humans.

• Nuclear Engineering and Technology
• /
• v.53 no.7
• /
• pp.2195-2206
• /
• 2021

In order to mitigate the damage caused by accidents in nuclear power plants (NPPs), evacuation strategies are usually managed on the basis of off-site effects such as the diffusion of radioactive materials and evacuee traffic simulations. However, the interactive behavior between evacuees and the accident environment has a significant effect on the consequential gap. Agent-based modeling (ABM) is a method that can control and observe such interactions by establishing agents (i.e., the evacuees) and patches (i.e., the accident environments). In this paper, a radiological emergency evacuation model is constructed to realistically check the effectiveness of an evacuation strategy using NetLogo, an ABM toolbox. Geographic layers such as radiation sources, roads, buildings, and shelters were downloaded from an official geographic information system (GIS) of Korea, and were modified into respective patches. The dispersion model adopted from the puff equation was also modified to fit the patches on the geographic layer. The evacuees were defined as vehicle agents and a traffic model was implemented by combining the shortest path search (determined by an A ^* algorithm) and a traffic flow model incorporated in the Nagel-Schreckenberg cellular automata model. To evaluate the radiological harm to the evacuees due to the spread of radioactive materials, a simple exposure model was established to calculate the overlap fraction between the agents and the dispersion patches. This paper aims to demonstrate that the potential of ABM can handle disaster evacuation strategies more realistically than previous approaches.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1187-1208
• /
• 2022

One of the main goals of wireless sensor networks (WSNs) is to utilize the energy of sensor nodes effectively and maximize the network lifetime. Thus, this paper proposed a routing protocol for WSNs based on virtual force disturbing mobile Sink node (VFMSR). According to the number of sensor nodes in the cluster, the average energy and the centroid factor of the cluster, a new cluster head (CH) election fitness function was designed. At the same time, a hexagonal fixed-point moving trajectory model with the best radius was constructed, and the virtual force was introduced to interfere with it, so as to avoid the frequent propagation of sink node position information, and reduce the energy consumption of CH. Combined with the improved ant colony algorithm (ACA), the shortest transmission path to Sink node was constructed to reduce the energy consumption of long-distance data transmission of CHs. The simulation results showed that, compared with LEACH, EIP-LEACH, ANT-LEACH and MECA protocols, VFMSR protocol was superior to the existing routing protocols in terms of network energy consumption and network lifetime, and compared with LEACH protocol, the network lifetime was increased by more than three times.

• Journal of Korean Society of Transportation
• /
• v.23 no.1
• /
• pp.103-114
• /
• 2005

The transit fare resulted from the renovation of public transit system in Seoul is basically determined based on the distance-based fare policy (DFP). In DFP, the total fare a passenger has to pay for is calculated by the basic-transfer-premium fare decision rule. The fixed amount of the basic fare is first imposed when a passenger get on a mode and it lasts within the basic travel distance. The transfer fare is additionally imposed when a passenger switches from one mode to another and the fare of the latter mode is higher than the former. The premium fare is also another and the fare of the latter begins to exceed the basic travel distance and increases at the proportion of the premium fare distance. The purpose of this study is to propose an algorithm for finding K number of paths, paths that are sequentially sorted based on total amount of transit fare, under DFP of the idstance-based fare policy. For this purpose, the link mode expansion technique is proposed in order to save notations associated with the travel modes. Thus the existing K shortest path algorithms adaptable for uni-modal network analysis are applicable to the analysis for inter-modal transportation networks. An optimality condition for finding the K shortest fare routes is derived and a corresponding algorithms is developed. The case studies demonstrate that the proposed algorithm may play an important role to provide diverse public transit information considering fare, travel distance, travel time, and number of transfer.

• Journal of Intelligence and Information Systems
• /
• v.11 no.1
• /
• pp.153-167
• /
• 2005

In this paper, we consider the problem of exploring unknown environments with a mobile robot or an autonomous character agent. Traditionally, research efforts to address the space exploration problem havefocused on the graph-based space representations and the graph search algorithms. Recently EXPLORE, one of the most efficient search algorithms, has been discovered. It traverses at most min$min(mn, d^2+m)$ edges where d is the deficiency of a edges and n is the number of edges and n is the number of vertices. In this paper, we propose DFS-RTA* and DFS-PHA*, two real-time graph search algorithms for directing an autonomous agent to explore in an unknown space. These algorithms are all built upon the simple depth-first search (DFS) like EXPLORE. However, they adopt different real-time shortest path-finding methods for fast backtracking to the latest node, RTA* and PHA*, respectively. Through some experiments using Unreal Tournament, a 3D online game environment, and KGBot, an intelligent character agent, we analyze completeness and efficiency of two algorithms.

• Journal of KIISE:Information Networking
• /
• v.30 no.2
• /
• pp.179-188
• /
• 2003

Advances in wireless networking technology has engendered a new paradigm of computing, called mobile computing, in which users carrying portable devices have access to a shared infrastructure independent of their physical locations. Wireless communication has some restraints such as disconnection, low bandwidth, a variation of available bandwidth, network heterogeneity, security risk, small storage, and low power. Power adaptation routing scheme overcome the shortage of power by adjusting the output power, was proposed. Existing power saving routing algorithm has some minor effect such as seceding from shortest path to minimize the power consumption, and number of nodes that Participate in routing than optimal because it select a next node with considering only consuming power. This paper supplements the weak point in the existing power saving routing algorithm as considering the gradual approach to final destination and the number of optimal nodes that participate in routing.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.4
• /
• pp.35-45
• /
• 2000

The vertex-based boundary encoding scheme is widely used in object-based video coding area and computer graphics due to its scalability with natural looking approximation. Existing single framebased vertex encoding algorithm is not efficient for temporally correlated video sequences because it does not remove temporal redundancy. In the proposed method, a vertex point is selected from not only the boundary points of the current frame but also the vertex points of the previous frame to remove temporal redundancy of shape information in video sequences. The problem of selecting optimal vertex points is modeled as finding shortest path in the directed acyclic graph with weight The boundary is approximated by a polygon which can be encoded with the smallest number of bits for maximum distortion. The temporal redundancy between two successive frames is efficiently removed with the proposed scheme, resulting in lower bit-rate than the conventional algorithms.