• 제목/요약/키워드: Time-of-Arrival

검색결과 1,426건 처리시간 0.031초

다중 안테나 기반 위상 차이를 이용한 AOA 측위 기법 (Multi-Antenna based AOA Positioning using Phase Difference)

  • 박익현;유국열;박용완
    • 대한임베디드공학회논문지
    • /
    • 제8권2호
    • /
    • pp.95-102
    • /
    • 2013
  • In this paper, we have studied the performance of the AOA (Angle of Arrival) in multi-antenna systems for LBS (Location Based Services) and we also analyzed the performance of the AOA in SISO (Single Input Single Output) in multipath environments and their differences. The adequacy of AOA positioning in new communication environments was determined. Currently used positioning methods in 3G communication environment has been developed based on SISO. However, the accuracy of SISO-based TOA (Time of Arrival), TDOA (Time Difference of Arrival), AOA positioning techniques degraded in multipath environments. The communication system will be changed and developed. According to enhanced positioning techniques are required. Using antenna characteristics and the phase difference between antennas of LTE-Advanced standard's key technique MIMO system AOA positioning, and SISO based AOA positioning performance were analyzed. We found that AOA technique potential for use based on Multiple antenna systems by computer simulations.

위상비교와 시간차를 복합한 정밀 방향탐지 기술 (An Accurate Direction Finding Technology Using a Phase Comparison and Time Difference of Arrival)

  • 임중수
    • 한국산학기술학회논문지
    • /
    • 제12권11호
    • /
    • pp.5208-5213
    • /
    • 2011
  • 본 논문에서는 배열안테나에 도달한 전파의 위상차와 시간차를 이용하여 방향탐지 정확도가 높고 방향모호성이 없는 새로운 방향탐지 기술을 제안하였다. 21세기의 전자정보시스템에는 배열 안테나에 도달하는 신호의 위상차를 이용하는 위상차 방향탐지 방식 또는 배열안테나에 도달하는 신호도착 시간차를 이용하는 방향탐지 방식이 주로 사용되고 있다. 시간차를 이용하는 방식은 장치구성은 간단하지만 좁은 안테나 배치공간에서는 방향탐지 정확도가 나쁘고, 위상차 방식은 좁은 안테나 배치공간에서도 방향탐지 정확도는 높으나 방향모호성이 발생한다. 본 논문에서는 두 방식의 장점을 결합한 방향탐지 정확도가 높고 방향모호성이 없는 새로운 방향탐지 기술을 제안하였으며, 실제 운용환경과 유사한 잡음환경에서 방향탐지 오차를 모사하여 제안된 방식의 우수성을 입증하였다.

공급사슬환경하에서 차량의 도착시각 시간창 결정을 위한 모델 (A Model for Determining Time Windows for Vehicles of Suppliers in a Supply Chain)

  • 김기영;김갑환
    • 산업공학
    • /
    • 제14권4호
    • /
    • pp.365-373
    • /
    • 2001
  • It is discussed how to determine time windows for pickups and deliveries, which have been assumed to be given in all most of previous studies on traveling salesman problems with time window, vehicle routing problems with time window, vehicle scheduling and dispatching problems, and so on. First, time windows are classified into four models (DR, DA, AR, and AA) by customers‘ polices. For each model, it is shown how a time window is related to various cost terms of suppliers and customers. Under the assumption of collaborative supplier-customer relationship, an integrated cost model for both supplier and customer is constructed for determining boundaries of time windows. The cost models in this paper consists of cost terms that depend on waiting time, early arrival time, late arrival time, and rejection of receipt. A numerical example is provided and results of the sensitivity analysis for some parameters are also provided to help intuitive understanding about the characteristics of the suggested models.

  • PDF

지연비용을 고려한 서비스 시간대가 존재하는 외판원 문제에 대한 발견적 해법 (A Heuristc Algorithm for the Traveling Salesman Problem with Time Windows and Lateness Costs)

  • 서병규;김종수
    • 대한산업공학회지
    • /
    • 제27권1호
    • /
    • pp.18-24
    • /
    • 2001
  • This paper presents a model and a heuristic algorithm for the Traveling Salesman Problem with Time Windows(TSPTW). The main difference of our model compared with the previous ones lies in that the time windows we are concerned are more flexible and realistic than the previous ones. In the typical TSPTW, the service at a node must begin within the time grid called the time window that is defined by the earliest and the latest time to start the service at each node. But, in real business practice, a lateness cost is usually penalized rather than the service is prohibited at all when a vehicle arrives after the latest time. Considering this situation, we develop a model with a new time window that allows an arrival after the latest time and penalizes the late arrival by charging a lateness cost. A two-phased heuristic algorithm is proposed for the model and is extensively tested to verify the accuracy and efficiency of the algorithm.

  • PDF

Control of G/MX/1 Queueing System with N-Policy and Customer Impatience

  • Lim, Si-Yeong;Hur, Sun
    • Industrial Engineering and Management Systems
    • /
    • 제15권2호
    • /
    • pp.123-130
    • /
    • 2016
  • We introduce a queueing system with general arrival stream and exponential service time under the N-policy, where customers may renege during idle period and arrival rates may vary according to the server's status. Probability distributions of the lengths of idle period and busy period are derived using absorbing Markov chain approach and a method to obtain the optimal control policy that minimizes long-run expected operating cost per unit time is provided. Numerical analysis is done to illustrate and characterize the method.

퍼지 다기준 의사 결정을 이용한 이동체 위치 추적 방법 (Mobile Tracking Method based on the Fuzzy Mliti-criteria Decision Making)

  • 이기성;신창둔;이종찬;이근왕
    • 한국통신학회논문지
    • /
    • 제26권7A호
    • /
    • pp.1144-1151
    • /
    • 2001
  • 본 연구에서는 AOA(Angle of Arrival)와 TOA(Time of Arrival) 그리고 TDOA(Time Difference of Arrival)의 추정값을 이용한 위치 추정 기법들이 설명되고 분석된다. 이들 기법들을 다중경로 페이딩 (mutipath fading)과 shadowing을 갖는 마이크로셀 환경에 적용한다면, 빠르고 예측할 수 없는 신호 레벨의 변화로 인하여 이동체의 위치를 정확히 추정하는 것은 어렵다. 따라서 본 연구에서는 수신 신호 세기(RSS: Received Signal Strength) 이외에 이동체와 기지국간의 거리, 이동체의 이동방향, 이동체의 이전위치와 같은 부정확한 다수의 파라미터를 동시에 고려하는 퍼지 다기준 (multi-criteria) 의사 결정 방법을 이용하여 이동체의 위치를 결정하는 방법을 제안한다. 시뮬레이션을 통하여, 이동체의 방향과 속도의 영향을 분석한다.

  • PDF

An Algorithm for the Traveling Salesperson Problem with Time Windows and Lateness Costs

  • Suh, Byung-Kyoo;Kim, Jong-Soo
    • 산업경영시스템학회지
    • /
    • 제22권53호
    • /
    • pp.13-22
    • /
    • 1999
  • This paper presents a model and dynamic programming based algorithm for the Traveling Salesperson Problem with Time Windows (TSPTW). The main difference of our model compared with the previous ones lies in that the time windows we are concerned are far more flexible and realistic. In the typical TSPTW, the service at a node must begin within the time grid called the time window that is defined by the earliest and the latest time to start the service at the node. But, in real business practices, a lateness cost is usually penalized rather than the service is prohibited at all when a vehicle arrives after the latest time. Considering this situation, we propose a model with a new time window that allows an arrival after the latest time and penalizes the late arrival by charging a lateness cost. An algorithm introduced for the model is extensively tested to verify the accuracy and efficiency.

  • PDF

SOME WAITING TIME ANALYSIS FOR CERTAIN QUEUEING POLICIES

  • Lim, Jong-Seul
    • Journal of applied mathematics & informatics
    • /
    • 제29권1_2호
    • /
    • pp.469-474
    • /
    • 2011
  • In a M/G/I queue where the server alternates between busy and idle periods, we assume that firstly customers arrive at the system according to a Poisson process and the arrival process and customer service times are mutually independent, secondly the system has infinite waiting room, thirdly the server utilization is less than 1 and the system has reached a steady state. With these assumptions, we analyze waiting times on the systems where some vacation policies are considered.

고객 도착 정보를 이용한 서비스 차별화에 관한 점근적 분석 (Asymptotic Analysis on Service Differentiation with Customer Arrival Information)

  • 최기석
    • 한국경영과학회지
    • /
    • 제33권2호
    • /
    • pp.115-135
    • /
    • 2008
  • An interesting problem in capacitated supply chains is how to guarantee customer service levels with limited resources. One of the common approaches to solve the problem is differentiating service depending on customer classes. High-priority customers receive a better service at the cost of low-priority customers' service level. One of common criteria to determine a customer's priority in practice is whether he has made a reservation before arrival or not. Customers with a reservation usually receive service based on the time the reservation was made. We examine the effect this advance information of customer arrival has on customer service levels. We show the trade-offs between the leadtime and other system characteristics such as the proportion of high-priority customers. when the service level is high. We also suggest how to differentiate service using the asymptotic ratio of the service levels for both types of customers.

Estimation of baroreflex sensitivity using pulse arrival time rather than systolic blood pressure measurement

  • Lee, Jong-Shill;Chee, Young-Joon
    • 대한의용생체공학회:의공학회지
    • /
    • 제31권1호
    • /
    • pp.14-19
    • /
    • 2010
  • Baroreflex sensitivity (BRS) is a parameter of the cardiovascular system that is reflected in changes in pulse interval (PD and systolic blood pressure (SBP). BRS contains information about how the autonomic nervous system regulates hemodynamic homeostasis. Normally the beat-to-beat SBP measurement and the pulse interval measured from the electrocardiogram (ECG) are required to estimate the BRS. We investigated the possibility of measuring BRS in the absence of a beat-to-beat SBP measurement device. Pulse arrival time (PAT), defined as the time between the R-peak of the ECG and a single characteristic point on the pulse wave recorded from any arterial location was measured by photoplethysmography. By comparing the BRS obtained from conventional measurements with our method during controlled breathing, we confirmed again that PAT and SBP are closely correlated, with a correlation coefficient of -0.82 to -0.95. The coherence between SBP and PI at a respiration frequency of 0.07-0.12 Hz was similar to the coherence between PAT and PI. Although the ranges and units of measurement are different (ms/mmHg vs. ms/ms) for BRS measured conventionally and by our method, the correlation is very strong. Following further investigation under various conditions, BRS can be reliably estimated without the inconvenient and expensive beat-to-beat SBP measurement.