• Title/Summary/Keyword: Multiple constraints

Search Result 533, Processing Time 0.029 seconds

An energy-based vibration model for beam bridges with multiple constraints

  • Huang, Shiping;Zhang, Huijian;Chen, Piaohua;Zhu, Yazhi;Zuazua, Enrique
    • Structural Engineering and Mechanics
    • /
    • v.82 no.1
    • /
    • pp.41-53
    • /
    • 2022
  • We developed an accurate and simple vibration model to calculate the natural frequencies and their corresponding vibration modes for multi-span beam bridges with non-uniform cross-sections. A closed set of characteristic functions of a single-span beam was used to construct the vibration modes of the multi-span bridges, which were considered single-span beams with multiple constraints. To simplify the boundary conditions, the restraints were converted into spring constraints. Then the functional of the total energy has the same form as the penalty method. Compared to the conventional penalty method, the penalty coefficients in the proposed approach can be calculated directly, which can avoid the iteration process and convergence problem. The natural frequencies and corresponding vibration modes were obtained via the minimum total potential energy principle. By using the symmetry of the eigenfunctions or structure, the matrix size can be further reduced, which increases the computational efficiency of the proposed model. The accuracy and efficiency of the proposed approach were validated by the finite element method.

An IMM Approach for Tracking a Maneuvering Target with Kinematic Constraints Based on the Square Root Information Filter

  • Kim, Kyung-Youn;Kim, Joong-Soo
    • Journal of Electrical Engineering and information Science
    • /
    • v.1 no.2
    • /
    • pp.39-44
    • /
    • 1996
  • An efficient interacting multiple mode(IMM) approach for tracking a maneuvering target with kinematic constraints is described based on the square root information filter(SRIF). The SRIF is employed instead of the conventional Kalman filter since it exhibits more efficient features in handling the kinematic constraints and improved numerical characteristics. The kinematic constraints are considered in the filtering process as pseudomeasurements where the degree of uncertainty is represented by the magnitude of the pseudomeasurement noise variance. The Monte Carlo simulations for the constant speed, maneuvering target are provided to demonstrate the improved tracking performance of the proposed algorithm.

  • PDF

SAMBA Type MPSoC Bus Architecture Optimization under Performance Constraints (성능 제약 조건 하에서의 SAMBA 형 MPSoC 버스 구조 최적화)

  • Kim, Hong-Yeom;Jung, Sung-Chul;Shin, Hyun-Chul
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.47 no.1
    • /
    • pp.94-101
    • /
    • 2010
  • Optimization of interconnects among processors and memories becomes important as multiple processors and memories can be integrated on a Multi-Processor System-on-Chip (MPSoC). Since the optimal interconnection architecture is usually dependent on the applications, systematic design methodology for various data transfer requirements is necessary. In this paper, we focus on bus interconnection for MPSoC applications which use 4 ~ 16 processors. We propose a new systematic bus design methodology under performance constraints using Single Arbitration Multiple Bus Accesses (SAMBA) style bus architectures. Optimized bus architecture is found to satisfy performance constraints for a single or multiple applications. When compared to the unoptimized architecture, our method can reduce the bus switch logic circuits significantly (by more than 50% sometimes). Furthermore, low cost bus architectures can be found to satisfy the performance constraints for multiple applications.

Analysis of Acceleration Bounds and Mobility for Multiple Robot Systems Based on Null Space Analysis Method (영 공간 분해 방법을 이용한 다중 협동로봇의 모빌리티와 가속도 조작성 해석)

  • Lee Fill-Youb;Jun Bong-Huan;Lee Ji-Hong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.12 no.5
    • /
    • pp.497-504
    • /
    • 2006
  • This paper presents a new technique that derives the dynamic acceleration bounds of multiple cooperating robot systems from given individual torque limits of robots. A set of linear algebraic homogeneous equation is derived from the dynamic equations of multiple robots with friction contacts. The mobility of the robot system is analyzed by the decomposition of the null space of the linear algebraic equation. The acceleration bounds of multiple robot systems are obtained from the joint torque constraints of robots by the medium of the decomposed null space. As the joint constraints of the robots are given in the infinite norm sense, the resultant acceleration bounds of the systems are described as polytopes. Several case studies are presented to validate the proposed method in this paper.

Discrete Optimization of Tall Steel Frameworks under Multiple Drift Constraints (다중변위 구속조건하에서 고층철골조의 이산형 최적화)

  • 이한주;김호수
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1998.04a
    • /
    • pp.254-261
    • /
    • 1998
  • This study presents a discrete optimization of tall steel buildings under multiple drift constraints using a dual method. Dual method can replace the primary optimization problem with a sequence of approximate explicit subproblems. Since each subproblem is convex and separable, it can be efficiently solved by using a dual formulation. Specifically, this study considers the discrete-optimization problem due to the commercial standard steel sections to select member sizes. The results by the proposed method will be compared with those of the conventional optimality criteria method

  • PDF

MODIFIED SIMULATED ANNEALING ALGORITHM FOR OPTIMIZING LINEAR SCHEDULING PROJECTS WITH MULTIPLE RESOURCE CONSTRAINTS

  • Po-Han Chen;Seyed Mohsen Shahandashti
    • International conference on construction engineering and project management
    • /
    • 2007.03a
    • /
    • pp.777-786
    • /
    • 2007
  • This paper presents a modified simulated annealing algorithm to optimize linear scheduling projects with multiple resource constraints and its effectiveness is verified with a proposed problem. A two-stage solution-finding procedure is used to model the problem. Then the simulated annealing and the modified simulated annealing are compared in the same condition. The comparison results and the reasons of improvement by the modified simulated annealing are presented at the end.

  • PDF

An inequality constraints based method for inverse kinematics of redundant manipulators

  • sung, Young-Whee;Cho, Dong-Kwon;Chung, Myung-Jin
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1993.10b
    • /
    • pp.486-490
    • /
    • 1993
  • In addtion to a basic motion task, redundant manipulators can achieve some additional tasks by optimizing proper performance criteria. Some of performance criteria can be transformed to inequality constraints. So the redundancy resolving problem can be reformulated as a local optimization problem with equality constraints for the end effector and inequality constraints for some performance criteria. In this article, we propose a method for solving the inverse kinematics of a manipulator with redundancy using the Kuhn-Tucker theorem to incorporate inequality constraints. With proper choice of inequality constraints, the proposed method gives a way of optimizing multiple criteria in redundant manipulators.

  • PDF

Using Geometric Constraints for Feature Positioning (특징형상 위치 결정을 위한 형상 구속조건의 이용)

  • Kim, S.H.;Lee, K.W.
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.13 no.9
    • /
    • pp.84-93
    • /
    • 1996
  • This paper describes the development of new feature positioning method which embedded into the top-down assembly modeling system supporting conceptual design. In this work, the user provides the geometric constraints representing the position and size of features, then the system calculates their proper solution. The use of geometric constraints which are easy to understand intuitively enables the user to represent his design intents about geometric shapes, and enables the system to propagate the changes automatically when some editing occurs. To find the proper solution of given constraints, the Selective Solving Method in which the redundant or conflict equations are detected and discarded is devised. The validity of feature shapes satisfying the constraints can be maintained by this technique, and under or over constrained user-defined constraints can also be estimated. The problems such as getting the initial guess, controlling the multiple solutions, and dealing with objects of rotational symmetry are also resolved. Through this work, the feature based modeling system can support more general and convenient modeling method, and keeps the model being valid during modifying models.

  • PDF

Multiple Constrained Optimal Experimental Design

  • Jahng, Myung-Wook;Kim, Young Il
    • Communications for Statistical Applications and Methods
    • /
    • v.9 no.3
    • /
    • pp.619-627
    • /
    • 2002
  • It is unpractical for the optimal design theory based on the given model and assumption to be applied to the real-world experimentation. Particularly, when the experimenter feels it necessary to consider multiple objectives in experimentation, its modified version of optimality criteria is indeed desired. The constrained optimal design is one of many methods developed in this context. But when the number of constraints exceeds two, there always exists a problem in specifying the lower limit for the efficiencies of the constraints because the “infeasible solution” issue arises very quickly. In this paper, we developed a sequential approach to tackle this problem assuming that all the constraints can be ranked in terms of importance. This approach has been applied to the polynomial regression model.

A War-time Engineering Equipment's Assignment and Operation Model (전시 공병장비 할당 및 운용 모형)

  • Jae-Hyeong Lee;Moon-Gul Lee
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.46 no.4
    • /
    • pp.294-303
    • /
    • 2023
  • During wartime, the operation of engineering equipment plays a pivotal role in bolstering the combat prowess of military units. To fully harness this combat potential, it is imperative to provide efficient support precisely when and where it is needed most. While previous research has predominantly focused on optimizing equipment combinations to expedite individual mission performance, our model considers routing challenges encompassing multiple missions and temporal constraints. We implement a comprehensive analysis of potential wartime missions and developed a routing model for the operation of engineering equipment that takes into account multiple missions and their respective time windows of required start and completion time. Our approach focused on two primary objectives: maximizing overall capability and minimizing mission duration, all while adhering to a diverse set of constraints, including mission requirements, equipment availability, geographical locations, and time constraints.