• Title/Summary/Keyword: bounded control

Search Result 515, Processing Time 0.03 seconds

An Efficient Triangulation Algorithm for Trimmed NURBS Surfaces (트림된 NURBS 곡면의 효율적인 삼각화 알고리즘)

  • 정재호;박준영
    • Korean Journal of Computational Design and Engineering
    • /
    • v.5 no.2
    • /
    • pp.144-154
    • /
    • 2000
  • We propose an algorithm for obtaining a triangular approximation of a trimmed NLRBS surface. Triangular approximation is used in the pre-processing step of many applications such as RP(Rapid Prototyping), NC(Numerical Control) and FEA(Finite Element Analysis), etc. The algorithm minimizes the number of triangular elements within tolerance and generates a valid triangular mesh for STL file and NC tool path generation. In the algorithm, a subdivision method is used. Since a patch is a basic element of triangular mesh creation, boundary curves of a patch are divided into line segments and the division of curves is applied for the interior of the surface. That is, boundary curves are subdivided into line segments and two end points of each line segment are propagated to the interior of the surface. For the case of a trimmed surface, triangulation is carried out using a model space information. The algorithm is superior because the number of elements can be controlled as the curvature of the surface varies and it generates the triangular mesh in a trimmed region efficiently. To verify the efficiency, the algorithm was implemented and tested for several 3D objects bounded by NURBS surfaces.

  • PDF

Design of a direct multivariable neuro-generalised minimum variance self-tuning controller (직접 다변수 뉴로 일반화 최소분산 자기동조 제어기의 설계)

  • 조원철;이인수
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.41 no.4
    • /
    • pp.21-28
    • /
    • 2004
  • This paper presents a direct multivariable self-tuning controller using neural network which adapts to the changing parameters of the higher order multivariable nonlinear system with nonminimum phase behavior, mutual interactions and time delays. The nonlinearities are assumed to be globally bounded, and a multivariable nonlinear system is divided linear part and nonlinear part. The neural network is used to estimate the controller parameters, and the control output is obtained through estimated controller parameter. In order to demonstrate the effectiveness of the proposed algorithm the computer simulation is done to adapt the multivariable nonlinear nonminimm phase system with time delays and changed system parameter after a constant time. The proposed method compared with direct multivariable adaptive controller using neural network.

Fully secure non-monotonic access structure CP-ABE scheme

  • Yang, Dan;Wang, Baocang;Ban, Xuehua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.3
    • /
    • pp.1315-1329
    • /
    • 2018
  • Ciphertext-policy attribute-based encryption (CP-ABE) associates ciphertext with access policies. Only when the user's attributes satisfy the ciphertext's policy, they can be capable to decrypt the ciphertext. Expressivity and security are the two directions for the research of CP-ABE. Most of the existing schemes only consider monotonic access structures are selectively secure, resulting in lower expressivity and lower security. Therefore, fully secure CP-ABE schemes with non-monotonic access structure are desired. In the existing fully secure non-monotonic access structure CP-ABE schemes, the attributes that are set is bounded and a one-use constraint is required by these projects on attributes, and efficiency will be lost. In this paper, to overcome the flaw referred to above, we propose a new fully secure non-monotonic access structure CP-ABE. Our proposition enforces no constraints on the scale of the attributes that are set and permits attributes' unrestricted utilization. Furthermore, the scheme's public parameters are composed of a constant number of group elements. We further compare the performance of our scheme with former non-monotonic access structure ABE schemes. It is shown that our scheme has relatively lower computation cost and stronger security.

A Robust State Feedback Control of Gimbal System with Parametric Uncertainty (불확실성 파라미터를 포함하는 김발시스템의 상태궤환 강인제어기 설계)

  • Jeon, YeongBeom;Choi, WooSeok;Han, JiHoon;Lee, SungWoo;Kang, TaeHa
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.8
    • /
    • pp.140-147
    • /
    • 2015
  • In this paper, we propose a state feedback robust controller of 2-axis gimbal system which have bounded parametric uncertainty. The proposed controller is robust against dynamics variations of gimbal system and contains a dynamic compensator in order to improve a steady state error and a transient response. The stability of the closed-loop system is proved by Lyapunov approach. The performance of the proposed method is demonstrated by simulation on a 2-axis gimbal system.

The Adaptive Backstepping Controller of RBF Neural Network Which is Designed on the Basis of the Error (오차를 기반으로한 RBF 신경회로망 적응 백스테핑 제어기 설계)

  • Kim, Hyun Woo;Yoon, Yook Hyun;Jeong, Jin Han;Park, Jahng Hyon
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.34 no.2
    • /
    • pp.125-131
    • /
    • 2017
  • 2-Axis Pan and Tilt Motion Platform, a complex multivariate non-linear system, may incur any disturbance, thus requiring system controller with robustness against various disturbances. In this study, we designed an adaptive backstepping compensated controller by estimating the disturbance and error using the Radial Basis Function Neural Network (RBF NN). In this process, Uniformly Ultimately Bounded (UUB) was demonstrated via Lyapunov and stability was confirmed. By generating progressive disturbance to the irregular frequency and amplitude changes, it was verified for various environmental disturbances. In addition, by setting the RBF NN input vector to the minimum, the estimated disturbance compensation process was analyzed. Only two input vectors facilitated compensatory function of RBF NN via estimating the modeling and control error values as well as irregular disturbance; the application of the process resulted in improved backstepping controller performance that was confirmed through simulation.

Sliding Mode Controller Design for Biped Robot (이족보행로봇을 위한 슬라이딩 제어기 설계)

  • Park, In-Gyu;Kim, Jin-Geol;Kim, Ki-Sik
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.18 no.5
    • /
    • pp.137-146
    • /
    • 2001
  • A robust controller with the sliding mode is proposed for stable dynamic walking of the biped robot in this paper. For the robot system to be controlled, which is modeled as 14 DOF rigid bodies by the method of multi-body dynamics, the joint angle trajectories are determined by the velocity transformation matrix. Also Hertz force model and Hysteresis damping element are utilized for the ground reaction and impact forces during the contact with the ground. The biped robot system becomes unstable since those forces contain highly confused noise components and some discontinuity, and modeling uncertainties such as parameter inaccuracies. The sliding mode control is applied to solve above problems. Under the assumption of the bounded estimation errors on the unknown parameters, the proposed controller provides a successful way to achieve the stability and good performance in spite of the presence of modeling imprecisions of uncertainties.

  • PDF

Development of a Heuristic Method for Solving a Class of Nonlinear Integer Programs with Application to Redundancy Optimization for the Safely Control System using Multi-processor (비선형정수계획의 새로운 발견적해법의 개발과 고성능 다중프로세서를 이용한 안전관리 시스템의 신뢰도 중복설계의 최적화)

  • 김장욱;김재환;황승옥;박춘일;금상호
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.1 no.2
    • /
    • pp.69-82
    • /
    • 1995
  • This study is concerned with developing a heuristic algorithm for solving a class of ninlinear integer programs(NLIP). Exact algrithm for solving a NLIP either may not exist, or may take an unrealistically large amount of computing time. This study develops a new heuristic, the Excursion Algorithm(EA), for solving a class of NLIP's. It turns out that excursions over a bounded feasible and/or infeasible region is effective in alleviation the risks of being trapped at a lical optimum. The developed EA is applied to the redundancy optimization problems for improving the system safety, and is compared with other existing heuristic methods. We also include simulated annealing(SA) method in the comparision experiment due to ist populatrity for solving complex combinatorial problems. Computational results indicate that the proposed EA performs consistently better than the other in terms of solution quality, with moderate increase in computing time. Therefore, the proposed EA is believed to be an attractive alternative to other heuristic methods.

  • PDF

M_CSPF: A Scalable CSPF Routing Scheme with Multiple QoS Constraints for MPLS Traffic Engineering

  • Hong, Daniel W.;Hong, Choong-Seon;Lee, Gil-Haeng
    • ETRI Journal
    • /
    • v.27 no.6
    • /
    • pp.733-746
    • /
    • 2005
  • In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

  • PDF

Extension of ReInForM Protocol for (m,k)-firm Real-time Streams in Wireless Sensor Networks

  • Li, Bijun;Kim, Ki-Il
    • Journal of information and communication convergence engineering
    • /
    • v.10 no.3
    • /
    • pp.231-236
    • /
    • 2012
  • For real-time wireless sensor network applications, it is essential to provide different levels of quality of service (QoS) such as reliability, low latency, and fault-tolerant traffic control. To meet these requirements, an (m,k)-firm based real-time routing protocol has been proposed in our prior work, including a novel local transmission status indicator called local DBP (L_DBP). In this paper, a fault recovery scheme for (m,k)-firm real-time streams is proposed to improve the performance of our prior work, by contributing a delay-aware forwarding candidates selection algorithm for providing restricted redundancy of packets on multipath with bounded delay in case of transmission failure. Each node can utilize the evaluated stream DBP (G_DBP) and L_DBP values as well as the deadline information of packets to dynamically define the forwarding candidate set. Simulation results show that for real-time service, it is possible to achieve both reliability and timeliness in the fault recovery process, which consequently avoids dynamic failure and guarantees meeting the end-to-end QoS requirement.

Performance Analysis of a Cellular Mobile Communication System with Hybrid Guard Channels (Hybrid 가드채널이 있는 이동통신시스템이 성능 평가)

  • Hong, Sung-Jo;Choi, Jin-Yeong
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.29 no.4
    • /
    • pp.100-106
    • /
    • 2006
  • We analyze a voice/data integrated traffic model of the cellular mobile communication system with hybrid guard channels for voice and handoff calls. In a multi-service integrated wireless environment, quality of service guarantee is crucial for smooth transportation of real time information. Real time voice traffic requires a guaranteed upper bounded on both delay and packet error rate, whereas data traffic does not. Voice traffic has high transmission priority over data packets. Thus one of the important problems is the design of admission control schemes which can efficiently accommodate the differential quality of service requirements. In this paper, a hybrid guard channel scheme is considered in which arriving calls are assigned channels as long as the number of busy channels in the cell is below a predetermined first threshold. When the number of busy channels reaches the first threshold, new originating data calls are queued in the infinite data buffer. Then reaches second threshold, only handoff calls are assigned the remaining channels and new originating voice calls are blocked. We evaluate the system by a two-dimensional Markov chain approach and generating function method and obtain performance measures included blocking probability and forced termination probability.