• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2008년도 학술대회 논문집 정보 및 제어부문
• /
• pp.323-324
• /
• 2008

In this paper, we present performance comparison of two methods to localize multiple robots. One is extended Kalman filter and the other is constraint propagation technique. Extended Kalman filter is conventional probabilistic method which gives the sub-optimal estimation rather than guarantee any boundary for true position of robot. In case of constraint propagation, it can give a boundary containing true robot position value. Especially, we deal with cooperative localization problem in outdoor environment for multiple robots equipped with GPS, gyro meter, wheel encoder. In simulation results, we present strength and weakness for localization methods based on extend Kalman filter and constraint propagation technique.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권7호
• /
• pp.2338-2353
• /
• 2015

In this paper, the optimal power allocation algorithm that minimizes the aggregate bit error rate (BER) of the secondary user (SU) in a downlink orthogonal frequency division multiplexing (OFDM) based cognitive radio (CR) system, while subjecting to the interference power constraint and the transmit power constraint, is investigated under the assumption that the instantaneous channel state information (CSI) of the interference links between the secondary transmitter and the primary receiver, and between the primary transmitter and the secondary receiver is perfectly known. Besides, a suboptimal algorithm with less complexity is also proposed. In order to deal with more practical situations, we further assume that only the channel distribution information (CDI) of the interference links is available and propose heuristic power allocation algorithms based on bisection search method to minimize the aggregate BER under the interference outage constraint and the transmit power constraint. Simulation results are presented to verify the effectiveness of the proposed algorithms.

• 산업경영시스템학회지
• /
• 제25권1호
• /
• pp.1-8
• /
• 2002

The traditional approaches of association rule mining have relied on high support condition to find interesting rules. However, in some application such as analyzing the web page link and discovering some unusual combinations of some factors that have always caused some disease, we are interested in rules with high confidence that have very low support or need not have high support. In these cases, the traditional algorithms are not suitable since it relies on first satisfying high support. In this paper, we propose a new model, CP(Confidence Pattern)-Tree, to identify high confidence rule between 2-items without support constraint. constraint. In addition, we discuss confidence association rule between two more items without support constraint.

• Journal of Advanced Marine Engineering and Technology
• /
• 제33권4호
• /
• pp.539-544
• /
• 2009

The constraint effect $A_2$ has to be evaluated within plastic region near crack tip front using opening displacement. Plastic boundary and stress or strain conditions in the vicinity of the crack tip using recrystallization heat treatment was represented. It was found that the plastic deformation boundary by recrystallization heat treatment method was the true strain of ${\epsilon}t$ = 0.05mm/mm. With the estimation of constraint effects $A_2$, the region of proper displacement measurement point near crack tip was between 0mm and 1mm distance toward direction of crack propagation, and was between 1mm to 3mm distance toward direction of load line.

• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 2011년도 제43차 동계학술발표논문집 19권1호
• /
• pp.59-62
• /
• 2011

A new method is proposed for stereo vision where solution to disparity map is presented in terms of Line constraint and Reliability space -- the first constraint proposes a progressive framework for stereo matching which applies local area pixel-values from corresponding lines in the left and right image pairs. The second states that reliability space based on corresponding points records the disparity and then we are able to apply the median filter in order to reduce the noises which occur in the process. A coarse to fine result is presented after the median filtering, which improves the final result qualitatively. Experiment is evaluated by rectified stereo matching images pairs from Middlebury datasets and has proved that those two adopted strategies yield good matching quantitative results in terms of fast running speed.

• 한국항공우주학회지
• /
• 제40권2호
• /
• pp.101-107
• /
• 2012

본 연구에서는 CFEM을 이용하여 구속조건이 있는 다물체의 운동방정식해석 프로그램을 개발하였다. 다양한 구속조건을 다루기 위하여 7개의 구속모델이 적용되었다. 구속조건으로 보안된 운동방정식은 높은 정확도를 위해 4차의 Runge-Kutta 방법을 사용하여 해석하였다. 다양한 구속조건이 있는 문제에 대하여 개발된 프로그램을 적용하고, 발표된 결과와 비교함으로써 개발 프로그램을 검증하였다.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
• /
• pp.979-986
• /
• 2002

Constraint Programming is an appealing technology for modeling and solving various real-world problems. and metaheuristic is the most successful technique available for solving large real-world vehicle routing problems. Constraint Programming and metaheuristic are complementary to each other. This paper describes how iterative improvement techniques can be used in a Constraint Programming framework(LOG Solver and ILOG Dispatcher) for Vehicle Routing Problem. As local search gets trapped in local solution, the improvement techniques are used in conjunction with metaheuristic method.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -2
• /
• pp.953-956
• /
• 2000

Application specific DSPs often employ irregular datapath structures with distributed registers. In the scheduling phase of retargetable compilation, resolution of register usage conflicts comes to be a new constraint for such datapaths. This paper presents a method of register constraint analysis which attempts to minimize the number of the spill codes required for resolving the register usage conflicts. It searches for a set of ordering restrictions among operations which sequentialize the lifetimes of the values residing in the same register as much as possible and thus minimize the number of the register conflict. Experimental results show that a combination of the proposed register constraint, analysis and list-based scheduling reduces the number of the register spills into 25%.

• 대한전자공학회논문지SP
• /
• 제46권5호
• /
• pp.8-14
• /
• 2009

본 논문에서는, 컴프레시브 센싱(compressive sensing, CS)에서 양자화된 측정을 사용하여 CS 복구(reconstruction)를 하는 경우에 일반화된 양자화 제한(generalized quantization constraint, GQC) 집합을 사용하여 convex 최적화를 수행하는 방법을 제안하였다. 제안한 GQC에서는 기존의 양자화 제한 집합의 크기를 조정할 수 있도록 하였으며, 균일 스칼라 양자기를 사용한 CS 복구의 모의실험을 통하여 m/klogn > 2 인 CS 문제에서, 기존의 QC 방법에 비하여 CS 복구의 에러에서 3.4-3.6dB의 성능 개선을 얻을 수 있었다.

• 대한전기학회논문지:전력기술부문A
• /
• 제53권8호
• /
• pp.484-489
• /
• 2004

When the energy resource available to a particular plant (be it coal, oil, gas, water, or nuclear fuel) is a limiting factor in the operation of the plant, the entire economic dispatch calculation must be done differently. Each economic dispatch calculation must account for what happened before and what will happen in the future. This paper presents a formulation and a solution method for the optimization problem with a fuel constraint in a competitive electricity market. Take-or- Pay (TOP) contract for an energy resource is the typical constraint as a limiting factor. Two approaches are proposed in this paper for modeling the dispatch calculation in a market mechanism. The approaches differ in the subject who considers and inserts the fuel-constraint into its optimization problem. Market operator and each power producer having a TOP contract are assumed as such subjects. The two approaches are compared from the viewpoint of profits. surplus. and social welfare on the basis of Nash Equilibrium.