• Title/Summary/Keyword: Path Selection Algorithm

Search Result 169, Processing Time 0.024 seconds

Neural Networks Based Modeling with Adaptive Selection of Hidden Layer's Node for Path Loss Model

  • Kang, Chang Ho;Cho, Seong Yun
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.8 no.4
    • /
    • pp.193-200
    • /
    • 2019
  • The auto-encoder network which is a good candidate to handle the modeling of the signal strength attenuation is designed for denoising and compensating the distortion of the received data. It provides a non-linear mapping function by iteratively learning the encoder and the decoder. The encoder is the non-linear mapping function, and the decoder demands accurate data reconstruction from the representation generated by the encoder. In addition, the adaptive network width which supports the automatic generation of new hidden nodes and pruning of inconsequential nodes is also implemented in the proposed algorithm for increasing the efficiency of the algorithm. Simulation results show that the proposed method can improve the neural network training surface to achieve the highest possible accuracy of the signal modeling compared with the conventional modeling method.

Delay optimization algorithm on FPGAs (FPGA 에 대한 지연시간 최적화 알고리듬)

  • Hur Chang-Wu;Kim Nam-Woo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.7
    • /
    • pp.1259-1265
    • /
    • 2006
  • In this paper, we propose a combined synthetic algorithm of the logic level for high speed FPGA design. The algorithm divides critical path to reduce delay time and generates a circuit which the divided circuits execute simultaneously. This kernel selection algorithm is made by C-langage of SUN UNIX. We compare this with the existing FlowMap algorithm. This proposed algorithm shows result on 33.3% reduction of delay time by comparison with the existing algorithm.

A study on the variable structure control method including robot operational condition (로보트 운용조건을 포함한 가변구조 제어방식에 관한 연구)

  • 이홍규;이범희;최계근
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1988.10a
    • /
    • pp.72-75
    • /
    • 1988
  • Due to the fact that the set point regulation scheme by the variable structure control method concerns only the initial and final locations of a manipulator, many constraints may exist in the application of path tracking with obstracle avoidance. The variable structure parameter should be selected in the trajectory planning step by satisfying the constraints of the travel time and the path deviations This paper presents the selection algorithm of the variable structure parameters with the constraints of the system dynamics and the travel time and the path deviation. This study makes unify the trajectory planning and tracking control using the variable structure control method.

  • PDF

A Kth Shortest Path Algorithm with the Link-Based Label Setting Approach and Its Application for An Alternative Routes Selection (링크표지확정 다수경로탐색 알고리즘과 대안경로선정을 위한 활용)

  • Lee, Mee-Young;Baik, Nam-Cheol;Kang, Weon-Eui;Shin, Seong-Il
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.4 s.75
    • /
    • pp.85-96
    • /
    • 2004
  • Given a Path represented by a sequence of link numbers in a transportation network, the reasonable path is defined as a path that any link is appeared multiple times in it. Application of the link labelmethod(LLM) to the shortest path algorithms(SPA) enables to model the reasonable path choice behavior in urban networks. This study aims at expanding the LLM to a Kth shortest path algorithms(KPSA), which adopts the node label setting method. The small-scaled network test demonstrated that the proposed algorithm works correctly and the revised Sioux fall network test showed that the path choice behaviors are reasonably reflected. In the large-scaled network based on the South Korea peninsula, drivers' route diversion perceptions are included as cost terms in total cost. The algorithm may be applied as an alternative route information tools for the deployment of ATIS.

Methodology of Resilient Dynamic Path Management in GMPLS Network under Multiple Link Failures (GMPLS 네트워크에서 다중 경로 장애 발생시 Resilience를 만족하는 동적 경로 관리 방법)

  • Park Jong-Tae;Lee Wee-Hyuk;Kwon Jung-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.5B
    • /
    • pp.397-404
    • /
    • 2006
  • As an increase in recent optical network-based IP services, GMPLS management framework becomes more important than ever before. In this paper, we propose the dynamic GMPLS path management algorithm, which can satisfy the users with their traffic engineering recovery requirements and find out the best backup service path under multiple link failures. To be more specific, we are deriving the soluble conditions of a backup path which is satisfied in a GMPLS network. In addition, through proposing the fast backup path selection algorithm, we can sufficiently satisfy a user's recovery requirement and minimally protect the suspension of the service against a link failure.

Power-aware Relay Selection Algorithm for Cooperative Diversity in the Energy-constrained Wireless Sensor Networks (전력 제한된 무선 센서네트워크에서 협력 다이버시티를 위한 전력인지 릴레이 선택 알고리즘)

  • Xiang, Gao;Park, Hyung-Kun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.10A
    • /
    • pp.752-759
    • /
    • 2009
  • Cooperative diversity is an effective technique to combat multi-path fading. When this technique is applied to energy-constrained wireless sensor networks, it is a key issue to design appropriate relay selection and power allocation strategies. In this paper, we proposed a new multi-relay selection and power allocation algorithm to maximize network lifetime. The algorithm are composed of two relay selection stages, where the channel condition and residual power of each node were considered in multi-relay selection and the power is fairly allocated proportional to the residual power, satisfies the required SNR at destination and minimizes the total transmit power. In this paper, proposed algorithm is based on AF (amplify and forward) model. We evaluated the proposed algorithm by using extensive simulation and simulation results show that proposed algorithm obtains much longer network lifetime than the conventional algorithm.

The adaptive reduced state sequence estimation receiver for multipath fading channels (이동통신 환경에서 적응상태 축약 심볼열 추정 수신기)

  • 이영조;권성락;문태현;강창언
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.7
    • /
    • pp.1468-1476
    • /
    • 1997
  • In mobile communication systems, the Reduced State Sequence Estimation(RSSE) receiver must be able to track changes in the channel. This is carried out by the adaptive channel estimator. However, when the tentative decisions are used in the channel estimator, incorrect decisions can cause error propagation. This paper presents a new channel estimator using the path history in the Viterbi decoder for preventing error propagation. The selection of the path history in the Viterbi decoder for preventing error propagation. The selection of the path history for the channel estimator depends on the path metric as in the decoding of the Viterbi decoder in RSSE. And a discussion on the channel estimator with different adaptation algorithms such as Least Mean Square(LMS) algorithm and Recursive Least Square(RLS) algorithm is provided. Results from computer simulations show that the RSSE receivers using the proposed channel estimator have better performance than the other conventional RSSE receiver, and that the channel estimator with RLS algorithm is adequate for multipath fading channel.

  • PDF

An Algorithm for Automatic Guided Vehicle Scheduling Problems (자동유도운반차 (Automatic Guided Vehicle) 스케쥴링 해법)

  • Park, Yang-Byeong;Jeon, Deok-Bin
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.13 no.1
    • /
    • pp.11-24
    • /
    • 1987
  • Automatic Guided Vehicle Systems feature battery powered driverless vehicles with programming capabilities for path selection and positoning. Vehicles serve the machines in shop, following a guide path system installed on the shop floor. The basic problem in the system is to determine a fixed set of vehicle routes of minimal total distance(time) while keeping capacity and distance(time) constraints. In this paper, a heuristic algorithm is presented for scheduling the automatic guided vehicles. The algorithm routes the machines based on their distances and polor coordinate angles, taking into account the structural feature of the system. Computational experiments are performed on several test problems in order to evaluate the proposed algorithm. Finally, a framework for dealing with the case where supplies from the machines are probabilistic is described.

  • PDF

Algorithm selecting Software development route suitable for Project environment and characteristics (프로젝트 환경과 특성에 따른 소프트웨어 개발 경로 선정 알고리즘)

  • Jung Byung-Kwon;Yoon Seok-Min
    • The KIPS Transactions:PartD
    • /
    • v.13D no.1 s.104
    • /
    • pp.87-96
    • /
    • 2006
  • This paper focused on the method for customizing software development path, considering the project environments and characteristics. he selection standard of development path is composed of ten items, based on the process of ISO/IEC TR 15721 Information Technology Guide for ISO/IEC 12207 (Software Life Cycle Process) and ISO/IEC 15504 Information technology - Process assessment. The ten items were reflected the project environments and characteristics, at the same time the items conduct the adjustment item of selecting project development path. An algorithm for selecting software development path through items of the project environments and characteristics is presented. To test the algerian in this paper, a system for selecting development path, which reflected algorithm was developed. The development project for web-based system were also adopted to the system for selecting development path. In addition, provened hand-worked project path process differed from machine-worked project path process. The reason why it differs is that outputs were mixed or their names were changed. The effect is to select easily software development route suitable for project environment and characteristics.