• Title/Summary/Keyword: Constraint Satisfaction

Search Result 169, Processing Time 0.025 seconds

Trajectory Control for Re-entry Vehicle (재진입비행체의 궤적제어)

  • 박수홍;이대우
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1997.10a
    • /
    • pp.361-364
    • /
    • 1997
  • The re-enty guidance design involves trajectory optimization, generation of a reference drag acceleration profile with the satisfaction of trajectory constraints. This reference drag acceleration profile can be considered as the reference trajectory. This paper proposes the atmospheric re-entry system which is composed of longitudinal, later and range control. This paper shows the a performance of a re-entry guidance and control system using feedback linearization control and predictive control.

  • PDF

Development of a Financial Product Factory System (맞춤형 금융상품 설계시스템의 개발)

  • 최성철;이성하;주정은;구상회
    • Journal of Information Technology Applications and Management
    • /
    • v.10 no.4
    • /
    • pp.119-133
    • /
    • 2003
  • 맞춤형 금융상품 설계시스템(Financial Product Factory System)이란 온라인으로 접근하는 고객의 요구사항을 고려하여 고객에게 가장 적합한 금융상품을 실시간으로 설계하여 제공하는 시스템이다. 최근 들어 인터넷 뱅킹 고객의 수가 급증함에 따라 맞춤형 금융상품 설계시스템의 필요성이 대두되고 있으나, 이러한 시스템의 정의나 성격, 필요 기능, 구축 방안에 대한 연구가 되어 있지 않은 실정이다. 본 연구에서는 맞춤형 금융상품 설계시스템의 정의를 내리고, 이 시스템이 갖추어야 할 요구사항을 시스템과 서비스 측면에서 분석한 후, 이 요구사항을 반영하는 시스템의 아키텍처를 제안ㆍ구현한다

  • PDF

Constraints satisfaction problem기법을 이용한 조종패널 설계방법

  • 박성준;조항준;정의승;장수영
    • Proceedings of the ESK Conference
    • /
    • 1994.04a
    • /
    • pp.75-84
    • /
    • 1994
  • A control panel layout method based on the constraint satisfaction problem(CSP) technique was developed to generate an ergonomically sound panel design. This control panel layout method attempts to incorporate a variety of relevant ergonomic principles and design constrains, and generate an optimal or, at least, a "satisfactory" solution through the efficient search algorithm. The problem of seeking an ergonomically sound panel design should be viewed as a multiple criteria problem, and most of the design objectives should be understood as constraints. Hence, a CSP technique was employed in this study for dealing with the multi-constraiants layout problem. The efficient search algorithm using "preprocess" and "look ahead" procedures was developed to handle the vast amount of computational effort. In order to apply the CSP technique to the panel layout procedure, the ergonomic principles such as spatial compatibility, frequency-of- use, importance, functional grouping, and sequence-of-use were formalized as CSP terms. The effectiveness of the developed panel layout method was evaluated by example problems, and the results clearly showed that the generated layouts took various ergonomic design principles into account.esign principles into account.

  • PDF

A Study on Development of the Aircraft Scheduling System Using ILOG (ILOG를 이용한 항공기 운항 일정계획 시스템 개발에 관한 연구)

  • 윤종준;이장춘;이화기
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.24 no.65
    • /
    • pp.89-102
    • /
    • 2001
  • In this paper, the aircraft route scheduling consists of two steps; the pairing generation and the aircraft assignment. The pairing generation is heuristic approach how flights construct pairings from and to the main base. The aircraft resource assignment which is to establish a aircraft route schedule is constructed by constraint satisfaction problem technique. ILOG solver and schedule is used to solve this problem. In addition, a aircraft route reschedule process against departure-arrival delay or aircraft maintenance schedule change is added by partial constraints satisfaction problem technique. Also, Gantt chart made by ILOG views is used to show aircraft route schedule results more easily.

  • PDF

Ackermann Geometry-based Analysis of NHC Satisfaction of INS for Vehicular Navigation according to IMU Location

  • Cho, Seong Yun;Chae, Myeong Seok
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.11 no.1
    • /
    • pp.29-34
    • /
    • 2022
  • In this paper, we analyze the Non-Holonomic Constraint (NHC) satisfaction of Inertial Navigation System (INS) for vehicular navigation according to Inertial Measurement Unit (IMU) location. In INS-based vehicle navigation, NHC information is widely used to improve INS performance. That is, the error of the INS can be compensated under the condition that the velocity in the body coordinate system of the vehicle occurs only in the forward direction. In this case, the condition that the vehicle's wheels do not slip and the vehicle rotates with the center of the IMU must be satisfied. However, the rotation of the vehicle is rotated by the steering wheel which is controlled based on the Ackermann geometry, where the center of rotation of the vehicle exists outside the vehicle. Due to this, a phenomenon occurs that the NHC is not satisfied depending on the mounting position of the IMU. In this paper, we analyze this problem based on Ackermann geometry and prove the analysis result based on simulation.

Molecular Computing Simulation of Cognitive Anagram Solving (애너그램 문제 인지적 해결과정의 분자컴퓨팅 시뮬레이션)

  • Chun, Hyo-Sun;Lee, Ji-Hoon;Ryu, Je-Hwan;Baek, Christina;Zhang, Byoung-Tak
    • KIISE Transactions on Computing Practices
    • /
    • v.20 no.12
    • /
    • pp.700-705
    • /
    • 2014
  • An anagram is a form of word play to find a new word from a set of given alphabet letters. Good human anagram solvers use the strategy of bigrams. They explore a constraint satisfaction network in parallel and answers consequently pop out quickly. In this paper, we propose a molecular computational algorithm using the same process as this. We encoded letters into DNA sequences and made bigrams and then words by connecting the letter sequences. From letters and bigrams, we performed DNA hybridization, ligation, gel electrophoresis and finally, extraction and separation to extract bigrams. From the matched bigrams and words, we performed the four molecular operations again to distinguish between right and wrong results. Experimental results show that our molecular computer can identify cor rect answers and incorrect answers. Our work shows a new possibility for modeling the cognitive and parallel thinking process of a human.

An Iterative Improvement Search for the Optimal Berth and Crane Scheduling (반복적 개선 탐색을 이용한 최적 선석 및 크레인 일정계획)

  • Hwang Junha
    • Journal of the Korea Society of Computer and Information
    • /
    • v.9 no.4 s.32
    • /
    • pp.117-125
    • /
    • 2004
  • The berth and crane scheduling problem in a container terminal encompasses the whole process of assigning berth to each ship. determining the duration of berthing, assigning container cranes to each ship, and determining the specific start and end time of each crane service, for all the ships scheduled to be arriving at the terminal during a certain scheduling horizon. This problem is basically a constraint satisfaction problem in which all the constraints should be satisfied. However, it is also an optimization problem because the requested arrival and departure time should be met for as many of the scheduled ships as possible. while the operation cost of the terminal should be minimized. In this paper. I present an effective approach to solving this problem, which combines both constraint satisfaction search and iterative improvement search. I test this method on a real world container terminal problem and the results show that the method can produce better results than any other existing method.

  • PDF

A Performance Analysis of AM-SCS-MMA Adaptive Equalization Algorithm based on the Minimum Disturbance Technique (Minimum Disturbance 기법을 적용한 AM-SCS-MMA 적응 등화 알고리즘의 성능 해석)

  • Lim, Seung-Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.3
    • /
    • pp.81-87
    • /
    • 2016
  • This paper analysis the AM-SCS-MMA (Adaptive Modulus-Soft Constraint Satisfaction-MMA) based on the adaptive modulus and minimus-disturbance technique in order to improve the stability and robustness in low signal to noise power of current MMA adaptive equalization algorithm. In AM-SCS-MMA, it updates the filter coefficient applying the adaptive modulus and minimum-disturbance technique of deterministic optimization problem instead of LMS or gradient descend algorithm for obtain the minimize the cost function of adaptive equalization. It is possible to improve the equalizer filter stability, robustness to the various noise characteristic and simultaneous reducing the intersymbol interference due to the amplitude and phase distortion occurred at channel. The computer simulation were performed for confirming the improved performance of SCS-MMA. For these, the output signal constellation of equalizer, residual isi, MSE, EMSE (Excess MSE) which means the channel traking capability and SER which means the robustness were applied. As a result of computer simulation, the AM-SCS-MMA have slow convergence time and less residual quantities after steady state, more good robustness in the poor signal to noise ratio, but poor in channel tracking capabilities was confirmed than MMA.

A Web-based Spatial Layout Planning System with Constraint Satisfaction Problems (웹 환경 하에서의 제약 만족 기법에 의한 공간 계획 시스템)

  • Jung, Jae-Eun;Jeon, Seung-Bum;Jo, Geun-Sik
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.6 no.2
    • /
    • pp.216-224
    • /
    • 2000
  • The spatial layout planning system allocates rectangular resources in the limited space according to user requirements, This system also can optimizes the spatial allocation problem to maximize the user's requirement. The spatial layout planning Problems for this system can be solved by searching a wide area of space since this problem entails the non-polynomial algorithm. By accommodating the user's dynamic requirements, the modification of a specific space and the redesign of the whole area can be accomplished. In this paper, the spatial layout planning problem is solved efficiently with a resource allocation method based on CSP. The dynamic constraints by adding user requirements are accommodated through the intelligent user Interface. The 3-D layout on the web environment by using VRML is also shown for providing for the visual verification of the 2-D layout and, thereafter, the additional modification of the 2-D layout.

  • PDF

A Methodology of Optimal Technology Combination Selection for Developing a Specific Ubiquitous Smart Space (특정 유비쿼터스 지능공간 구축을 위한 기술조합에 대한 최적 선정 방법론)

  • Lee, Yon-Nim;Kwon, Oh-Byung
    • Journal of Intelligence and Information Systems
    • /
    • v.14 no.3
    • /
    • pp.109-131
    • /
    • 2008
  • Ubiquitous Smart Space(USS) like u-City has been expected to create a high added value. However, developing USS has a high risk because it should use future technologies and development methodologies that have been never tried in the past. Hence, it has to be considered thoroughly in the very first stage of development. Moreover, USS usually uses several ubiquitous computing technologies combinationally because of the nature of USS. Despite of this, existing technology selection methodologies or technology evaluation methodologies only focus on a single technology. This leads us to develop a methodology of optimal technology combination for developing a specific USS. The purpose of this paper is to propose the methodology and to apply it to develop a real USS. We use portfolio theory and constraint satisfaction problem to determine an optimal technology combination. We also apply our methodology to the national ubiquitous computing project which carries out at present to validate it.

  • PDF