• International Journal of Highway Engineering
• /
• v.11 no.3
• /
• pp.129-139
• /
• 2009

The transportation network is a critical infrastructure in the event of natural and human caused disasters such as rainfall, snowfall, and terror and so on. Particularly, the transportation network in an urban area where a large number of population live is subject to be negatively affected from such events. Therefore, efficient traffic operation plans are required to assist rapid evacuation and effective detour of vehicles on the network as soon as possible. Recently, ubiquitous communication and sensor network technology is very useful to improve data collection and connection related emergency information. In this study, we develop a specific algorithm to provide evacuation route and detour information only for vehicles under emergency situations. Our algorithm is based on shortest path search technique and dynamic traffic assignment. We perform the case study to evaluate model performance applying hypothetical scenarios involved terror. Results show that the model successfully describe effective path for each vehicle under emergency situation.

• Journal of Internet Computing and Services
• /
• v.8 no.5
• /
• pp.133-140
• /
• 2007

Currently, as the requirement for high quality Internet access from anywhere at anytime is consistently increasing, the interconnection of pure ad hoc networks to fixed IP networks becomes increasingly important. Such integrated network, referred to as hybrid ad hoc networks, can be extended to many applications, including Sensor Networks, Home Networks, Telematics, and so on. We focus on some data communication problems of hybrid ad hoc networks, such as broadcasting and routing. In particular. power failure of mobile terminals is the most important factor since it affects the overall network lifetime. We propose an energy-efficient routing protocol based on clustering for hybrid ad hoc networks. By applying the index-based data broadcasting and selective tuning methods, the infra system performs the major operations related to clustering and routing on behalf of ad hoc nodes. The proposed scheme reduces power consumption as well as the cost of path discovery and maintenance, and the delay required to configure the route.

• Journal of the Korea Society for Simulation
• /
• v.15 no.2
• /
• pp.31-39
• /
• 2006

The visibility graph is a well-known method for efficient path-finding with the minimum search space modelling the game world. The generalized visibility graph is constructed on the expanded obstacle boundaries to eliminate the "wall-hugging" problem which is a major disadvantage of using the visibility graph. The paths generated by the generalized visibility graph are guaranteed to be near optimal and natural-looking. In this paper we propose the method to apply the generalized visibility graph efficiently for game characters who moves among static obstacles between varying start and goal points. Even though the space is minimal once the generalized visibility graph is constructed, the construction itself is time-consuming in checking the intersection between every two links connecting nodes. The idea is that we build the map for static obstacles first and then incorporate start and goal nodes quickly. The incorporation of start and goal nodes is the part that must be executed repeatedly. Therefore we propose to use the rotational plane-sweep algorithm in the computational geometry for incorporating start and goal nodes efficiently. The simulation result shows that the execution time has been improved by 39%-68% according to running times in the game environment with multiple static obstacles.

• Journal of Advanced Navigation Technology
• /
• v.26 no.5
• /
• pp.304-311
• /
• 2022

Although the SEAD(suppression to enemy air defenses) mission is a strategically important task in modern warfare, the high risk of direct exposure to enemy air defense assets forces to use of unmanned aerial vehicles. this paper proposes a path planning algorithm for SEAD mission for an unmanned aerial vehicle and a method for calculating the mission effectiveness on the planned path. Based on the RRT-based path planning algorithm, a low-altitude ingress/egress flight path that can consider the enemy's short-range air defense threat was generated. The Dubins path-based Intercept path planning technique was used to generate a path that is the shortest path while avoiding the enemy's short-range anti-aircraft threat as much as possible. The ingress/intercept/egress paths were connected in order. In addition, mission effectiveness consisting of fuel consumption, the survival probability, the time required to perform the mission, and the target destruction probability was calculated based on the generated path. The proposed techniques were verified through a scenario.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.30 no.4D
• /
• pp.433-442
• /
• 2010

Recent decrease in the availability of experienced skilled labor and a corresponding lack of new entrants has required the need for automating many of the construction equipment used in the construction industry. In particular, excavators are widely used throughout earthwork operations and automating its tasks enables work to be performed with higher productivity and safety. This paper introduces an optimal path generation method which is one of the core technologies required to make "Intelligent" excavators a reality. The method divides a given earthwork area into unit cells, identifies networks created by linking these cells, and identifies the optimal path an excavator should follow to minimize its total transportation costs. In addition, the method also accounts for drainage direction and path continuity to ensure that the generated path considers site specific conditions.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.5
• /
• pp.91-98
• /
• 2020

The mobile agent, which handles a given task while migrating between the sensor nodes, moves including the execution commands and task processing results. This increases the size of the mobile agent, causing the network to load, leading to the migration time delay and the loss of migration reliability. This paper presents the method of lightening the mobile agent using distributed object technology and the algorithm for exploring and providing the optimal migration path that is actively performed in the event of network traffic, and it proposes a method to ensure the reliability of the mobile agent migration by applying them. In addition, through the comparative analysis experiments based on agent size and network traffic for the migration time of mobile agent equipped with active rules in sensor network-based mobile agent middleware environment, applying the proposed methods proves to ensure the autonomy and migration reliability of the mobile agent.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.5
• /
• pp.385-391
• /
• 2013

As a solution for environmental problems caused by increasing number of vehicles, it is encouraged to use a bicycle as an environment-friendly transportation method. To vitalize the bicycle usage, it is a necessary to construct bicycle roads that are safe and suitable for users. Based on the previous research results, we assume the main purposes of bicycle usages are mainly local leisure activity and school commuting. Thus, the proposed method finds the shortest link between the existing bicycle road network and bicycle usage facilities such as leisure activity places or schools over public road network. Then, we carry out the RTK DGPS survey for the candidate links, and analyze the slopes of them. When the slope of a found link is larger than a threshold, an alternative link is re-found for the safety and convenience of a bicycle user. The proposed method is applied to the real bicycle road network in Mokpo, Chunnam and the results are discussed.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.28 no.5D
• /
• pp.639-647
• /
• 2008

The objective of this research is to establish the relationship between the important variables necessary for real-time available parking space presumption algorithm for a parking lot information provision. So it investigated the variables that come relate to the algorithm and collected parking information for an algorithm plan. It analyzed variables inciuding average number of parked cars, average parked time, rate of turnover, occupancy, cumulative number of parked cars, and etc. of the parking lot. And it collected data regarding illegal parking, double space parking, searching car and it presumed the number of available parking spaces. As a result of the research, It appeared that the achieved accuracy is superier to existing provision system which only take the total input and output numbers. This will help drivers' judgement, and also the parking lot operation and management.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.26 no.3
• /
• pp.85-96
• /
• 2023

This study developed and evaluated a safe route guidance service for electric personal assistive mobility device used mainly by the mobility impaired people to improve their mobility. Thirteen underlying factors affecting the mobility of electric personal assistive mobility device have been derived through a survey with the mobility impaired people and employees in related organizations in Busan Metropolitan City. After assigning safety scores to individual factors and identifying the relevant factors along routes of interest with an object detection AI model, the safe route for electric personal assistive mobility device was provided through an optimal path-finding algorithm. As a result of comparing the general route of T-map and the recommended route of this study for the identical routes, the latter had relatively fewer obstacles and the gentler slope than the former, implicating that the recommended route is safer than the general one. As future works, it is necessary to enhance the function of a route guidance service based on the real-time location of users and to conduct spot investigations to evaluate and verify its social acceptability.

• Journal of Korean Society of Transportation
• /
• v.28 no.2
• /
• pp.7-19
• /
• 2010

Users of metropolitan railroad is increased continuously because of its various advantage such as comfortableness, convenience and punctuality. Thus, several local government including Seoul considered new installation or extension of railroads and four railroad operators maintain seventeen lines at present. After public transportation reforms in 2004 and integrated discount fare system in 2007, public transportation become more convenient in many aspects. However, these trials gives much more complex allocating problems of revenues among public transportation operators. In this paper, we deal with revenue allocating problems among public transportation operators after integrated discount fare system in 2007. Specifically, this study focuses on allocating revenues to metropolitan railroad operators by using RF card data. This research roughly proposes the methodology of O/D extraction from RF card data, generalized cost estimation and allocating revenue algorithm. We use RF card data in order to draw out exact individual O/D data and try to compare our results with those of Korea Smart Card Company. In generalized cost estimation, survey study about transfer factors is conducted for accurate estimation of generalized cost function. Lastly, new allocating revenue algorithm using k-path and non-dominated path concept is suggested. It is expected that case study is also performed with real revenues and O/D data in order to check up the application. Preposed methodology in this research can contribute to solve present and future revenue allocating issues according to the introduction of LRT and private railroad.