• Journal of the Korean Institute of Intelligent Systems
• /
• 제21권2호
• /
• pp.268-275
• /
• 2011

This paper proposes two optimal path planning methods of a mobile robot using uDEAS (univariate Dynamic Encoding Algorithm for Searches). Before start of autonomous traveling, a self-controlled mobile robot must generate an optimal global path as soon as possible. To this end, numerical optimization method is applied to real time path generation of a mobile robot with an obstacle avoidance scheme and the basic path generation method based on the concept of knot and node points between start and goal points. The first improvement in the present work is to generate diagonal paths using three node points in the basic path. The second innovation is to make a smooth path plotted with the blending polynomial using uDEAS. Effectiveness of the proposed schemes are validated for several environments through simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제31권10C호
• /
• pp.921-926
• /
• 2006

The Presence of a line-of-sight(LoS) blockage can degrade the UWB positioning accuracy for two reasons. Firstly, it makes estimation of the time of arrival(ToA) of the direct path signal difficult by complicating the multipath structure of the propagation channel. Secondly, the higher dielectric constant of the LoS blocking material than that of free space introduces excess propagation delay which will bias the range estimation. In this paper, methods based on ray tracing to reduce the ranging error resulting from the second reason are Posed. We take two different approaches; a statistical approach and a map-aided method. In the statistical approach, we establish a conditional distribution of the excess propagation delay caused by LoS blockages using a ray tracing technique. The lo6wer bound of the ranging performance based on this model is estimated. Ine ray tracing method is also used for the map-aided ToA positioning approach. UWB propagation measurement data taken in an office environment is used to examine the performance of this method.

• Fire Science and Engineering
• /
• 제21권3호
• /
• pp.8-14
• /
• 2007

The manual was proposed for individual role, according to the stages of forest fire suppression at forest fire occurrence site, for forest fire crew who has a responsibility of national forest office. The scopes of this manual are (1) apply to initial attack before arriving helicopter, (2) apply to ground fire fighting support with air attack, (3) apply to mop-up after withdraw air attack, (4) apply to night suppression when air attack is impossible. This manual is arranged for incident commander or ground fire fighter duties from the 1st stage of acceptance of forest fire to the 10th stage of withdraw of helicopter. This was developed for the purpose of every awareness of the crews and therefore of fire reduction of damage of lives, properties and forest through systematic and rapid response to forest fire.

• Journal of Korean Society of Transportation
• /
• 제26권6호
• /
• pp.17-27
• /
• 2008

Logistic activities of shippers contains only origin-destin commodity flow information, but also contract relationships, cash flows and distribution channels. Under the lack of understanding of physical distribution channels, most studies have focused on the social and psychological aspects between manufacturers and retailers (e.g., mutual trust, power, conflict, reciprocal commitment, and so on). This study reports empirical results of distribution channel choice drawn from 2001 Korean Commodity Flow Survey(CFS) conducted by Korean government. Based on the CFS data, four distribution channels are classified. This study scrutinized how various factors including mode, commodity and firms characteristics affect distribution channel choice, and reported the problems of 2001 CFS survey questionaires and future directions.

• Journal of Internet Computing and Services
• /
• 제3권1호
• /
• pp.41-49
• /
• 2002

Ohba has suggested the Colored Thread Algorithm to prevent looped path when LSP is to be setup. M immediate node sends thread information such as color, hop count. ill, to downs1ream node via LDP message for the set-up of LSP. Afterward, decides that the looped path is formed when it receives a message with a same colored thread that was sent to downs1ream node, and it searches another path. If the message reaches to the egress node, then acknowledged message is sent to upstream node as reverse direction to the ingress node to set up loop-free path. For the algorithm, Ohva has defined three thread states as Null, Colored, Transparent. In this paper, the state of thread is extended to 5 states such as Extending, Merging, Stalling, Null, and Transparent. By the way, related FSM and TCB was redefined to make clear the ambiguity of thread states which causes faulty actions and to remove overhead. And, to improve performance, it limits to generate a thread in the state of Stalling.

• The Journal of the Korea Contents Association
• /
• 제12권7호
• /
• pp.437-444
• /
• 2012

This study features an analysis of the socio-economic factors of ten cities on the Honam-line that affect the number of train passengers. The 3 main factors based on the principal component analysis were the population, the distance between two regions, and the area size of each region while the number of automobiles has been conventionally used instead of the area size of each region. A formula to predict the train passengers by the regression analysis was developed and showed a good agreement to the number of real passengers. When Honam highspeed railway is opened, the traveling time between two regions as well as the area size of each regions should be more precisely considered.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제16권11호
• /
• pp.1037-1053
• /
• 1991

Flooding is known to be an effective routing mechanism not only in circuit switched networks but also packet switched networks since it minimizes the time required for up calls and does not have to maintain routing tables or distance tables by periodically intercommunicating among all the network nodes. However, one main drawback of it is the overhead on the control message signaling channels, In the paper, we propose an overlaying scheme on the existing mechanism that retains the desired properties of flooding, yet provides congestion control to the network. This is done by utilizing the wasted search messages to inform the network of the conditions of each path from one node to another. The overhead is to maintain a path table in each node. However, this overhead is not so critical. Also, this scheme can take advantages further by limiting the extent of message propagation through the network and by incorporating trunk reservation schemes additionally.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제24권7A호
• /
• pp.1022-1027
• /
• 1999

This paper proposes method that uses Time-Difference-of-Arrival(TDOA) of Forward Pilot signals from base stations(BS) arriving at a mobile station(MS) as a position location method of CDMA MS. MS searcher does acquisition of BS Pilot signals and measurement of TDOAs. In order to do it, its processing gain is very important. Proportional relationship of the gain to the signal coherent integration interval is theoretically derived and analyzed and field test is performed to show acquisition of weak Pilot signals and stable measurements of TDOA values by increasing the gain. Also, signal strength decrease exponentially by the distance it travels. Therefore, improvement of the searcher gain makes possible to acquire Pilot signals at a location far away from BS. Variation of possible position estimation area relative to the signal strength within a cell is simulated with computer. Neglecting shadow effect it indicated necessity of detecting signals below -35dB in order to cover over 90% of cell area. Thus, efforts to maximize searcher coherent integration interval in order to acquire weak Pilot signals are required for expansion of position estimation area and measurement of stable TDOA values.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제28권5B호
• /
• pp.369-380
• /
• 2003

In the CDMA wireless link, frame errors are correlated and burst because of fading. The implementation ability of RLP error recovery is dependent on the correlated frame errors. The (1,2,3) retransmission scheme, which is recommended as default in IS-707, is not adapted in high frame loss regime with strong correlations. By using the modified error recovery method, where the total number of retransmission attempts is the same and the retransmission is increased, the proposed retransmission scheme can efficiently recover frame errors than the (1,2,3) retransmission scheme. Since the modified scheme has longer transmission delay due to the increase of retransmission round, we propose the algorithm of retransmission failure prediction to improve the modified error recovery scheme. We simulate the modified error recovery scheme applying our algorithm and compare two schemes. (i.e. default scheme by IS-707 and modified scheme) not applying our algorithm. In the result, we show TCP performance improvement is better than default scheme by IS-707.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제34권9A호
• /
• pp.685-696
• /
• 2009

The requirements of the NGA are to provide broader bandwidth, higher splitting ratio, and longer reach than those of the current FTTH. In the TDMA PON accounting for large percentage in the total FTTH, the increase in distance between the OLT and the ONU leads to the increase in propagation delay and in packet delay three times more than the propagation delay. It is because a packet arrived in the ONU is handled through bandwidth request, grant, and transmission. To reduce the increased packet delay, the OLT have to reduce the cycle time. However, it will cause increased overhead and reduced link efficiency. In this paper, we investigate several problems in TDMA PON when the subscriber access network extended to 60 or 100 Km reach as a NGA goal and provide a method that determines an optimal cycle time to satisfy QoS for delay sensitive traffics. In particular, we suggest a variable equalized round trip delay method and a variable cycle time method. It is shown that the former reduces the packet delay and the latter increase the link efficiency.