• 제목/요약/키워드: division problem

검색결과 2,907건 처리시간 0.028초

Near-OptimaI Collision Avoidance Maneuvers for UAV

  • Han, Su-Cheol;Bang, Hyo-choong
    • International Journal of Aeronautical and Space Sciences
    • /
    • 제5권2호
    • /
    • pp.43-53
    • /
    • 2004
  • Collision avoidance for multiple aircraft can be stated as a problem ofmaintaining safe distance between aircraft in conflict. Optimal collision avoidanceproblem seeks to minimize the given cost function while simultaneously satisfyingconstraints. The cost function could be a function of time or control input. This paper addresses the trajectory time-optimization problem for collision avoidance of unmanned aerial vehicles(UAVs). The problem is difficult to handle in general due to the two-point boundary value problem subject to dynamic environments. Some simplifying aleorithms are used for potential applications in on-line operation.Although under possibility of more complicated problems, a dynamic problem is transformed into a static one by prediction of the conflict time and some appropriate assumptions.

A Study on Job Sequence and Feeder Allocation Problem in PCB Assembly Line (PCB 조립 공정의 작업 투입 순서 및 부품함 배치 문제에 관한 연구)

  • Yu, Sung-Yeol;Lee, Kang-Bae
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • 제29권1호
    • /
    • pp.63-71
    • /
    • 2006
  • In this paper, we consider a planning problem arising from printed circuit board manufacturing industries. Given a set of several types of PCBs, component feeders and surface mounting machines in series in a PCB assembly line, the problem is to define the feeder allocation and job sequence with the objective of minimizing the total operation time of the line. We formulate the problem as a mathematical model. And, the problem is proven to be NP-hard, so a genetic algorithm is developed. Finally, we give test results to evaluate the performance of the genetic algorithm.

Yin-Yang Temperament and Psychopathological Behavior in Middle School Students (중학생에서 음양 기질과 문제 행동의 관련성)

  • Lee, Soo Jin;Han, Sang Yun;Kim, Hee Young;Choi, Mi Hwa;Chae, Han
    • Journal of Oriental Neuropsychiatry
    • /
    • 제28권2호
    • /
    • pp.61-72
    • /
    • 2017
  • Objectives: The Yin-Yang temperament and the Sasang Personality Questionnaire (SPQ) were reported to have relations with psychopathological problems in adolescents. The purpose of this study was to examine how domains of Yin-Yang temperament influence on problem behaviors in Korean middle school students. Methods: Subjects of 681 Korean middle school students completed the SPQ for measuring Yin-Yang temperament and the Youth Self-Report (YSR) for measuring problem behaviors. The differences of problem behaviors between Yin and Yang temperament groups were tested with T-test and profile analysis. The associations of the SPQ subscales on problem behaviors was also examined with Pearson's correlation and regression analysis. Results: Yang temperament was related to the externalizing problem while Yin temperament to the internalizing problem. The Emotionality and Behavior dimension of Yin-Yang temperament were found to be a factor of susceptibility and resilience for problem behaviors, respectively. Three dimensions of Yin-Yang temperament have different influences on externalizing and internalizing problems depending on the sex and Yin-Yang temperament groups of subjects. Conclusions: The Yin-Yang temperament would be useful for predicting and preventing the problem behaviors of middle school students. This study would be useful for screening the psychopathological problems and helping Korean adolescents to develop healthy character.

Evaluation of Two Different ${\kappa}-{\varepsilon}-\overline{{\nu}{\nu}}-f$ Turbulence Models for Natural Convection in a Rectangular Cavity

  • Choi S. K;Kim E. K;Kim S. O
    • 한국전산유체공학회:학술대회논문집
    • /
    • 한국전산유체공학회 2003년도 The Fifth Asian Computational Fluid Dynamics Conference
    • /
    • pp.13-14
    • /
    • 2003
  • Two different ${\kappa}-{\varepsilon}-\overline{{\nu}{\nu}}-f$ turbulence models together with the two-layer model are evaluated for natural convection in a rectangular cavity. The numerical problem and accuracy of the turbulence models are discussed. The original $\overline{{\nu}{\nu}}-f$ model suffers from the numerical stiffness problem when used with the segregate solution procedure like the SIMPLE algorithm, and a remedy for this problem is proposed. It is shown that original $\overline{{\nu}{\nu}}-f$ model best predicts the mean velocity, Reynolds stresses and the turbulent heat flux while the modified $\overline{{\nu}{\nu}}-f$ model (N=6) overpredicts the turbulent quantities.

  • PDF

Performance Evaluation of Genetic Algorithm for Traveling Salesman Problem (외판원문제에 대한 유전알고리즘 성능평가)

  • Kim, Dong-Hun;Kim, Jong-Ryul;Jo, Jung-Bok
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 한국해양정보통신학회 2008년도 추계종합학술대회 B
    • /
    • pp.783-786
    • /
    • 2008
  • 외판원문제(Traveling Salesman problem: TSP)는 전형적인 조합최적화 문제로 위치하는 n개의 모든 지점을 오직 한번씩만 방문하는 순회경로를 결정하는 과정에서 순회비용 또는 순회거리를 최소화한다. 따라서 본 논문에서는 종래의 NP-hard문제로 널리 알려진 TSP를 해결하기 위해서 메타 휴리스틱기법 중에서 가장 널리 이용되고 있는 유전 알고리즘(Genetic Algorithm: GA)을 이용한다. 마지막으로, 유전 알고리즘을 이용해 외판원문제에 적합한 성능을 보이는 유전 연산자를 찾아내기 위해 수치 실험을 통해 그 성능에 대한 평가를 한다.

  • PDF

Dynamic Output-Feedback Receding Horizon H$_{\infty}$ Controller Design

  • Jeong, Seung-Cheol;Moon, Jeong-Hye;Park, Poo-Gyeon
    • International Journal of Control, Automation, and Systems
    • /
    • 제2권4호
    • /
    • pp.475-484
    • /
    • 2004
  • In this paper, we present a dynamic output-feedback receding horizon $H_{\infty}$controller for linear discrete-time systems with disturbance. The controller is obtained numerically from the finite horizon output-feedback $H_{\infty}$optimization problem, which is, in fact, hardly solved analytically. Under a matrix inequality condition on the terminal weighting matrix, the monotonic decreasing property of the cost is shown. This property guarantees both the closed-loop stability and the $H_{\infty}$norm bound. Then, we extend the proposed design method to a reference tracking problem and a problem for time-varying systems. Numerical examples are given to illustrate the performance of the proposed controller.

The Maximin Linear Programming Knapsack Problem With Extended GUB Constraints (확장된 일반상한제약을 갖는 최대최소 선형계획 배낭문제)

  • 원중연
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • 제26권3호
    • /
    • pp.95-104
    • /
    • 2001
  • In this paper, we consider a maximin version of the linear programming knapsack problem with extended generalized upper bound (GUB) constraints. We solve the problem efficiently by exploiting its special structure without transforming it into a standard linear programming problem. We present an O(n$^3$) algorithm for deriving the optimal solution where n is the total number of problem variables. We illustrate a numerical example.

  • PDF

Let's Think about 'POVERTY' in the 21st Century : Using the Q methodology of Subjective Study (21세기, '빈곤'을 생각해보다: 주관성연구, Q방법론을 활용하여)

  • Lee, Doh-Hee;Kim, Gi-Woon
    • Journal of the Korea Convergence Society
    • /
    • 제10권9호
    • /
    • pp.265-272
    • /
    • 2019
  • In this study, 'poverty', which we think in our daily life, started from something. In particular, this study typified the perception of poverty by using the 'Q methodology', a subjective research method, to examine individual subjective opinions. The results of the analysis are as follows. is a "Retraction type", and poverty is a problem of 'Retention', 'Individual Effort Problem', 'Social Structure Problem', 'Low Status' and 'Laziness'. is a "Individual Problem type", and emphasizes 'Individual Effort Problem', 'Laziness', 'Incompetence', 'Starvation' and so on. is a "Basic Problem type", and emphasizes the basic element of life such as 'The Food and Shelter problem', 'Starvation', 'Laziness', and 'No Money'. is a "Resource Distribution Problem Type" that emphasizes the problem of resource allocation according to social structural problems. This study typifies the perception of poverty using subjectivity research method on 21st century and expects converging extension study to empirical studies for generalization.

A Heuristic for parallel Machine Scheduling Depending on Job Characteristics (작업의 특성에 종속되는 병렬기계의 일정계획을 위한 발견적 기법)

  • 이동현;이경근;김재균;박창권;장길상
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • 제17권1호
    • /
    • pp.41-41
    • /
    • 1992
  • In the real world situations that some jobs need be processed only on certain limited machines frequently occur due to the capacity restrictions of machines such as tools fixtures or material handling equipment. In this paper we consider n-job non-preemptive and m parallel machines scheduling problem having two machines group. The objective function is to minimize the sum of earliness and tardiness with different release times and due dates. The problem is formulated as a mixed integer programming problem. The problem is proved to be Np-complete. Thus a heuristic is developed to solve this problem. To illustrate its suitability and efficiency a proposed heuristic is compared with a genetic algorithm and tabu search for a large number of randomly generated test problems in ship engine assembly shop. Through the experimental results it is showed that the proposed algorithm yields good solutions efficiently.