• Title/Summary/Keyword: Hamiltonian system

Search Result 68, Processing Time 0.024 seconds

A semi-active stochastic optimal control strategy for nonlinear structural systems with MR dampers

  • Ying, Z.G.;Ni, Y.Q.;Ko, J.M.
    • Smart Structures and Systems
    • /
    • v.5 no.1
    • /
    • pp.69-79
    • /
    • 2009
  • A non-clipped semi-active stochastic optimal control strategy for nonlinear structural systems with MR dampers is developed based on the stochastic averaging method and stochastic dynamical programming principle. A nonlinear stochastic control structure is first modeled as a semi-actively controlled, stochastically excited and dissipated Hamiltonian system. The control force of an MR damper is separated into passive and semi-active parts. The passive control force components, coupled in structural mode space, are incorporated in the drift coefficients by directly using the stochastic averaging method. Then the stochastic dynamical programming principle is applied to establish a dynamical programming equation, from which the semi-active optimal control law is determined and implementable by MR dampers without clipping in terms of the Bingham model. Under the condition on the control performance function given in section 3, the expressions of nonlinear and linear non-clipped semi-active optimal control force components are obtained as well as the non-clipped semi-active LQG control force, and thus the value function and semi-active nonlinear optimal control force are actually existent according to the developed strategy. An example of the controlled stochastic hysteretic column is given to illustrate the application and effectiveness of the developed semi-active optimal control strategy.

Study of the dynamic behavior of porous functionally graded suspension structural systems using finite elements method

  • Ayman E., Nabawy;Ayman M.M., Abdelhaleem;Soliman. S., Alieldin;Alaa A., Abdelrahman
    • Steel and Composite Structures
    • /
    • v.45 no.5
    • /
    • pp.697-713
    • /
    • 2022
  • In the context of the finite elements method, the dynamic behavior of porous functionally graded double wishbone vehicle suspension structural system incorporating joints flexibility constraints under road bump excitation is studied and analyzed. The functionally graded material properties distribution through the thickness direction is simulated by the power law including the porosity effect. To explore the porosity effects, both classical and adopted porosity models are considered based on even porosity distribution pattern. The dynamic equations of motion are derived based on the Hamiltonian principle. Closed forms of the inertia and material stiffness components are derived. Based on the plane frame isoparametric Timoshenko beam element, the dynamic finite elements equations are developed incorporating joint flexibilities constraints. The Newmark's implicit direct integration methodology is utilized to obtain the transient vibration time response under road bump excitation. The presented procedure is validated by comparing the computational model results with the available numerical solutions and an excellent agreement is observed. Obtained results show that the decrease of porosity percentage and material graduation tends to decrease the deflection as well as the resulting stresses of the control arms thus improving the dynamic performance and increasing the service lifetime of the control arms.

The Numerical Solution of Time-Optimal Control Problems by Davidenoko's Method (Davidenko법에 의한 시간최적 제어문제의 수치해석해)

  • Yoon, Joong-sun
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.12 no.5
    • /
    • pp.57-68
    • /
    • 1995
  • A general procedure for the numerical solution of coupled, nonlinear, differential two-point boundary-value problems, solutions of which are crucial to the controller design, has been developed and demonstrated. A fixed-end-points, free-terminal-time, optimal-control problem, which is derived from Pontryagin's Maximum Principle, is solved by an extension of Davidenko's method, a differential form of Newton's method, for algebraic root finding. By a discretization process like finite differences, the differential equations are converted to a nonlinear algebraic system. Davidenko's method reconverts this into a pseudo-time-dependent set of implicitly coupled ODEs suitable for solution by modern, high-performance solvers. Another important advantage of Davidenko's method related to the time-optimal problem is that the terminal time can be computed by treating this unkown as an additional variable and sup- plying the Hamiltonian at the terminal time as an additional equation. Davidenko's method uas used to produce optimal trajectories of a single-degree-of-freedom problem. This numerical method provides switching times for open-loop control, minimized terminal time and optimal input torque sequences. This numerical technique could easily be adapted to the multi-point boundary-value problems.

  • PDF

All-port Broadcasting Algorithms on Wormhole Routed Star Graph Networks (웜홀 라우팅을 지원하는 스타그래프 네트워크에서 전 포트 브로드캐스팅 알고리즘)

  • Kim, Cha-Young;Lee, Sang-Kyu;Lee, Ju-Young
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.2
    • /
    • pp.65-74
    • /
    • 2002
  • Recently star networks are considered as attractive alternatives to the widely used hypercube for interconnection networks in parallel processing systems by many researchers. One of the fundamental communication problems on star graph networks is broadcasing In this paper we consider the broadcasting problems in star graph networks using wormhole routing. In wormhole routed system minimizing link contention is more critical for the system performance than the distance between two communicating nodes. We use Hamiltonian paths in star graph to set up link-disjoint communication paths We present a broadcast algorithm in n-dimensional star graph of N(=n!) nodes such that the total completion time is no larger than $([long_n n!]+1)$ steps where $([long_n n!]+1)$ is the lower bound This result is significant improvement over the previous n-1 step broadcasting algorithm.

CCTV-Aided Accident Detection System on Four Lane Highway with Calogero-Moser System (칼로게로 모제 시스템을 활용한 4차선 도로의 사고검지 폐쇄회로 카메라 시스템)

  • Lee, In Jeong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.3
    • /
    • pp.255-263
    • /
    • 2014
  • Today, a number of CCTV on the highway is to observe the flow of traffics. There have been a number of studies where traffic data (e.g., the speed of vehicles and the amount of traffic on the road) are transferred back to the centralized server so that an appropriate action can be taken. This paper introduces a system that detects the changes of traffic flows caused by an accident or unexpected stopping (i.e., vehicle remains idle) by monitoring each lane separately. The traffic flows of each lane are level spacing curve that shows Wigner distribution for location vector. Applying calogero-moser system and Hamiltonian system, probability equation for each level-spacing curve is derived. The high level of modification of the signal means that the lane is in accident situation. This is different from previous studies in that it does more than looking for the signal from only one lane, now it is able to detect an accident in entire flow of traffic. In process of monitoring traffic flow of each lane, when camera recognizes a shadow of vehicle as a vehicle, it will affect the accident detecting capability. To prevent this from happening, the study introduces how to get rid of such shadow. The system using Basian network method is being compared for capability evaluation of the system of the study. As a result, the system of the study appeared to be better in performance in detecting the modification of traffic flow caused by idle vehicle.

Minimum Design of Fault-Tolerant Arrangement Graph for Distributed &Parallel System (분산/병렬 시스템을 위한 최소화의 오류-허용 방사형 그래프 설계)

  • Jun, Moon-Seog;Lee, Moon-Gu
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.12
    • /
    • pp.3088-3098
    • /
    • 1998
  • The arrangement graph, which is a viable interconnection scheme for parallel and distributed systems, has been proposed as an attactive altemative to the n-cube. However, A fault tolerant design model which is well suitable for the arrangement graph doesn't has been proposd until recently, but fault tolerant design modelsfor many schemes have been proposed ina large number of paper. So, our paper presents a new fault tolerant design technique suited for the arrangement graph. To maintains the previous structures when it ocurs a fault in the current processing, the scheme properly sugbstitutes a fault-componnent into the existing structures by adding a spare component. the first of all, it converts arrangement graph into a circulant graph using the hamiltonian property and then uses automorphism of circulant graph to tolerate faults. Also, We optimize the cost of rate fault tolerant architectures by adding exactly k spare processor while tolerating up to k processor and minimizing the maximum number of limks per processor. Specially, we proposes a new techniue to minimize the maximum number of links.

  • PDF

Magneto-optical Properties of 55Mn-doped SrTiO3 Single Crystal (55Mn이 첨가된 SrTiO3 단 결정의 광 전이 특성연구)

  • Bae, Kyu-Chan;Park, Jung-Il;Lee, Hyeong-Rag
    • Journal of the Korean Magnetics Society
    • /
    • v.21 no.6
    • /
    • pp.208-213
    • /
    • 2011
  • We calculated the EPR (electron paramagnetic resonance) line-shape function. The line-widths of a -doped single crystal was studied as a function of the temperature with 0.5 and 2 at. at a frequency of (X-band). The line-width decreases with increasing temperature, such temperature behavior of the line-width can indicate a motional narrowing of the spectrum, when impurity ions substitute for host ions in an off-center position, and thus there can be fast jumping of dipoles between several symmetrically equivalent configurations. Therefore, the present technique is considered to be more convenient to explain the resonant system as in the case of other optical transition problems.

An Analysis of the Secret Routing Algorithm for Secure Communications (안전한 통신을 위한 비밀 경로 알고리즘의 분석)

  • Yongkeun Bae;Ilyong Chung
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.7 no.3
    • /
    • pp.105-116
    • /
    • 1997
  • Routing security is related to the confidentiality of the route taken by the data transmitted over the network. If the route is detected by the adversary, the probability is higher that the data are lost or the data can be intercepted by the adversary. Therefore, the route must be protected. To accomplish this, we select an intermediate node secretly and transmit the data using this intermediate node, instead of sending the data to the destination node using the shortest path. Furthermore, if we use a number of secret routes from the starting node to the destination node, data security is much stronger since we can transmit partial data rather than the entire data along a secret route. In this paper, the routing algorithm for multiple secret paths on MRNS(Mixed Radix Number System) Network, which requires O(1) for the time complexity where is the number of links on a node, is presented employing the HCLS(Hamiltonian Circuit Latin Square) and is analyzed in terms of entropy.