• 제목/요약/키워드: Constraint methods

검색결과 489건 처리시간 0.03초

무선 센서 네트웍에서 에너지 효율적인 집단화를 위한 경험적 백트랙 탐색 알고리즘 (Heuristic Backtrack Search Algorithm for Energy-efficient Clustering in Wireless Sensor Networks)

  • 손석원
    • 한국컴퓨터정보학회논문지
    • /
    • 제13권5호
    • /
    • pp.219-227
    • /
    • 2008
  • 제약만족문제(Constraint Satisfaction Problem)의 연구에서 밝혀졌듯이, 제약최적화 문제(Constraint Optimization Problem)를 효율적으로 풀기 위해서는 변수순서화의 경험적 방법이 매우 중요하다. 이기종이 혼합된 무선 센서 네트웍의 에너지 효율적인 집단화 같은 문제는 클러스터 헤드가 기지국에 가깝게 위치하려는 경향이 있다. 본 논문은 이 집단화 문제를 풀기 위해서 정적 우선순위 변수 순서화에 기반을 둔 새로운 접근방법을 제시하고. pnode 라는 새로운 알고리즘을 제안한다. 이 pnode 알고리즘은 우선순위가 가장 높은 변수를 다음 변수로 선택한다. 집단화문제에 있어서 우선순위가 높다는 것은 클러스터 헤드가 최적지역에 근접하게 된다는 것을 의미하며 이것은 문제의 성격상 미리 정해진다. 클러스터화 된 센서 네트웍에서 클러스터 헤드는 에너지 소비가 가장 많이 일어나는 곳이기 때문에 센서 노드뿐만 아니라 클러스터 헤드에서 발생하는 최대 에너지 소비를 최소화하도록 만드는 방법을 찾는 것이 본 논문의 목적이다. pnode알고리즘을 사용하여 시뮬레이션 한 결과 제안된 방법이 다른 방법들보다 우수함을 알 수 있었다.

  • PDF

New Direct Kinematic Formulation of 6 D.O.F Stewart-Cough Platforms Using the Tetrahedron Approach

  • Song, Se-Kyong;Kwon, Dong-Soo
    • Transactions on Control, Automation and Systems Engineering
    • /
    • 제4권3호
    • /
    • pp.217-223
    • /
    • 2002
  • The paper presents a single constraint equation of the direct kinematic solution of 6-dof (Stewart-Gough) platforms. Many research works have presented a single polynomial of the direct kinematics for several 6-dof platforms. However, the formulation of the polynomial has potential problems such as complicated formulation procedures and discrimination of the actual solution from all roots. This results in heavy computational burden and time-consuming task. Thus, to overcome these problems, we use a new formulation approach, called the Tetrahedron Approach, to easily derive a single constraint equation, not a polynomial one, of the direct kinematics and use two well-known numerical iterative methods to find the solution of the single constraint equation. Their performance and characteristics are investigated through a series of simulation.

구조물의 효율적인 해석을 위한 모델 축소기법 연구 (A Model Reduction Method for Effective Analysis of Structures)

  • 박영창;황재혁
    • 한국항공운항학회지
    • /
    • 제14권1호
    • /
    • pp.28-35
    • /
    • 2006
  • Substructure coupling or component mode synthesis may be employed in the solution of dynamic problems for large, flexible structures. The model is partitioned into several subdomains, and a generalized Craig-Bampton representation is derived. In this paper the mode sets (normal modes, constraint modes) is employed for model reduction. A generalized model reduction procedure is described. Vaious reduction methods that use constraint modes is described in detail. As examples, a flexible structure and a 10 DOF damped system are analyzed. Comparison with a conventional reduction method based on a complete model is made via eigenpair and dynamic responses.

  • PDF

건설 프로젝트 공정표 생성을 위한 사례기반 전문가시스템의 설계

  • 김현우;이경전;이재규
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
    • /
    • pp.709-712
    • /
    • 1996
  • Generating a project network of a specific construction project is very time consuming and difficult task in the field. To effectiviely automate and support the planning process, we design a case-based project planning expert system inspired by the fact a human expert project planner uses previous cases for planning a new project. A construction project case consist of its specific characteristics and the corresponding project network (i.e. project plan). Using frame based representation. we represent the project features affecting the progress network and the entities composing the project plan such as the buildings, construction methods, WBS (work breakdown structure), activities, and resources. The project planning process runs through most similar case retrieval, case adaptation, and user requirement satisfaction. We represent the construction domain knowledge for each procedure using constraints and rules. We develop the methodology for constraint-based case adaption. Case adaptation process mainly consist of activity generation/deletion and predecence constraint satisfaction, for which we develop the dynamic constraint generation method and connect user-level requirement representation the system-level network modification knowledge. The methodology is being applied to the prototype for apartment construction project planning.

  • PDF

여러 개의 목적함수와 운행시간제약을 가진 버스일정계획 (A Bus Scheduling Problem with Multiple Objective Functions and Travel Time Constraint)

  • 김우제
    • 산업공학
    • /
    • 제15권1호
    • /
    • pp.49-54
    • /
    • 2002
  • A bus scheduling problem with multiple objective functions and travel time constraint is to determine the allocation of buses to customer service requests minimizing the number of buses and travel costs under the travel time restriction for each bus. For the scheduling, we first represent the scheduling problem using a graph and develop a hierarchical approach. Second, we develop a mathematical model based algorithm for the scheduling problem including heuristic methods. We tested the performance of the algorithm on instances with real data. As a result, the total number of buses and travel costs are reduced over about 10% comparing with that of current practice at the company.

부 최적화 문제의 근사적인 계산을 통한 신뢰도 최적설계 방범의 효율개선 (Enhancement of Computational Efficiency of Reliability Optimization Method by Approximate Evaluation of Sub-Optimization Problem)

  • 정도현;이병채
    • 대한기계학회논문집A
    • /
    • 제25권10호
    • /
    • pp.1597-1604
    • /
    • 2001
  • Alternative computational scheme is presented fur reliability based optimal design using a modified advanced first order second moment (AFOSH) method. Both design variables and design parameters are considered as random variables about their nominal values. Each probability constraint is transformed into a sub -optimization problem and then is resolved with the modified Hasofer- Lind-Rackwitz-Fiessler (HL-RF) method for computational efficiency and convergence. A method of design sensitivity analysis for probability constraint is presented and tested through simple examples. The suggested method is examined by solving several examples and the results are compared with those of other methods.

Fuzzy Control as Self-Organizing Constraint-Oriented Problem Solving

  • Katai, Osamu;Ida, Masaaki;Sawaragi, Tetsuo;Shimamoto, Kiminori;Iwai, Sosuke
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 1993년도 Fifth International Fuzzy Systems Association World Congress 93
    • /
    • pp.887-890
    • /
    • 1993
  • By introducing the notion of constraint-oriented fuzzy inference, we will show that it provides us ways of fuzzy control methods that has abilities of adaptation, learning and self-organization. The basic supporting techniques behind these abilities are“hard”processing by Artificial Intelligence or traditional computational framework and“soft”processing by Neural Network or Genetic Algorithm techniques. The reason that these techniques can be incorporated to fuzzy control systems is that the notion of“constraint”itself has two fundamental properties, that is, the“modularity”property due to its declarativeness and the“logicality”property due to its two-valuedness. From the former property, the modularity property, decomposing and integrating constraints can be done easily and efficiently, which enables us to carry out the above“soft”processing. From the latter property, the logicality property, Qualitative Reasoning and Instance Generalization by Symbolic Reasoning an be carried out, thus enabling the“hard”processing.

  • PDF

구조물의 효율적인 해석을 위한 모델 축소기법 연구 (A Study on Model Reduction for Effective Analysis of Structure)

  • 박영창;황재혁;오화석
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 2001년도 추계학술대회논문집 II
    • /
    • pp.1370-1375
    • /
    • 2001
  • Substructure coupling or component mode synthesis may be employed in the solution of dynamic problems for structure. The model is partitioned into several subdomains. and a generalized Craig-Bampton representation is derived. In this paper the mode sets(normal modes. constraint modes) have been employed for model reduction. A generalized model reduction procedure has been described. Those reduction methods which adapt constraint modes have been described in detail. As examples. a flexible structure and a 10 DOF damped system are analyzed. Comparison with a conventional reduction method based on a complete model has been made via eigenpairs and dynamic responses.

  • PDF

다목적(多目的) 산지이용(山地利用)을 위한 수리계획법(數理計劃法)의 비교(比較) (Mathematical Programming Approach for the Multiple Forest Land Use -Comparison between STEM and Constraint Method-)

  • 유병일
    • 한국산림과학회지
    • /
    • 제76권4호
    • /
    • pp.361-369
    • /
    • 1987
  • 다목적(多目的) 산지이용(山地利用)은 산지이용(山地利用)의 효율성(效率性)을 제고(提高)하기 위한 경제학(經濟學)의 한 응용분야로서, 외국(外國)에서 임업경영(林業經營)에 널리 사용(使用)하는 기법(技法)이다. 본고(本稿)에서는 다목적(多目的) 경영(經營)을 위해 사용(使用)되는 수리계획법(數理計劃法)의 일종인 STEM과 제약조건법(制約條件法)을 임업분야(林業分野)에 도입 적용하여 가상자료에 의거 이들 방법간(方法間)의 장(長) 단점(短點)을 비교(比較) 검토(檢討)하였다.

  • PDF

Opposition Based Differential Evolution Algorithm for Dynamic Economic Emission Load Dispatch (EELD) with Emission Constraints and Valve Point Effects

  • Thenmalar, K.;Ramesh, S.;Thiruvenkadam, S.
    • Journal of Electrical Engineering and Technology
    • /
    • 제10권4호
    • /
    • pp.1508-1517
    • /
    • 2015
  • Optimal Power dispatch is the short-term decision of the optimal output of a number of power generation facilities, to meet the system demand, with the objective of Power dispatching at the lowest possible cost, subject to transmission lines power loss and operational constraints. The operational constraint includes power balance constraint, generator limit constraint, and emission dispatch constraint and valve point effects. In this paper, Opposition based Differential Evolution Algorithm (ODEA) has been proposed to handle the objective function and the operational constraints simultaneously. Furthermore, the valve point loading effects and transmission lines power loss are also considered for the efficient and effective Power dispatch. The ODEA has unique features such as self tuning of its control parameters, self acceleration and migration for searching. As a result, it requires very minimum executions compared with other searching strategies. The effectiveness of the algorithm has been validated through four standard test cases and compared with previous studies. The proposed method out performs the previous methods.