• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.437-441
• /
• 2006

Wireless sensor network consists of sensor nodes which are disseminated closely to each other to collect informations for the various requests of a sensor application applied for sensing phenomenons in real world. Each sensor node delivers sensing informations to an end user by conducting cooperative works such as processing and communicating between sensor nodes. In general, the power supply of a sensor node is depends on a battery so that the power consumption of a sensor node decides the entire life time of a sensor network. To resolve the problem, optimal routing algorithm can be used for prolong the entire life time of a sensor network based on the information on the energy level of each sensor node. In this paper, different from the existing Directed Diffusion and SPTN method, we presents a data dissemination protocol based on lower-power consumption that effectively maximizes the whole life time of a sensor network using the informations on the energy level of a sensor node and shortest-path hops. With the proposed method, a data transfer path is established using the informations on the energy levels and hops, and the collected sensing information from neighboring nodes in the event-occurring area is merged with others and delivered to users through the shortest path.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.6
• /
• pp.904-914
• /
• 2008

An action-selection-mechanism(ASM) has been proposed to work as a fully connected finite state machine to deal with sequential behaviors as well as to allow a state in the task program to migrate to any state in the task, in which a primitive node in association with a state and its transitional conditions can be easily inserted/deleted. Also, such a primitive node can be learned by a shortest path-finding-based reinforcement learning technique. Specifically, we define a behavioral motivation as having state-dependent value as a primitive node for action selection, and then sequentially construct a network of behavioral motivations in such a way that the value of a parent node is allowed to flow into a child node by a releasing mechanism. A vertical path in a network represents a behavioral sequence. Here, such a tree for our proposed ASM can be newly generated and/or updated whenever a new behavior sequence is learned. To show the validity of our proposed ASM, experimental results of a mobile robot performing the task of pushing- a- box-in to- a-goal(PBIG) will be illustrated.

• Korean Journal of Computational Design and Engineering
• /
• v.22 no.1
• /
• pp.89-99
• /
• 2017

In order to make a virtual endoscopy system effective for exploring the interior of the 3D model of a human organ, it is necessary to generate an accurate navigation path located inside the 3D model and to obtain consistent camera position and pose estimation along the path. In this paper, we propose an approach to virtual navigation of blood vessels, which makes proper use of orthogonal contours and skeleton curves. The approach generates the orthogonal contours and the skeleton curves from the 3D mesh model and its voxel model, all of which represent the blood vessels. For a navigation zone specified by two nodes on the skeleton curves, it computes the shortest path between the two nodes, estimates the positions and poses of a virtual camera at the nodes in the navigation zone, and interpolates the positions and poses to make the camera move smoothly along the path. In addition to keyboard and mouse input, intuitive hand gestures determined by the Leap Motion SDK are used as user interface for virtual navigation of the blood vessels. The proposed approach provides easy and accurate means for the user to examine the interior of 3D blood vessels without any collisions between the camera and their surface. With a simple user study, we present illustrative examples of applying the approach to 3D mesh models of various blood vessels in order to show its quality and usefulness.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.2
• /
• pp.89-95
• /
• 2017

There are a variety of apps that are finding their way. And in car navigation, we launched a product that reflects Augmented Reality technology this year. However, existing apps have problems. It is implemented in 2D or 3D, has a large error range because it has been modified in most vehicles, is not updated in real time, and car augmented reality navigation is a vehicle, and a separate device is required, etc. In this study, we implemented a smartphone app for walking directions using augmented reality, and made it possible to intuitively use a route service from a user 's location to a destination. The Dijkstra algorithm is applied to calculate the shortest path to solve the problem of finding the route with the least cost. By using this application, it is possible to use the route search service even in a data-free environment, to solve the inconvenience of the language barrier, and to update in real time, so that the latest information can be always maintained. In the future, we want to develop an app that can be commercialized by using a character in the path to promote it.

• Journal of the Korean Society for Precision Engineering
• /
• v.29 no.4
• /
• pp.441-448
• /
• 2012

This paper describes the optimal home positioning algorithm of Eclipse-II, a new conceptual parallel mechanism for motion simulator. Eclipse-II is capable of translation and 360 degrees continuous rotation in all directions. In unexpected situations such as emergency stop, riders have to be resituated as soon as possible through a shortest translational and rotational path because the return paths are not unique in view of inverse kinematic solution. Eclipse-II is man riding. Therefore, the home positioning is directly related to the safety of riders. To ensure a least elapsed time, ZYX Euler angle inverse kinematics is applied to find an optimal home orientation. In addition, the subsequent decrease of maximum acceleration and jerk values is achieved by combining the optimal return path function with cubic spline, which consequently reduces delivery force and vibration to riders.

• Journal of information and communication convergence engineering
• /
• v.8 no.6
• /
• pp.623-629
• /
• 2010

A geographical routing protocol is typically utilized for a route selection of VANET. Even if it is conceptually well adapted into VANET, message delivery tends to be unreliable with frequent network partitions, which mainly come from the inherent characteristics such as high mobility and irregular traffic density. In this paper, we deal with a method to enable reliable message delivery with reflecting the traffic density on routing decision. By concatenating the message delivery cost of each of inbetween junction section, $1^{st}$ and $2^{nd}$ shortest paths are initially determined. When it is not possible to deliver the message on a junction on the 1st path, we utilize two novel ideas, that is, letting the message stay on the junction to find out a new relay node, and putting a replicated copy to reach via a detour path. By using the NS-2 network simulator, our method has been examined in terms of message delivery rate and delay. It shows that our method is much efficient than the other method in the low density environment, while it brings similar results in the high density environment.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.19 no.6
• /
• pp.14-25
• /
• 2020

This research proposes a methodology to evaluate the rationality of passengers' route choice who make trips within Seoul metropolitan subway based on smart card data. The rationality of user route choice is divided into the degree of determinacy and similarity concepts as basic principle. Determinacy is the degree to which the route selected by the passenger is identical to the system optimal path. Similarity indicates the degree to which the route is similar to the system optimal path. The K-path search method is used for path enumeration, which allows for measurement of determinacy. To assess determinacy within similarity, transfer tag data of private operators is used. Consequently, the concept of similarity applied to the model is such that the passenger's path choice is identical to the path taken using the tag reader. Results show that the determinacy of appearance of the shortest path (K=1) is 90.4%, while the similarity of appearance as K=(2-10) is 7.9%, summing to 98.3%. This indicates that trips on the metropolitan subway network are being rationally explained. 1.7% of irrational trips are attributed to the unexplainable error term that occurs due to the diversity of passengers.

• Proceedings of the KIEE Conference
• /
• 2011.07a
• /
• pp.99-100
• /
• 2011

본 논문에서는 CdS센서를 이용하여 장애물의 위치를 판단하고 목적지까지의 최단거리를 계산하여 항체를 주행시키는 시스템에 대해 제안한다. 제안한 시스템은 크게 장애물의 위치를 판단하는 구조물부와 무인항체, 그리고 이것을 관장할 윈도우 기반의 Supervisory program으로 구성된다. 본 논문에서는 제안한 시스템의 S/W와 H/W를 설계하고 구현한 결과를 제시한다.

• The Journal of the Acoustical Society of Korea
• /
• v.23 no.2E
• /
• pp.44-50
• /
• 2004

A theoretical formula that is based on the geometrical theory of diffraction (GTD) is proposed for computing sound diffraction by multiple wedges, barriers, and polygonal-like shapes. The formula can treat both convex and concave edges, where edges mayor may not be inter-connected. Comparisons of theoretical predictions with other results done by the BEM or experiments for scaled model confirm the accuracy of the present formula. Numerical examples such as double wedges and doubly inclined barrier show that when there exist several diffraction paths for given source and receiver positions, the insertion loss is dominated by the diffraction associated with the shortest propagation path.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.11
• /
• pp.740-745
• /
• 2016

Cables are installed for tens of thousands of connections between various pieces of equipment to operate and control a commercial ship. The correct shortest-route data is necessary since these are complicated cable installations. Therefore, an overfill interval commonly exists in the shortest paths for cables as estimated by Dijkstra's algorithm, even if this algorithm is generally used. It is difficult for an electrical engineer to find the overfill interval in 3D cable models because the occupancy rate data exist in a data sheet unlinked to three-dimensional (3D) computer-aided design (CAD). The purpose of this study is to suggest a visualization method that displays the cable path and overfill interval in 3D CAD. This method also provides various color visualizations for different overfill ranges to easily determine the overfill interval. This method can reduce cable-installation man-hours from 7,000 to 5,600 thanks to a decreased re-installation rate, because the cable length calculation's accuracy is raised through fast and accurate reviews based on 3D cable visualization. As a result, material costs can also be reduced.