• Title/Summary/Keyword: Constrained problem

Search Result 646, Processing Time 0.029 seconds

RC structural system control subjected to earthquakes and TMD

  • Jenchung Shao;M. Nasir Noor;P. Ken;Chuho Chang;R. Wang
    • Structural Engineering and Mechanics
    • /
    • v.89 no.2
    • /
    • pp.213-223
    • /
    • 2024
  • This paper proposes a composite design of fuzzy adaptive control scheme based on TMD RC structural system and the gain of two-dimensional fuzzy control is controlled by parameters. Monitoring and learning in LMI then produces performance indicators with a weighting matrix as a function of cost. It allows to control the trade-off between the two efficiencies by adjusting the appropriate weighting matrix. The two-dimensional Boost control model is equivalent to the LMI-constrained multi-objective optimization problem under dual performance criteria. By using the proposed intelligent control model, the fuzzy nonlinear criterion is satisfied. Therefore, the data connection can be further extended. Evaluation of controller performance the proposed controller is compared with other control techniques. This ensures good performance of the control routines used for position and trajectory control in the presence of model uncertainties and external influences. Quantitative verification of the effectiveness of monitoring and control. The purpose of this article is to ensure access to adequate, safe and affordable housing and basic services. Therefore, it is assumed that this goal will be achieved in the near future through the continuous development of artificial intelligence and control theory.

Smart composite repetitive-control design for nonlinear perturbation

  • ZY Chen;Ruei-Yuan Wang;Yahui Meng;Timothy Chen
    • Steel and Composite Structures
    • /
    • v.51 no.5
    • /
    • pp.473-485
    • /
    • 2024
  • This paper proposes a composite form of fuzzy adaptive control plan based on a robust observer. The fuzzy 2D control gains are regulated by the parameters in the LMIs. Then, control and learning performance indices with weight matrices are constructed as the cost functions, which allows the regulation of the trade-off between the two performance by setting appropriate weight matrices. The design of 2D control gains is equivalent to the LMIs-constrained multi-objective optimization problem under dual performance indices. By using this proposed smart tracking design via fuzzy nonlinear criterion, the data link can be further extended. To evaluate the performance of the controller, the proposed controller was compared with other control technologies. This ensures the execution of the control program used to track position and trajectory in the presence of great model uncertainty and external disturbances. The performance of monitoring and control is verified by quantitative analysis. The goals of this paper are towards access to adequate, safe and affordable housing and basic services, promotion of inclusive and sustainable urbanization and participation, implementation of sustainable and disaster-resilient buildings, sustainable human settlement planning and manage. Therefore, the goal is believed to achieved in the near future by the ongoing development of AI and control theory.

Outage Analysis and Optimization for Time Switching-based Two-Way Relaying with Energy Harvesting Relay Node

  • Du, Guanyao;Xiong, Ke;Zhang, Yu;Qiu, Zhengding
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.2
    • /
    • pp.545-563
    • /
    • 2015
  • Energy harvesting (EH) and network coding (NC) have emerged as two promising technologies for future wireless networks. In this paper, we combine them together in a single system and then present a time switching-based network coding relaying (TSNCR) protocol for the two-way relay system, where an energy constrained relay harvests energy from the transmitted radio frequency (RF) signals from two sources, and then helps the two-way relay information exchange between the two sources with the consumption of the harvested energy. To evaluate the system performance, we derive an explicit expression of the outage probability for the proposed TSNCR protocol. In order to explore the system performance limit, we formulate an optimization problem to minimize the system outage probability. Since the problem is non-convex and cannot be directly solved, we design a genetic algorithm (GA)-based optimization algorithm for it. Numerical results validate our theoretical analysis and show that in such an EH two-way relay system, if NC is applied, the system outage probability can be greatly decreased. Moreover, it is shown that the relay position greatly affects the system performance of TSNCR, where relatively worse outage performance is achieved when the relay is placed in the middle of the two sources. This is the first time to observe such a phenomena in EH two-way relay systems.

An Algorithm for the Singly Linearly Constrained Concave Minimization Problem with Upper Convergent Bounded Variables (상한 융합 변수를 갖는 단선형제약 오목함수 최소화 문제의 해법)

  • Oh, Se-Ho
    • Journal of the Korea Convergence Society
    • /
    • v.7 no.5
    • /
    • pp.213-219
    • /
    • 2016
  • This paper presents a branch-and-bound algorithm for solving the concave minimization problem with upper bounded variables whose single constraint is linear. The algorithm uses simplex as partition element. Because the convex envelope which most tightly underestimates the concave function on the simplex is uniquely determined by solving the related linear equations. Every branching process generates two subsimplices one lower dimensional than the candidate simplex by adding 0 and upper bound constraints. Subsequently the feasible points are partitioned into two sets. During the bounding process, the linear programming problems defined over subsimplices are minimized to calculate the lower bound and to update the incumbent. Consequently the simplices which do certainly not contain the global minimum are excluded from consideration. The major advantage of the algorithm is that the subproblems are defined on the one less dimensinal space. It means that the amount of work required for the subproblem decreases whenever the branching occurs. Our approach can be applied to solving the concave minimization problems under knapsack type constraints.

Some Criteria for Optimal Experimental Design at Multiple Extrapolation Points (다중 외삽점에서의 최적 실험설계법을 위한 실험설계기준)

  • Kim, YoungIl;Jang, Dae-Heung
    • The Korean Journal of Applied Statistics
    • /
    • v.27 no.5
    • /
    • pp.693-703
    • /
    • 2014
  • When setting up an experiment for extrapolation at multiple points outside the design space, we often face a difficulty in which point we should emphasize even if the polynomial model under consideration is given. In this paper we propose various methods under two possible scenarios that deal with extrapolations. One considered in this paper is the situation when the model assumed can be extended beyond the design space. In this setting, the many classical methods(including various approaches the authors proposed before) were revisited in the context of extrapolation. But the real problem arises when there is an uncertainty concerning the validity of the assumed model. Therefore, the second scenario is to develop an appropriate procedure when we have limited information about model. Consequently, a hybrid approach is suggested to deal with this issue of how to handle the multiple extrapolating under model uncertainty. A search algorithm was implemented because the classical exchange algorithm was found difficult to handle the complexity of the problem.

Self-Calibration for Direction Finding in Multi-Baseline Interferometer System (멀티베이스라인 인터페로미터 시스템에서의 자체 교정 방향 탐지 방법)

  • Kim, Ji-Tae;Kim, Young-Soo;Kang, Jong-Jin;Lee, Duk-Yung;Roh, Ji-Hyun
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.21 no.4
    • /
    • pp.433-442
    • /
    • 2010
  • In this paper, self-calibration algorithm based on covariance matrix is proposed for compensating amplitude/phase mismatch in multi-baseline interferometer direction finding system. The proposed method is a solution to nonlinear constrained minimization problem which dramatically calibrate mismatch error using space sector concept with cost function as defined in this paper. This method, however, has a drawback that requires an estimated initial angle to determine the proper space sector. It is well known that this type of drawback is common in nonlinear optimization problem. Superior calibration capabilities achieved with this approach are illustrated by simulation experiments in comparison with interferometer algorithm for a varitiety of amplitude/phase mismatch error. Furthermore, this approach has been found to provide an exceptional calibration capabilities even in case amplitude and phase mismatch are more than 30 dB and over $5^{\circ}$, respectively, with sector spacing of less than $50^{\circ}$.

PAPR Reduction in Limited Feedback MIMO Beeamforming OFDM Systems (제한된 되먹임의 송신 빔성형 MIMO OFDM 시스템에서 PAPR 감소 기법)

  • Shin, Joon-Woo;Jeong, Eui-Rim;Lee, Yong-Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.8C
    • /
    • pp.758-766
    • /
    • 2007
  • High peak-to-average power ratio(PAPR) is one of serious problems in the orthogonal frequency division multiplexing(OFDM) systems. This paper proposes a PAPR reduction technique for limited feedback multiple input multiple output(MIMO) OFDM systems. The proposed method is based on the null space of the MIMO channel where a dummy signal is made in the channel's null space and then, subtracted from the original signal to reduce the PAPR. First, we show that a problem occurs when the existing method is directly applied to limited feedback MIMO case. Then, a weight function for the dummy signal is proposed to mitigate the degradation of the receiver performance while still reducing PAPR significantly. The weight function is derived from a constrained nonlinear optimization problem to minimize the mean square error between the received signal and its ideal signal. Simulation results shows that the proposed technique provides about 2.5dB PAPR reduction with 0.2dB bit-error probability loss.

Inverse Perturbation Method and Sensor Location for Structural Damage Detection (구조물의 손상탐지를 위한 역섭동법과 센서위치의 선정)

  • Park, Yun Cheol;Choe, Yeong Jae;Jo, Jin Yeon;Kim, Gi Uk
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.31 no.3
    • /
    • pp.31-38
    • /
    • 2003
  • In the present work, a nonlinear inverse perturbation method which has been used in the structural optimization, is adopted so as to identify the structural damages. Unlike the structural optimization, a larger number of constrained equations than the number of unknown parameters are often required detect structural damage. Therefore, nonlinear least squares method is utilized to solve the problem. Because only a limited number of sensors are available I real situation of damage detection, the determination of sensor location becomes one of the most important issues. Hence, this work concentrates on the issue of sensor placement in the framework of nonlinear inverse perturbation method, and the performances of various methodologies concerning to sensor placement are compared with each other. The comparisons show tat the successive elimination method gets good performance for sensor placement. From the several numerical studies, it is confirmed that the inverse perturbation method, combined with the successive elimination method, is very promising in structural damage detection.

Object Tracking Algorithm Using Weighted Color Centroids Shifting (가중 컬러 중심 이동을 이용한 물체 추적 알고리즘)

  • Choi, Eun-Cheol;Lee, Suk-Ho;Kang, Moon-Gi
    • Journal of Broadcast Engineering
    • /
    • v.15 no.2
    • /
    • pp.236-247
    • /
    • 2010
  • Recently, mean shift tracking algorithms have been proposed which use the information of color histogram together with some spatial information provided by the kernel. In spite of their fast speed, the algorithms are suffer from an inherent instability problem which is due to the use of an isotropic kernel for spatiality and the use of the Bhattacharyya coefficient as a similarity function. In this paper, we analyze how the kernel and the Bhattacharyya coefficient can arouse the instability problem. Based on the analysis, we propose a novel tracking scheme that uses a new representation of the location of the target which is constrained by the color, the area, and the spatiality information of the target in a more stable way than the mean shift algorithm. With this representation, the target localization in the next frame can be achieved by one step computation, which makes the tracking stable, even in difficult situations such as low-rate-frame environment, and partial occlusion.

Location-based Clustering for Skewed-topology Wireless Sensor Networks (편향된 토플로지를 가진 무선센서네트워크를 위한 위치기반 클러스터링)

  • Choi, Hae-Won;Ryu, Myung-Chun;Kim, Sang-Jin
    • Journal of Digital Convergence
    • /
    • v.14 no.1
    • /
    • pp.171-179
    • /
    • 2016
  • The energy consumption problem in wireless sensor networks is investigated. The problem is to expend as little energy as possible receiving and transmitting data, because of constrained battery. In this paper, in order to extend the lifetime of the network, we proposed a location-based clustering algorithm for wireless sensor network with skewed-topology. The proposed algorithm is to deploy multiple child nodes at the sink to avoid bottleneck near the sink and to save energy. Proposed algorithm can reduce control traffic overhead by creating a dynamic cluster. We have evaluated the performance of our clustering algorithm through an analysis and a simulation. We compare our algorithm's performance to the best known centralized algorithm, and demonstrate that it achieves a good performance in terms of the life time.