• Title/Summary/Keyword: Minimum-time

Search Result 4,142, Processing Time 0.033 seconds

Trajectory Optimization in Consideration of Inertial Navigation Errors

  • Ryoo, Chang-Kyung;Kim, Jong-Ju;Cho, Hang-Ju
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.125.2-125
    • /
    • 2001
  • Inertial navigation error is the major source of miss distance when only the inertial navigation system is used for guidance, and tend to monotonically increase if the flight time is small compared to the Schuler period. Miss distance due to these inertial navigation errors, therefore, can be minimized when a missile has the minimum time trajectory. Moreover, vertical component of navigation error becomes null if he impact angle to a surface target approaches to 90 degrees. In this paper, the minimum time trajectories with the steep terminal impact angle constraint are obtained by using CFSQP 2.5, and their properties are analyzed to give a guideline for he construction of an effective guidance algorithm for short range tactical surface-to-surface missiles.

  • PDF

Computation of Unsteady Aerodynamic Forces in the Time Domain for GVT-based Ground Flutter Test (지상 플러터 실험을 위한 시간 영역에서의 비정상 공기력 계산)

  • Lee, Juyeon;Kim, Jonghwan;Bae, Jaesung
    • Journal of Aerospace System Engineering
    • /
    • v.10 no.1
    • /
    • pp.29-34
    • /
    • 2016
  • Flutter wind-tunnel test is an expensive and complicated process. Also, the test model may has discrepancy in the structural characteristics when compared to those of the real model. "Dry Wind-Tunnel" (DWT) is an innovative testing system which consists of the ground vibration test (GVT) hardware system and software which computationally can be operated and feedback in real-time to yield rapidly the unsteady aerodynamic forces. In this paper, we study on the aerodynamic forces of DWT system to feedback in time domain. The aerodynamic forces in the reduced-frequency domain are approximated by Minimum-state approximation. And we present a state-space equation of the aerodynamic forces. With the two simulation model, we compare the results of the flutter analysis.

Design of ISL(Intergrated Schottky Logic) for improvement speed using merged transistor (속도 향상을 위한 병합트랜지스터를 이용한 ISL의 설계)

  • 장창덕;백도현;이정석;이용재
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 1999.05a
    • /
    • pp.21-25
    • /
    • 1999
  • In order to remove minority carries of the base region at changing signal in conventional bipolar logic circuit, we made transistor which is composed of NPN transistor shortened buried layer under the Base region, PNP transistor which is merged in base, epi layer and substrate. Also the Ring-Oscillator for measuring transmission time-delay per gate was designed as well. In the result, we get amplitude of logic voltage of 200mV, the minimum of transmission delay-time of 211nS, and the minimum of transmission delay-time per gate of 7.26ns in AC characteristic output of Ring-Oscillator connected Gate.

  • PDF

Parallel and Sequential Implementation to Minimize the Time for Data Transmission Using Steiner Trees

  • Anand, V.;Sairam, N.
    • Journal of Information Processing Systems
    • /
    • v.13 no.1
    • /
    • pp.104-113
    • /
    • 2017
  • In this paper, we present an approach to transmit data from the source to the destination through a minimal path (least-cost path) in a computer network of n nodes. The motivation behind our approach is to address the problem of finding a minimal path between the source and destination. From the work we have studied, we found that a Steiner tree with bounded Steiner vertices offers a good solution. A novel algorithm to construct a Steiner tree with vertices and bounded Steiner vertices is proposed in this paper. The algorithm finds a path from each source to each destination at a minimum cost and minimum number of Steiner vertices. We propose both the sequential and parallel versions. We also conducted a comparative study of sequential and parallel versions based on time complexity, which proved that parallel implementation is more efficient than sequential.

Minimum Curing Time Prediction of Early Age Concrete to Prevent Frost Damage (동해방지를 위한 초기재령 콘크리트의 최소 양생 시간 예측)

  • Pae, Su-Won;Yi, Seong-Tae;Kim, Jin-Keun
    • Journal of the Korea Concrete Institute
    • /
    • v.19 no.1
    • /
    • pp.27-37
    • /
    • 2007
  • The purpose of this study is to propose a method to predict the minimum curing time of early age concrete required to prevent frost damage. Tests were performed to examine major factors, which affect the compressive strength of concrete frozen at early ages and investigate the source of frost damage at early age concrete. The results from the tests showed that the loss rate of compressive strength decreases as the beginning time of frost damage was delayed and water-cement ratio was lower. In addition, the test results also showed that concrete made with type III cement was less susceptible to frost damage than concrete made with ordinary Portland cement and frost damage occurred through the formation of ice lenses. When early age concrete is being damaged by frozen, a phase transition into ice of free water presented at the capillary pores of the concrete gives a reason for the decrease of compressive strength. Accordingly, the frost resistance of fresh concrete can be determined based on the saturation degree of the capillary pores. The method to predict the minimum curing time was suggested using the concept of critical saturation degree of the capillary pores.

Minimum Margin Tank Loading Algorithm for Chemical Tank Loading Problem (화공약품 탱크 적재 문제의 최소 여유량 탱크 적재 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.2
    • /
    • pp.131-136
    • /
    • 2015
  • The chemical tank loading problem has been classified as nondeterministic polynomial time (NP)-complete problem because of the polynomial-time algorithm to find the solution has been unknown yet. Gu$\acute{e}$ret et al. tries to obtain the optimal solution using linear programming package with $O(m^4)$ time complexity for chemical tank loading problem a kind of bin packing problem. On the other hand, this paper suggests the rule of loading chemical into minimum margin tank algorithm with O(m) time complexity. The proposed algorithm stores the chemical in the tank that has partial residual of the same kind chemical firstly. Then, we load the remaining chemical to the minimum marginal tanks. As a result of experiments, this algorithm reduces the $O(m^4)$ of linear programming to O(m) time complexity for NP-complete chemical tank loading problem.

A Kinematical Analysis of Side Kick Motion in Taekwondo (태권도 옆차기 동작의 운동학적 분석)

  • Park, Kwang-Dong
    • Korean Journal of Applied Biomechanics
    • /
    • v.13 no.2
    • /
    • pp.49-63
    • /
    • 2003
  • For this study, four male university Taekwondo players were randomly chosen, between the weight categories of 60Kg and 80Kg. Their side kicks (yeop chagi), which are part of foot techniques, were kinematically analyzed in terms of the time, angle, and angular velocity factors involved with the kicks through the three-dimensional imaging. The results of the analysis are as fellows. 1. Time factor The first phase(preparation) was 0.48sec on average, accounting for 60% of the entire time spent; the second phase(the minimum angle of the knee joint) was 0.21sec on average, taking up 26% of the whole time spent; and the third phase(hitting) was 0.11sec on average, representing 14% of the entire time spent. 2. Angle factor In the first phase(preparation), rotating their bodies along the long axis, the players bended their hip and knee joints a lot, by moving fast in the vertical and horizontal directions, in the second phase(the minimum angle of the knee joint), the players continued to extend their bodies along the vertical axis, while pronating their lower legs and bending their hip and knee joints a lot to reduce the radius of gyration, and in the third phase(hitting), they extended their knee joints greatly so that the angle movements of their lower bodies shifted to circle movements. 3. Angular velocity factor In the first phase(preparation), the angular velocity of the hip and knee joints increased. while moving horizontally and rotating the body along the long axis; in the second phase(the minimum angle of the knee joint), the angular velocity increased by bending the hip and knee joints fast to reduce the rotation radios; and in the third phase(hitting), the angular velocity was found to have increased, by rotating the body along the long axis to increase the angular velocity and shifting the angular momentum of the pronated knee joint to the circular momentum.

Determining chlorine injection intensity in water distribution networks: a comparison of backtracking and water age approaches

  • Flavia D. Frederick;Malvin S. Marlim;Doosun Kang
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2023.05a
    • /
    • pp.170-170
    • /
    • 2023
  • Providing safe and readily available water is vital to maintain public health. One of the most prevalent methods to prevent the spread of waterborne diseases is applying chlorine injection to the treated water before distribution. During the water transmission and distribution, the chlorine will experience a reduction, which can imply potential risks for human health if it falls below the minimum threshold. The ability to determine the appropriate initial intensity of chlorine at the source would be significant to prevent such problems. This study proposes two methods that integrate hydraulic and water quality modeling to determine the suitable intensity of chlorine to be injected into the source water to maintain the minimum chlorine concentration (e.g., 0.2 mg/l) at each demand node. The water quality modeling employs the first-order decay to estimate the rate of chlorine reduction in the water. The first method utilizes a backtracking algorithm to trace the path of water from the demand node to the source during each time step, which helps to accurately determine the travel time through each pipe and node and facilitate the computation of time-dependent chlorine decay in the water delivery process. However, as a backtracking algorithm is computationally intensive, this study also explores an alternative approach using a water age. This approach estimates the elapsed time of water delivery from the source to the demand node and calculate the time-dependent reduction of chlorine in the water. Finally, this study compares the outcomes of two approaches and determines the suitable and effective method for calculating the chlorine intensity at the source to maintain the minimum chlorine level at demand nodes.

  • PDF

Time Series Data Cleaning Method Based on Optimized ELM Prediction Constraints

  • Guohui Ding;Yueyi Zhu;Chenyang Li;Jinwei Wang;Ru Wei;Zhaoyu Liu
    • Journal of Information Processing Systems
    • /
    • v.19 no.2
    • /
    • pp.149-163
    • /
    • 2023
  • Affected by external factors, errors in time series data collected by sensors are common. Using the traditional method of constraining the speed change rate to clean the errors can get good performance. However, they are only limited to the data of stable changing speed because of fixed constraint rules. Actually, data with uneven changing speed is common in practice. To solve this problem, an online cleaning algorithm for time series data based on dynamic speed change rate constraints is proposed in this paper. Since time series data usually changes periodically, we use the extreme learning machine to learn the law of speed changes from past data and predict the speed ranges that change over time to detect the data. In order to realize online data repair, a dual-window mechanism is proposed to transform the global optimal into the local optimal, and the traditional minimum change principle and median theorem are applied in the selection of the repair strategy. Aiming at the problem that the repair method based on the minimum change principle cannot correct consecutive abnormal points, through quantitative analysis, it is believed that the repair strategy should be the boundary of the repair candidate set. The experimental results obtained on the dataset show that the method proposed in this paper can get a better repair effect.

Optimum location for the belt truss system for minimum roof displacement of steel buildings subjected to critical excitation

  • Kamgar, Reza;Rahgozar, Peyman
    • Steel and Composite Structures
    • /
    • v.37 no.4
    • /
    • pp.463-479
    • /
    • 2020
  • Currently, there are many lateral resisting systems utilized in resisting lateral loads being produced in an earthquake. Such systems can significantly reduce the roof's displacement when placed at an optimum location. Since in the design of tall buildings, the minimum distance between adjacent buildings is important. In this paper, the critical excitation method is used to determine the best location of the belt truss system while calculating the minimum required distance between two adjacent buildings. For this purpose, the belt truss system is placed at a specific story. Then the critical earthquakes are computed so that the considered constraints are satisfied, and the value of roof displacement is maximized. This procedure is repeated for all stories; i.e., for each, a critical acceleration is computed. From this set of computed roof displacement values, the story with the least displacement is selected as the best location for the belt truss system. Numerical studies demonstrate that absolute roof displacements induced through critical accelerations range between 5.36 to 1.95 times of the San Fernando earthquake for the first example and 7.67 to 1.22 times of the San Fernando earthquake for the second example. This method can also be used to determine the minimum required distance between two adjacent buildings to eliminate the pounding effects. For this purpose, this value is computed based on different standard codes and compared with the results of the critical excitation method to show the ability of the proposed method.