• 제목/요약/키워드: departure time

검색결과 304건 처리시간 0.03초

클러스터링 기법을 활용한 출발 여객 체류 시간 분석 (Analysis of Departing Passengers' Dwell Time using Clustering Techniques)

  • 안덕배;김휘양;백호종
    • 한국항행학회논문지
    • /
    • 제23권5호
    • /
    • pp.380-385
    • /
    • 2019
  • 본 연구는 실제 공항에서 수집되는 여객 데이터를 활용하여 공항 내 여객의 체류 시간을 분석한 연구이다. 여객의 체류 시간은 공항 터미널 설계, 공항의 수익성에 영향을 주어 중요한 여객 특성으로 간주되어 왔지만 실제 여객 데이터 수집의 어려움으로 그에 대한 분석이나 실시간 공항 운영에 활용하기가 어려웠다. 하지만 스마트 공항의 일환으로 세계 유수의 공항에서 방대한 양의 여객 데이터를 수집하고 있고, 축적된 데이터를 활용하여 공항 내 여객 체류 시간 분석이 가능해졌다. 본 연구에서는 인천 국제 공항에서 수집된 여객 데이터를 활용하여 여객 체류 시간 분석을 수행하였으며, 방대한 양의 자료를 효율적으로 처리하기 위해 데이터 마이닝 기법인 클러스터링을 활용하여 여객을 체류 시간에 따라 구분하였다. 분석 결과 인천 국제 공항 출발 여객은 체류 시간에 따라 1) 체류 시간이 짧고 대부분의 시간을 에어사이드에서 보내는 여객, 2) 평균 3 시간 정도의 체류 시간을 갖는 여객, 3) 총 체류 시간이 압도적으로 긴 여객 등 크게 3 개의 클러스터로 구분할 수 있는 것으로 나타났다.

Advanced Lane Detecting Algorithm for Unmanned Vehicle

  • Moon, Hee-Chang;Lee, Woon-Sung;Kim, Jung-Ha
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2003년도 ICCAS
    • /
    • pp.1130-1133
    • /
    • 2003
  • The goal of this research is developing advanced lane detecting algorithm for unmanned vehicle. Previous lane detecting method to bring on error become of the lane loss and noise. Therefore, new algorithm developed to get exact information of lane. This algorithm can be used to AGV(Autonomous Guide Vehicle) and LSWS(Lane Departure Warning System), ACC(Adapted Cruise Control). We used 1/10 scale RC car to embody developed algorithm. A CCD camera is installed on top of vehicle. Images are transmitted to a main computer though wireless video transmitter. A main computer finds information of lane in road image. And it calculates control value of vehicle and transmit these to vehicle. This algorithm can detect in input image marked by 256 gray levels to get exact information of lane. To find the driving direction of vehicle, it search line equation by curve fitting of detected pixel. Finally, author used median filtering method to removal of noise and used characteristic part of road image for advanced of processing time.

  • PDF

Input Constrained Robust Model Predictive Control with Enlarged Stabilizable Region

  • Lee, Young-Il
    • International Journal of Control, Automation, and Systems
    • /
    • 제3권3호
    • /
    • pp.502-507
    • /
    • 2005
  • The dual-mode strategy has been adopted in many constrained MPC (Model Predictive Control) methods. The size of stabilizable regions of states of MPC methods depends on the size of underlying feasible and positively invariant sets and the number of control moves. The results, however, may perhaps be conservative because the definition of positive invariance does not allow temporal departure of states from the set. In this paper, a concept of periodic invariance is introduced in which states are allowed to leave a set temporarily but return into the set in finite time steps. The periodic invariance can be defined with respect to sets of different state feedback gains. These facts make it possible for the periodically invariant sets to be considerably larger than ordinary invariant sets. The periodic invariance can be defined for systems with polyhedral model uncertainties. We derive a MPC method based on these periodically invariant sets. Some numerical examples are given to show that the use of periodic invariance yields considerably larger stabilizable sets than the case of using ordinary invariance.

(Max, +)-대수를 이용한 3-노드 유한 버퍼 일렬대기행렬에서의 대기시간 분석 (Application of (Max, +)-algebra to the Waiting Times in Deterministic 3-node Tandem Queues with Blocking)

  • 서동원
    • 한국경영과학회지
    • /
    • 제30권2호
    • /
    • pp.73-80
    • /
    • 2005
  • In this paper, we consider characteristics of waiting times in s1n91e-server 3-node tandem queues with finite buffers, a Poisson arrival process and deterministic service times at all nodes. There are three buffers : one at the first node is infinite and the others are finite. We obtain the fact that sojourn time or departure process is independent of the capacities of the finite buffers and does not depend on the order of service times, which are the same results in the literature. Moreover, the explicit expressions of stationary waiting times in all areas of the systems can be derived as functions of the finite buffer capacities. We also disclose a relationship of waiting times in subareas of the systems between two blocking policies communication and manufacturing. Some numerical examples are also provided.

종방향 능동안전장치의 평가기준 연구 (Study for Evaluation Standard of Longitudinal Active Safety System)

  • 장현익;용부중;조성우;최인성;민경찬;김규현
    • 자동차안전학회지
    • /
    • 제4권1호
    • /
    • pp.12-17
    • /
    • 2012
  • ADAS(Advanced Driver Assistance System) which is developed for alleviating driver's load has become improved with extending it's role. Previously, ADAS offered simple function just to make driver's convenience. However, nowadays ADAS also acts as Active Safety system which is made to release and/or prevent accidents. Longitudinal control system, as one of major parts of Active Safety System, is assessed as doing direct effect on avoiding accidents. Therefore, many countries such as Europe and America has pushed longitudinal control system as a government-wide project. In this paper, it covers the result of evaluation system and vehicle evaluation for development study in FCW, ACC and AEB.

차선이탈 경보시스템을 위한 실시간 영상처리 하드웨어 구현 (A Real-Time Onboard image Processing System for Lane Departure Warning)

  • 이운근
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2004년도 하계학술대회 논문집 D
    • /
    • pp.2507-2509
    • /
    • 2004
  • 지능형 안전자동차에 비전센서를 채택하여 이의 응용시스템을 개발하기 위해서는 궁극적으로 많은 양의 영상데이터를 시스템의 제어목적에 부합하도록 실시간으로 처리하기 위한 노력과 구현하고자 하는 영상처리시스템을 정적인 실내환경과 달리 열악한 환경의 차량에 탑재가 용이하게 하기 위한 소형화의 노력이 요구된다. 본 논문에서 구현된 실시간 영상처리 하드웨어는 에지 연산 등의 반복된 전처리는 FPGA에서 처리하고, 상위단계의 영상처리는 RISC에서 수행하는 구조이다. 구현된 영상처리 하드웨어는 에지정보 기반의 차선정보추출 및 차선이탈 경보알고리즘을 적용하여 그 성능을 평가하였으며, 초당 25프레임 이상의 영상처리를 수행할 수 있는 연산속도를 보여 성공적인 결과를 얻을 수 있었다.

  • PDF

Exact perturbation analysis technique and optimal buffer storage design for tandem queueing networks

  • Kwon, Wook-Hyun;Park, Hong-Seong;Chung, B.J.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 22-24 Oct. 1991
    • /
    • pp.469-475
    • /
    • 1991
  • In this paper, we suggest the exact perturbation analysis(Exact_PA) technique with respect to the buffer storage in tandem queueing networks, through which the optimal buffer storage design problem is considered. The discrete event dynamic equations for the departure time of a customer are presented together with the basic properties of Full Out(FO) and No Input(NI) with respect to the buffer storage. The new perturbation rules with respect to the buffer storage are suggested, from which the exact perturbed path can be obtained. The optimal buffer storage problem is presented by introducing a performance measure consisting of the throughput and the buffer storage cost. An optimization algorithm maximizing this performance measure is derived by using the Exact_PA technique. The proposed perturbation analysis technique and the optimization algorithm are validated by numerical examples.

  • PDF

A nonlinear programming approach to collision-avoidance trajectory planning of multiple robots

  • Suh, Suk-Hwan;Kim, Myung-Soo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1989년도 한국자동제어학술회의논문집; Seoul, Korea; 27-28 Oct. 1989
    • /
    • pp.635-642
    • /
    • 1989
  • We formulated the multi-robot trajectory problem into a series of NLP problem, each of which is that of finding the optimal tip positions of the robots for the next time step. The NLP problem is composed of an objective function and three constraints, namely: a) Joint position limits, b) Joint velocity limits, and c) Collision-avoidance constraints. By solving a series of NLP problem, optimally coordinated trajectories can be determined without requiring any prior path information. This is a novel departure from the previous approach in which either all paths or at least one path is assumed to be given. Practical application of the developed method is for optimal synthesis of multiple robot trajectories in off-line. To test the validity and effectiveness of the method, numerical examples are illustrated.

  • PDF

차량일정계획을 위한 도시내 차량이동속도 추정모델에 대한 연구 (A Study on the Estimation Models of Intra-City Travel Speeds for Vehicle Scheduling)

  • 박양병;홍성철
    • 산업공학
    • /
    • 제11권1호
    • /
    • pp.75-84
    • /
    • 1998
  • The important issue for intra-city vehicle scheduling is to measure and store actual vehicle travel speeds between customer locations. Travel speeds(and times) in nearly all metropolitan areas change drastically during the day because of congestion in certain parts of the city road network. We propose three models for estimating departure time-dependent travel speeds between locations that relieve much burden for the data collection and computer storage requirements. Two of the three models use a least squares method and the rest one employs a neural network trained with the back-propagation rule. On a real-world study using the travel speed data collected in Seoul, we found out that the neural network model is more accurate than the other two models.

  • PDF

연지화장(化粧) 연구 II - 중국(中國)에서의 연지화장 전파(傳播)와 양상(樣相) - (A Study on 'Yeonji' Cosmetics and Make-up II - Focusing on diffusion and aspects of 'Yeonji' make-up in China -)

  • 박춘순;정복희
    • 한국생활과학회지
    • /
    • 제15권3호
    • /
    • pp.425-437
    • /
    • 2006
  • The focus of this study is on the diffusion and aspects of Yoenji make-up in China. The diffusion of Yoenji make-up into China was achieved by Zhuang-Kun's departure for the West of China, after Emperor Moo of Han Dynasty defeated the Huns (B.C. 121). The Yoenji make-up is basically used as a unique sign and from the result of excessive development from the facial beauty point in accordance with luxurious Court culture and opening door of culture. It can diversely express kinds, names, ways, types and patterns, places and bodily parts, the colors of materials for use, and time zones of a make-up.

  • PDF