• Title/Summary/Keyword: Curvature Constraints

Search Result 39, Processing Time 0.026 seconds

Hull Fairing by Modified Direct Curvature Manipulation Method (개선된 직접 곡률 조작법을 이용한 선형의 순정)

  • Yoon, Tae-Kyeong;Kim, Dong-Joon
    • Journal of Ocean Engineering and Technology
    • /
    • v.13 no.4 s.35
    • /
    • pp.169-173
    • /
    • 1999
  • In this paper some modifications for Lu's inverse method of fairing process are presented. The object function is changed and additional constraints for hull curve foiling is proposed. The newly introduced minimizing object function is the sum of the distances between the two curve's positions at the same parameter values instead of the sum of the distances between two vertices. The new one is better to represent the physical meaning of the object function, the smaller differences between two curves. In ship hull fairing the end tangent of curve has to be fined in some cases, so the additional constraint is considered to preserve the direction of end tangent. The sample results are shown.

  • PDF

Real time trajectory control for two wheeled mobile robot under dynamic environments

  • Lee, Jin-Woo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.120.4-120
    • /
    • 2001
  • In this paper, a method of generating trajectories in real time for a mobile robot in a dynamic environment is proposed. Specifically, this method is focused on soccer-playing robots that need to calculate trajectories in real time, which are constantly subject to rapidly change as targets and obstacles move. The robots also should move at the fastest available speed, while tracking the generated trajectories. The method proposed in this paper solves the geometric problem of finding a smooth curve that joins two endpoints. To have this solved, we assign five constraints to each endpoint, which are the usual x, y, theta, and curvature as well as the influence of the initial robot velocity on the path. With these five constraints, the path generated can always be physically followed by robot. Through this method, the travel time of the robot over the entire path can b optimized. Therefore it can ...

  • PDF

Constraining Cosmological Parameters with Gravitational Lensed Quasars in the Sloan Digital Sky Survey

  • Han, Du-Hwan;Park, Myeong-Gu
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.39 no.1
    • /
    • pp.34-34
    • /
    • 2014
  • We investigate the constraints on the matter density ${\Omega}m$ and the cosmological constant ${\Omega}{\Lambda}$ using the gravitational lensed QSO (Quasi Stellar Object) systems from the Sloan Digital Sky Survey (SDSS) by analyzing the distribution of image separation. The main sample consists of 16 QSO lens systems with measured source and lens redshifts. We use a lensing probability that is simply defined by the gaussian distribution. We perform the curvature test and the constraints on the cosmological parameters as the statistical tests. The statistical tests have considered well-defined selection effects and adopt parameter of velocity dispersion function. We also applied the same analysis to Monte-Carlo generated mock gravitational lens samples to assess the accuracy and limit of our approach. As the results of these statistical tests, we find that only the excessively positively curved universe (${\Omega}m+{\Omega}{\Lambda}$ > 1) are rejected at 95% confidence level. However, if the informations of the galaxy as play a lens are measured accurately, we confirm that the gravitational lensing statistics would be the most powerful tool.

  • PDF

Path Planning of the Low Altitude Flight Unmanned Aerial Vehicle for the Neutralization of the Enemy Firepower (대화력전 임무수행을 위한 저고도 비행 무인공격기의 경로계획)

  • Yang, Kwang-Jin;Kim, Si-Tai;Jung, Dae-Han
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.15 no.4
    • /
    • pp.424-434
    • /
    • 2012
  • This paper presents a path planning algorithm of the unmanned aerial vehicle for the neutralization of the enemy firepower. The long range firepower of the ememy is usually located at the rear side of the mountain which is difficult to bomb. The path planner not only consider the differential constraints of the Unmanned Aerial Vehicle (UAV) but also consider the final approaching angle constraint. This problem is easily solved by incorporating the analytical upper bounded continuous curvature path smoothing algorithm into the Rapidly Exploring Random Tree (RRT) planner. The proposed algorithm can build a feasible path satisfying the kinematic constraints of the UAV on the fly. In addition, the curvatures of the path are continuous over the whole path. Simulation results show that the proposed algorithm can generate a feasible path of the UAV for the bombing mission regardless of the posture of the tunnel.

A Study on the Optimum Design of Railway Vehicle Suspension Characteristics (철도차량 현가특성의 최적설계에 관한 연구)

  • 조동현;임진수
    • Journal of the Korean Society for Railway
    • /
    • v.2 no.2
    • /
    • pp.6-12
    • /
    • 1999
  • In this study, the most important suspension characteristics of railway vehicle, such as primary and secondary stiffness, are optimized to maximize ride qualify. Critical speed, secondary suspension stroke oil tangent track and derailment coefficient on the maximum curvature, are selected as the performance constraints. Piecewise linear curving model is used to evaluate derailment coefficient where it is assumed that wheel/rail contacts occurs at tread or at idealized flange. The combined design procedure is used to optimize above design variables at the same time.

  • PDF

ASTE receiver optics design using ultra wideband corrugated horn at combined ALMA band 7 and band 8 frequencies

  • Lee, Bangwon;Lee, Jung-won;Gonzalez, Alvaro
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.42 no.2
    • /
    • pp.57.3-58
    • /
    • 2017
  • We report the detailed design of an unprecedented wideband(band7+8) corrugated feed horn in ASTE focal plane array aiming for future ALMA receiver. We have found that such design constraints as return loss, cross-polarization level, beam width and phase curvature can be controlled by optimizing critical corrugation parameters at the throat and flare region of the horn. The success of optimization manifest itself through simulated aperture effciency over 80 % at the entire frequency range. Physical implications of the resulting corrugation parameters are discussed.

  • PDF

Feature Points Tracking of Digital Image By One-Directional Iterating Layer Snake Model (일방향 순차층위 스네이크 모델에 의한 디지털영상의 특징점 추적)

  • Hwang, Jung-Won;Hwang, Jae-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.4 s.316
    • /
    • pp.86-92
    • /
    • 2007
  • A discrete dynamic model for tracking feature points in 2D images is developed. Conventional snake approaches deform a contour to lock onto features of interest within an image by finding a minimum of its energy functional, composed of internal and external forces. The neighborhood around center snaxel is a space matrix, typically rectangular. The structure of the model proposed in this paper is a set of connected vertices. Energy model is designed for its local minima to comprise the set of alternative solutions available to active process. Block on tracking is one dimension, line type. Initial starting points are defined to the satisfaction of indent states, which is then automatically modified by an energy minimizing process. The track is influenced by curvature constraints, ascent/descent or upper/lower points. The advantages and effectiveness of this layer approach may also be applied to feature points tracking of digital image whose pixels have one directional properties with high autocorrelation between adjacent data lines, vertically or horizontally. The test image is the ultrasonic carotid artery image of human body, and we have verified its effect on intima/adventitia starting points tracking.

CONSTRAINING COSMOLOGICAL PARAMETERS WITH IMAGE SEPARATION STATISTICS OF GRAVITATIONALLY LENSED SDSS QUASARS: MEAN IMAGE SEPARATION AND LIKELIHOOD INCORPORATING LENS GALAXY BRIGHTNESS

  • Han, Du-Hwan;Park, Myeong-Gu
    • Journal of The Korean Astronomical Society
    • /
    • v.48 no.1
    • /
    • pp.83-92
    • /
    • 2015
  • Recent large scale surveys such as Sloan Digital Sky Survey have produced homogeneous samples of multiple-image gravitationally lensed quasars with well-defined selection effects. Statistical analysis on these can yield independent constraints on cosmological parameters. Here we use the image separation statistics of lensed quasars from Sloan Digital Sky Survey Quasar Lens Search (SQLS) to derive constraints on cosmological parameters. Our analysis does not require knowledge of the magnification bias, which can only be estimated from the detailed knowledge on the quasar luminosity function at all redshifts, and includes the consideration for the bias against small image separation quasars due to selection against faint lens galaxy in the follow-up observations for confirmation. We first use the mean image separation of the lensed quasars as a function of redshift to find that cosmological models with extreme curvature are inconsistent with observed lensed quasars. We then apply the maximum likelihood test to the statistical sample of 16 lensed quasars that have both measured redshift and magnitude of lens galaxy. The likelihood incorporates the probability that the observed image separation is realized given the luminosity of the lens galaxy in the same manner as Im et al. (1997). We find that the 95% confidence range for the cosmological constant (i.e., the vacuum energy density) is $0.72{\leq}{\Omega}_{\Lambda}{\leq}1.0$ for a flat universe. We also find that the equation of state parameter can be consistent with -1 as long as the matter density ${\Omega}_m{\leq}0.4$ (95% confidence range). We conclude that the image separation statistics incorporating the brightness of lens galaxies can provide robust constraints on the cosmological parameters.

Run-time comparison of Tilting train with Non-tilting train on the Jungang-line between Cheongnyangni and Youngju (일반 EMU열차와 틸팅 EMU열차의 운전시간 비교: 중앙선 청량리~영주 구간)

  • Rho, Hag-Lae
    • Proceedings of the KSR Conference
    • /
    • 2011.10a
    • /
    • pp.1227-1234
    • /
    • 2011
  • Korea is a mountainous country, with as much as 70% of the area is covered by hills and mountains. This geography places constraints on the minimum radius of curvature for the rail network. It was expected that the speed of trains could be enhanced on the existing railway network without a huge investment in infrastructure by using tilting trains. The development of tilting trains in Korea started in 2001 as research & development project. A 6-car prototype test tilting train, called the Tilting Train eXpress (TTX), was built in December 2006 and experimental trials began in 2007. TTX has distributed power, is designed to run at 200 km/h, and has a planned service speed of 180 km/h. In this paper, we first describe the performance of tilting train, and then present the estimated running times, and the time saving compared with today's conventional trains and non-tilting trains, based on the Jungang line. So the time saving could be separated into two effects by higher track top-speed and tilting devices.

  • PDF

Analytic and Discrete Fairing of 3D NURBS Curves (3D NURBS 곡선의 해석적 및 이산적 순정)

  • 홍충성;홍석용;이현찬
    • Korean Journal of Computational Design and Engineering
    • /
    • v.4 no.2
    • /
    • pp.127-138
    • /
    • 1999
  • For reverse engineering, curves and surfaces are modeled for new products by interpolating the digitized data points. But there are many measuring or deviation errors. Therefore, it is important to handle errors during the curve or surface modeling. If the errors are ignored, designer could get undesirable results. For this reason, fairing procedure with the aesthetics criteria is necessary in computer modeling. This paper presents methods of 3D NURBS curve fairing. The techniques are based on automatic repositioning of the digitized dat points or the NURBS curve control points by a constrained nonlinear optimization algorithm. The objective function is derived variously by derived curved. Constraints are distance measures between the original and the modified digitized data points. Changes I curve shape are analyzed by illustrations of curve shapes, and continuous plotting of curvature and torsion.

  • PDF