• Journal of Navigation and Port Research
• /
• v.38 no.4
• /
• pp.349-356
• /
• 2014

In the underwater communication, the performance of system is reduced because of the inter-symbol interference occur by the multi-path. In the recent years, to deal with poor channel environment and improve the throughput, the efficient concatenated structure of equalization, channel codes and Space Time Codes has been studied as MIMO system in the underwater communication. Space Time Codes include Space Time Block Codes and Space Time Trellis Codes in underwater communication. Space Time Trellis Codes are optimum for equalization and channel codes among the Space Time Codes to apply in the MIMO environment. Therefore, in this paper, turbo pi codes are used for the outer code to efficiently transmit in the multi-path channel environment. The inner codes consist of Space Time Trellis Codes with transmission diversity and coding gain in the MIMO system. And Zero Forcing method is used to remove inter-symbol interference. Finally, the performance of this model is simulated in the underwater channel.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.10
• /
• pp.109-117
• /
• 2014

In navigation route planning systems using A* algorithms, the cardinality of an Open list, which is a list of candidate nodes through which a terminal node can be accessed, increases as the path length increases. In this paper, a method of alternately utilizing the Dijkstra's algorithm and the A* algorithm to reduce the cardinality of the Open list is investigated. In particular, by employing a depth parameter, named Level, the two algorithms are alternately performed depending on the Level's value. Using the hybrid searching approach, the Open list constructed in the Dijkstra's algorithm is transferred into the Open list of the A* algorithm, and consequently, the unconstricted increase of the cardinality of the Open list of the former algorithm can be avoided and controlled appropriately. In addition, an optimal or nearly optimal path similar to the Dijkstra's route, but not available in the A* algorithm, can be found. The experimental results, obtained with synthetic and real-life benchmark data, demonstrate that the computational cost, measured with the number of nodes to be compared, was remarkably reduced compared to the traditional searching algorithms, while maintaining the similar distance to those of the latter algorithms. Here, the values of Level were empirically selected. Thus, a study on finding the optimal Level values, while taking into consideration the actual road conditions remains open.

• Journal of Korean Society of Transportation
• /
• v.34 no.4
• /
• pp.341-353
• /
• 2016

Highway is mainly in charge of middle-long distance of vehicular travel. Trip length has shown a growing trend due to increased commute distances by the relocation of public agencies. For this reason, the proportion of driver-driven accidents, caused by their fatigue or sleepiness, are very high on highways. However, existing studies related to accident prediction have mainly considered external factors, such as road conditions, environmental factors and vehicle factors, without driving behavior. In this study, we suggested an accident index (FDR, Fatigued Driving Rate) based on traffic behavior using large-scale Car Navigation path data, and exlpored the relationship between FDR and traffic accidents. As a result, FDR and traffic accidents showed a high correlation. This confirmed the need for a paradigm shift (from facilities to travel behavior) in traffic accident prediction studies. FDR proposed in this study will be utilized in a variety of fields. For example, in providing information to prevent traffic accidents (sleepiness, reckless driving, etc) in advance, utilization of core technologies in highway safety diagnostics, selection of priority location of rest areas and shelter, and selection of attraction methods (rumble strips, grooving) for attention for fatigued sections.

• The KIPS Transactions:PartA
• /
• v.11A no.4
• /
• pp.277-284
• /
• 2004

This paper presents a facial expression control method of 3D avatar that enables the user to select a sequence of facial frames from the facial expression space, whose level of details the user can select hierarchically. Our system creates the facial expression spare from about 2,400 captured facial frames. But because there are too many facial expressions to select from, the user faces difficulty in navigating the space. So, we visualize the space hierarchically. To partition the space into a hierarchy of subspaces, we use fuzzy clustering. In the beginning, the system creates about 11 clusters from the space of 2,400 facial expressions. The cluster centers are displayed on 2D screen and are used as candidate key frames for key frame animation. When the user zooms in (zoom is discrete), it means that the user wants to see mort details. So, the system creates more clusters for the new level of zoom-in. Every time the level of zoom-in increases, the system doubles the number of clusters. The user selects new key frames along the navigation path of the previous level. At the maximum zoom-in, the user completes facial expression control specification. At the maximum, the user can go back to previous level by zooming out, and update the navigation path. We let users use the system to control facial expression of 3D avatar, and evaluate the system based on the results.

• 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.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.131-140
• /
• 2012

The shortest path search algorithm of navigation is generally based on Dijkstra algorithm and considers only the distance using the weight. Dijkstra algorithm based on the distance mainly ought to perform the 'number of nodes 1' and requires a lot of memory, for it is to start from the starting node and to decide the shortest path for all the nodes. Also, it searches only the same identical path in case of any bottleneck due to an accident nearby, since it is based only on the distance, and hence does not have a system that searches the detour road. In order to solve this problem, this paper considers only the travelling time per road (travelling speed * distance), without applying speed criteria (smoothness, slow speed, stagnation and accident control) or road class (express road, national road and provincial road). This provides an advantage of searching the detour, considering the reality that there are differences in time take for the car to travel on different roads with same distance, due to any accident, stagnation, or repair construction. The suggested algorithm proves that it can help us to reach the destination within the shortest time, making a detour from any congested road (outbreak) on providing an information on traveling time continuously(real-time) even though there is an accident in a particular road.

• Journal of Korean Society of Transportation
• /
• v.24 no.3 s.89
• /
• pp.177-187
• /
• 2006

It is known that over one million car navigation devices are being currently used in Korea. Most. if not all, route guidance systems, however, Provide only one "best" route to users, not providing any options for various types of users to select. The current practice dose not consider each individual's different preferences. These days, a vast amount of information became available due to the rapid development in information processing technology. Thus, users Prefer choices to be given and like to select the one that suits him/her the "best" among available information. To provide such options in this Paper, we developed an algorithm that provides alternative routes that may not the "least cost" ones, but ones that are close to the "least cost" routes for users to select. The algorithm developed and introduced in the paper utilizes a link-based search method, rather than the traditional node-based search method. The link-based algorithm can still utilize the existing transportation network without any modifications, and yet enables to provide flexible route guidance to meet the various needs of users by allowing transfer to other modes and/or restricting left turns. The algorithm developed has been applied to a toy network and demonstrated successful implementation of the multi-path search algorithm for multi-purpose activities.

• Journal of Korean Society for Geospatial Information Science
• /
• v.22 no.3
• /
• pp.79-85
• /
• 2014

For the successful operation of unmanned ground vehicles(UGVs), optimal path planning should be considered with trafficability analysis, threat analysis, and so on. From among these, trafficability analysis is immensely important for safeness of UGVs especially in the case of driving the off-road such as unpaved road, grassland, and open fields. Geographical information has a pivotal role in extracting data and measuring cost for specified regions of interest. In this paper, we review possibilities to apply Land Cover Map(LCM) as a new, fundamental source and propose a new generation method of trafficability analysis map for optimal path planning of UGV. The simulation results show that the proposed method significantly improve the previous method by applying LCM either alone or in combination with the other GIS.

• Spatial Information Research
• /
• v.16 no.1
• /
• pp.65-77
• /
• 2008

There have been many studies and technologies that define a current location of a moving vehicle with GPS(Global Positioning System). However, the navigation system with GPS has troubles to search an optimized route considering data such as realtime parking status and road conditions. Moreover, the GPS systems show malfunction in the downtown with very tall buildings, underground parking lot and the inside of buildings. On the contrary, the RFID systems are able to reflect real-time status of parking lots and roads in the downtown. This paper proposes a system of guiding path for parking lots to consider real-time constraints based on RFID. The results obtained from the implemented system show smooth guiding of a new route after immediately sensoring the change of the information of parking lots and roads: if a parking lot that a vehicle is heading to is fully occupied, the system re-searches a new route for a neighbor parking lot and immediately transfers it to customer's mobile, and if the designated route is under construction, the system guides a detour path. The proposed method will be useful for advanced integrated parking control system.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.245-248
• /
• 2009

Recently, Many studies have been progressing to path-finding with dynamic information on the Terminal Based Navigation System(TBNS). However, the most of existing algorithms are based on $A{\ast}$ algorithm. Path-finding algorithms which use heuristic function may occur a problem of the increase of exploring cost in case of that there is no way determined by heuristic function or there are 2 way more which have almost same cost. In this paper, two abstract graph(AG) that are different method of construction, Homogeneous Node merging($AG^H$) and Connected Node Merging($AG^C$), are implemented. The abstract graph is a simple graph of real road network. The method of using the abstract graph is proposed for reducing dependency of heuristic and exploring cost. In result of evaluation of performance, $AG^C$ has better performance than $AG^H$ at construction cost but $AG^C$ has worse performance than $AG^H$ exploring cost.