• Journal of the Society of Naval Architects of Korea
• /
• v.56 no.1
• /
• pp.58-65
• /
• 2019

The stability, reliability and efficiency of a smart ship are important issues as the interest in an autonomous ship has recently been high. An automatic collision avoidance system is an essential function of an autonomous ship. This system detects the possibility of collision and automatically takes avoidance actions in consideration of economy and safety. In order to construct an automatic collision avoidance system using reinforcement learning, in this work, the sequential decision problem of ship collision is mathematically formulated through a Markov Decision Process (MDP). A reinforcement learning environment is constructed based on the ship maneuvering equations, and then the three key components (state, action, and reward) of MDP are defined. The state uses parameters of the relationship between own-ship and target-ship, the action is the vertical distance away from the target course, and the reward is defined as a function considering safety and economics. In order to solve the sequential decision problem, the Deep Deterministic Policy Gradient (DDPG) algorithm which can express continuous action space and search an optimal action policy is utilized. The collision avoidance system is then tested assuming the $90^{\circ}$intersection encounter situation and yields a satisfactory result.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1239-1251
• /
• 1999

In this paper a scalable QoS-based hierarchical inter-domain routing scheme for distributed multimedia applications in a high speed wide area network. The problem of QoS-based routing is formulated as a multicriteria shortest path problem, known as NP-complete[21,30]. Our routing scheme consists of two phases. In Phase 1, two graph construction algorithms are performed to model the network under consideration as a graph. The graph contains a part of the network topology which is completely neglected or partially considered by existing routing schemes, thus maintaining more accurate topology information. In Phase 2, a heuristic call-by-call algorithm is performed for selecting a feasible path efficiently in depth first search-like manner on the graph and tailoring to each application's QoS requirements, beginning at a vertex that represents the source node. In this paper, a simple rule is also produced, by which the visiting order of outgoing edges at each vertex on the graph is determined. The rule is based on each edge's the minimum normalized slackness to the QoS requested. The proposed routing scheme extends the PNNI-type hierarchical routing framework. Note that our routing scheme is one of a few QoS-based hierarchical routing schemes that address explicitly the issue of selecting a path with multiple metrics.

• Journal of Korean Society of Transportation
• /
• v.23 no.3 s.81
• /
• pp.35-47
• /
• 2005

This paper is to review a literature concerning Bus Transit Route Network Design(BTRNDP), to describe a future study direction for a systematic application for the BTRNDP. Since a bus transit uses a fixed route, schedule, stop, therefore an approach methodology is different from that of auto network design problem. An approach methodology for BTRNDP is classified by 8 categories: manual & guideline, market analysis, system analytic model. heuristic model. hybrid model. experienced-based model. simulation-based model. mathematical optimization model. In most previous BTRNDP, objective function is to minimize user and operator costs, and constraints on the total operator cost, fleet size and service frequency are common to several previous approach. Transit trip assignment mostly use multi-path trip assignment. Since the search for optimal solution from a large search space of BTRNDP made up by all possible solutions, the mixed combinatorial problem are usually NP-hard. Therefore, previous researches for the BTRNDP use a sequential design process, which is composed of several design steps as follows: the generation of a candidate route set, the route analysis and evaluation process, the selection process of a optimal route set Future study will focus on a development of detailed OD trip table based on bus stop, systematic transit route network evaluation model. updated transit trip assignment technique and advanced solution search algorithm for BTRNDP.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.215-220
• /
• 2013

In this paper, the signal reception environment of the satellite communications was analyzed on urban, suburban and rural environment. The correct analysis of received environment is very important in the satellite communications because the presence of various attenuation factors. Analyze attenuation factor through the simulation and that apply to each receiving environment. The urban and suburban various received sensitivity is determined according to building height and density. Moreover, attenuation occurs in rural areas due to the mountainous and vegetation. In this paper, we analysis of variety receiving environment according to movement of the ground station and the satellites can be utilized to provide stable multimedia services.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.3
• /
• pp.300-309
• /
• 2003

The Japanese developed the first Car navigation system in 1981 with the advent of Honda, which was known as the car inertial navigation system. Now days, It is possible to search the shortest route to and from places and arrival time using the internet via cell phone to the driver based on GIS and GPS. However, even with a good navigation system, it losses the shortest route when there is an average speed of the vehicle being between S-15 kilometers. Therefore, in order to improve the vehicle waiting time and average vehicle speed, we are suggesting an optimal green time algorithm using fuzzy adaptive control, where there are different traffic intersection lengths, and lanes. In this paper, to be able to assist the driver and forecast the optimal traffic information with regards to the road conditions; dangerous roads, construction work and estimation of arrival time at their destination using internet.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.2
• /
• pp.1-6
• /
• 2023

The purpose of this study is to research and develop so that users who are gradually progressing in the popularization of smartphones and the calculation of agricultural quality can use more active and flexible applications than existing application fields. People use event management applications to remember what they need to do, and maps applications to get to their appointments on time. You will need to build a glue-delivered application that leverages the Maps API to be able to recommend the glove's path for events so that the user can use the application temporarily. By comparing and analyzing currently used calendar, map, and schedule applications, several Open Maps APIs were compared to supplement the weaknesses and develop applications that converge the strengths. The results of application development by applying the optimal algorithm for recommending traffic routes according to time and place for the schedule registered by the user are described.

• Journal of Korean Society of Transportation
• /
• v.23 no.7 s.85
• /
• pp.99-110
• /
• 2005

Total travel cost of route which connects origin with destination (O-D) is consist of the total sum of link travel cost and route perception cost. If the link perception cost is different according to the origin and destination, optimal route search has limitation to reflect the actual condition by route enumeration problem. The purpose of this study is to propose optimal route searching formulation and algorithm which is enable to reflect different link perception cost by each route, not only avoid the enumeration problem between origin and destination. This method defines minimum unit of route as a link and finally compares routes using link unit costs. The proposed method considers the perception travel cost at both origin and destination in optimal route searching process, while conventional models refect the perception cost only at origin. However this two-way searching algorithm is still not able to guarantee optimum solution. To overcome this problem, this study proposed an orign based optimal route searching method which was developed based on destination based optimal perception route tree. This study investigates whether proposed numerical formulas and algorithms are able to reflect route perception behavior reflected the feature of origin and destination in a real traffic network by the example research including the diversity of route information for the surrounding area and the perception cost for the road hierarchy.

• 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 the Korea Computer Industry Society
• /
• v.4 no.4
• /
• pp.569-578
• /
• 2003

This paper presents a method in which the user produces a real-time facial animation by navigating in the space of facial expressions created from a great number of captured facial expressions. The core of the method is define the distance between each facial expressions and how to distribute into suitable intuitive space using it and user interface to generate realtime facial expression animation in this space. We created the search space from about 2,400 raptured facial expression frames. And, when the user free travels through the space, facial expressions located on the path are displayed in sequence. To visually distribute about 2,400 captured racial expressions in the space, we need to calculate distance between each frames. And we use Floyd's algorithm to get all-pairs shortest path between each frames, then get the manifold distance using it. The distribution of frames in intuitive space apply a multi-dimensional scaling using manifold distance of facial expression frames, and distributed in 2D space. We distributed into intuitive space with keep distance between facial expression frames in the original form. So, The method presented at this paper has large advantage that free navigate and not limited into intuitive space to generate facial expression animation because of always existing the facial expression frames to navigate by user. Also, It is very efficient that confirm and regenerate nth realtime generation using user interface easy to use for facial expression animation user want.