• 제목/요약/키워드: Simulation Framework

검색결과 1,140건 처리시간 0.028초

Integrated Navigation Design Using a Gimbaled Vision/LiDAR System with an Approximate Ground Description Model

  • Yun, Sukchang;Lee, Young Jae;Kim, Chang Joo;Sung, Sangkyung
    • International Journal of Aeronautical and Space Sciences
    • /
    • 제14권4호
    • /
    • pp.369-378
    • /
    • 2013
  • This paper presents a vision/LiDAR integrated navigation system that provides accurate relative navigation performance on a general ground surface, in GNSS-denied environments. The considered ground surface during flight is approximated as a piecewise continuous model, with flat and slope surface profiles. In its implementation, the presented system consists of a strapdown IMU, and an aided sensor block, consisting of a vision sensor and a LiDAR on a stabilized gimbal platform. Thus, two-dimensional optical flow vectors from the vision sensor, and range information from LiDAR to ground are used to overcome the performance limit of the tactical grade inertial navigation solution without GNSS signal. In filter realization, the INS error model is employed, with measurement vectors containing two-dimensional velocity errors, and one differenced altitude in the navigation frame. In computing the altitude difference, the ground slope angle is estimated in a novel way, through two bisectional LiDAR signals, with a practical assumption representing a general ground profile. Finally, the overall integrated system is implemented, based on the extended Kalman filter framework, and the performance is demonstrated through a simulation study, with an aircraft flight trajectory scenario.

An Emission-Aware Day-Ahead Power Scheduling System for Internet of Energy

  • Huang, Chenn-Jung;Hu, Kai-Wen;Liu, An-Feng;Chen, Liang-Chun;Chen, Chih-Ting
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권10호
    • /
    • pp.4988-5012
    • /
    • 2019
  • As a subset of the Internet of Things, the Internet of Energy (IoE) is expected to tackle the problems faced by the current smart grid framework. Notably, the conventional day-ahead power scheduling of the smart grid should be redesigned in the IoE architecture to take into consideration the intermittence of scattered renewable generations, large amounts of power consumption data, and the uncertainty of the arrival time of electric vehicles (EVs). Accordingly, a day-ahead power scheduling system for the future IoE is proposed in this research to maximize the usage of distributed renewables and reduce carbon emission caused by the traditional power generation. Meanwhile, flexible charging mechanism of EVs is employed to provide preferred charging options for moving EVs and flatten the load profile simultaneously. The simulation results revealed that the proposed power scheduling mechanism not only achieves emission reduction and balances power load and supply effectively, but also fits each individual EV user's preference.

A Signal Subspace Interference Alignment Scheme with Sum Rate Maximization and Altruistic-Egoistic Bayesian Gaming

  • Peng, Shixin;Liu, Yingzhuang;Chen, Hua;Kong, Zhengmin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권6호
    • /
    • pp.1926-1945
    • /
    • 2014
  • In this paper, we propose a distributed signal subspace interference alignment algorithm for single beam K-user ($3K{\geq}$) MIMO interference channel based on sum rate maximization and game theory. A framework of game theory is provided to study relationship between interference signal subspace and altruistic-egoistic bayesian game cost function. We demonstrate that the asymptotic interference alignment under proposed scheme can be realized through a numerical algorithm using local channel state information at transmitters and receivers. Simulation results show that the proposed scheme can achieve the total degrees of freedom that is equivalent to the Cadambe-Jafar interference alignment algorithms with perfect channel state information. Furthermore, proposed scheme can effectively minimize leakage interference in desired signal subspace at each receiver and obtain a moderate average sum rate performance compared with several existing interference alignment schemes.

대형말뚝기초의 축하중 거동에 대한 수치해석기반 신뢰성 해석 (Reliability Analysis of Axially Loaded Large-scale Pile Foundations)

  • 허정원;박재현;이주형;하성한;곽기석;정문경
    • 한국지반공학회:학술대회논문집
    • /
    • 한국지반공학회 2009년도 춘계 학술발표회
    • /
    • pp.17-22
    • /
    • 2009
  • Reliability analyses were performed to quantify the risk in axially loaded large-scale pile foundations in consideration of pile-soil interaction and uncertainties on various design variables. The finite difference method based on an equivalent soil spring model and a load transfer method and Monte Carlo simulation method are integrated in the framework of reliabilty analysis. The applicability and efficiency of the proposed method in the safety assessment of axially loaded pile-soil system was verified using a realistic example. Since the proposed method can explicitly consider uncertainties in various design variables, and quantify failure probability of a pile foundation, it can be used to estimate risk, to obtain basic informations for life cycle cost analysis, and to develop code requirements for a reliability-based design of pile foundations.

  • PDF

Two-Dimensional POMDP-Based Opportunistic Spectrum Access in Time-Varying Environment with Fading Channels

  • Wang, Yumeng;Xu, Yuhua;Shen, Liang;Xu, Chenglong;Cheng, Yunpeng
    • Journal of Communications and Networks
    • /
    • 제16권2호
    • /
    • pp.217-226
    • /
    • 2014
  • In this research, we study the problem of opportunistic spectrum access (OSA) in a time-varying environment with fading channels, where the channel state is characterized by both channel quality and the occupancy of primary users (PUs). First, a finite-state Markov channel model is introduced to represent a fading channel. Second, by probing channel quality and exploring the activities of PUs jointly, a two-dimensional partially observable Markov decision process framework is proposed for OSA. In addition, a greedy strategy is designed, where a secondary user selects a channel that has the best-expected data transmission rate to maximize the instantaneous reward in the current slot. Compared with the optimal strategy that considers future reward, the greedy strategy brings low complexity and relatively ideal performance. Meanwhile, the spectrum sensing error that causes the collision between a PU and a secondary user (SU) is also discussed. Furthermore, we analyze the multiuser situation in which the proposed single-user strategy is adopted by every SU compared with the previous one. By observing the simulation results, the proposed strategy attains a larger throughput than the previous works under various parameter configurations.

Roll out 알고리듬을 이용한 반복 작업을 하는 안전병렬기계 알고리듬 개발 (- Development of an Algorithm for a Re-entrant Safety Parallel Machine Problem Using Roll out Algorithm -)

  • 백종관;김형준
    • 대한안전경영과학회지
    • /
    • 제6권4호
    • /
    • pp.155-170
    • /
    • 2004
  • Among the semiconductor If-chips, unlike memory chips, a majority of Application Specific IC(ASIC) products are produced by customer orders, and meeting the customer specified due date is a critical issue for the case. However, to the one who understands the nature of semiconductor manufacturing, it does not take much effort to realize the difficulty of meeting the given specific production due dates. Due to its multi-layered feature of products, to be completed, a semiconductor product(called device) enters into the fabrication manufacturing process(FAB) repeatedly as many times as the number of the product specified layers, and fabrication processes of individual layers are composed with similar but not identical unit processes. The unit process called photo-lithography is the only process where every layer must pass through. This re-entrant feature of FAB makes predicting and planning of due date of an ordered batch of devices difficult. Parallel machines problem in the photo process, which is bottleneck process, is solved with restricted roll out algorithm. Roll out algorithm is a method of solving the problem by embedding it within a dynamic programming framework. Restricted roll out algorithm Is roll out algorithm that restricted alternative states to decrease the solving time and improve the result. Results of simulation test in condition as same as real FAB facilities show the effectiveness of the developed algorithm.

200kW 타워형 태양열발전시스템의 헬리오스타트 필드 운영 알고리즘 개발 (Development of Heliostat Field Operational Algorithm for 200kW Tower Type Solar Thermal Power Plant)

  • 박영칠
    • 한국태양에너지학회 논문집
    • /
    • 제34권5호
    • /
    • pp.33-41
    • /
    • 2014
  • Heliostat field in a tower type solar thermal power plant is the sun tracking mirror system which affects the overall efficiency of solar thermal power plant most significantly while consumes a large amount of energy to operate it. Thus optimal operation of it is very crucial for maximizing the energy collection and, at the same time, for minimizing the operating cost. Heliostat field operational algorithm is the logics to control the heliostat field efficiently so as to optimize the heliostat field optical efficiency and to protect the system from damage as well as to reduce the energy consumption required to operate the field. This work presents the heliostat field operational algorithm developed for the heliostat field of 200kW solar thermal power plant built in Daegu, Korea. We first review the structure of heliostat field control system proposed in the previous work to provide the conceptual framework of how the algorithm developed in this work could be implemented. Then the methodologies to operate the heliostat field properly and efficiently, by defining and explaining the various operation modes, are discussed. A simulation, showing the heat flux distribution collected by the heliostat field at the receiver, is used to show the usefulness of proposed heliostat field operational algorithm.

Domain decomposition for GPU-Based continuous energy Monte Carlo power reactor calculation

  • Choi, Namjae;Joo, Han Gyu
    • Nuclear Engineering and Technology
    • /
    • 제52권11호
    • /
    • pp.2667-2677
    • /
    • 2020
  • A domain decomposition (DD) scheme for GPU-based Monte Carlo (MC) calculation which is essential for whole-core depletion is introduced within the framework of the modified history-based tracking algorithm. Since GPU-offloaded MC calculations suffer from limited memory capacity, employing DDMC is inevitable for the simulation of depleted cores which require large storage to save hundreds of newly generated isotopes. First, an automated domain decomposition algorithm named wheel clustering is devised such that each subdomain contains nearly the same number of fuel assemblies. Second, an innerouter iteration algorithm allowing overlapped computation and communication is introduced which enables boundary neutron transactions during the tracking of interior neutrons. Third, a bank update scheme which is to include the boundary sources in a way to be adequate to the peculiar data structures of the GPU-based neutron tracking algorithm is presented. The verification and demonstration of the DDMC method are done for 3D full-core problems: APR1400 fresh core and a mock-up depleted core. It is confirmed that the DDMC method performs comparably with the standard MC method, and that the domain decomposition scheme is essential to carry out full 3D MC depletion calculations with limited GPU memory capacities.

Current Conservation Factors for Consistent One-Dimensional Neutronics Modeling

  • Lee, Kibog;Joo, Han-Gyu;Cho, Byung-Oh;Zee, Sung-Quun
    • Nuclear Engineering and Technology
    • /
    • 제32권3호
    • /
    • pp.235-243
    • /
    • 2000
  • A one-dimensional neutronics formulation is established within the framework of the nonlinear analytic nodal method such that it can result in consistent one-dimensional models that produce the same axial information as their corresponding reference three-dimension81 models. Consistency is achieved by conserving axial interface currents as well as the planar reaction rates of the three-dimensional case. For current conservation, flux discontinuity is introduced in the solution of the two-node problem. The degree of discontinuity, named the current conservation factor, is determined such that the surface averaged axial current of the reference three-dimensional case can be retrieved from the two-node calculation involving the radially collapsed group constants and the discontinuity factor. The current conservation factors are derived from the analytic nodal method and various core configurations are analyzed to show that the errors in K-eff and power distributions can be reduced by a order of magnitude by the use of the current conservation factor with no significant computational overhead.

  • PDF

Identifying differentially expressed genes using the Polya urn scheme

  • Saraiva, Erlandson Ferreira;Suzuki, Adriano Kamimura;Milan, Luis Aparecido
    • Communications for Statistical Applications and Methods
    • /
    • 제24권6호
    • /
    • pp.627-640
    • /
    • 2017
  • A common interest in gene expression data analysis is to identify genes that present significant changes in expression levels among biological experimental conditions. In this paper, we develop a Bayesian approach to make a gene-by-gene comparison in the case with a control and more than one treatment experimental condition. The proposed approach is within a Bayesian framework with a Dirichlet process prior. The comparison procedure is based on a model selection procedure developed using the discreteness of the Dirichlet process and its representation via Polya urn scheme. The posterior probabilities for models considered are calculated using a Gibbs sampling algorithm. A numerical simulation study is conducted to understand and compare the performance of the proposed method in relation to usual methods based on analysis of variance (ANOVA) followed by a Tukey test. The comparison among methods is made in terms of a true positive rate and false discovery rate. We find that proposed method outperforms the other methods based on ANOVA followed by a Tukey test. We also apply the methodologies to a publicly available data set on Plasmodium falciparum protein.