Modeling and Identification of a Class of Servomechanism Systems With Stick-Slip Friction

1988 ◽  
Vol 110 (3) ◽  
pp. 324-328 ◽  
Author(s):  
Ka C. Cheok ◽  
Hongxing Hu ◽  
Nan K. Loh
Keyword(s):  
Nonlinear Optimization ◽  
Optimization Problem ◽  
Optimization Procedure ◽  
Simplex Algorithm ◽  
Identification Algorithm ◽  
Stick Slip ◽  
Process Identification ◽  
Nonlinear Optimization Problem ◽  
System Parameters ◽  
Input Signals

This paper describes a technique for modeling and identifying a class of nonlinear servomechanism systems with stick-slip friction. The physics of the stick-slip friction is considered in modeling the process. Identification of the system parameters is formulated as a nonlinear optimization problem. A modified simplex algorithm is proposed as the optimization procedure. The difficulties encountered in choosing identification algorithm and input signals for the problem are discussed. A simulation example of a servomotor system is provided.

Schedule-Constrained Demand Management in Two-Region Urban Networks

2021 ◽  
Author(s):  
Sakitha Kumarage ◽  
Mehmet Yildirimoglu ◽  
Mohsen Ramezani ◽  
Zuduo Zheng
Keyword(s):  
Nonlinear Optimization ◽  
Optimization Problem ◽  
Time Window ◽  
Demand Management ◽  
Urban Traffic ◽  
Fundamental Diagram ◽  
Constrained System ◽  
Nonlinear Optimization Problem ◽  
Management Platform ◽  
User Compliance

Demand management aiming to optimize system cost while ensuring user compliance in an urban traffic network is a challenging task. This paper introduces a cooperative demand redistribution strategy to optimize network performance through the retiming of departure times within a limited time window. The proposed model minimizes the total time spent in a two-region urban network by incurring minimal disruption to travelers’ departure schedules. Two traffic models based on the macroscopic fundamental diagram (MFD) are jointly implemented to redistribute demand and analyze travelers’ reaction. First, we establish equilibrium conditions via a day-to-day assignment process, which allows travelers to find their preferred departure times. The trip-based MFD model that incorporates individual traveler attributes is implemented in the day-to-day assignment, and it is conjugated with a network-level detour ratio model to incorporate the effect of congestion in individual traveler route choice. This allows us to consider travelers with individual preferences on departure times influenced by desired arrival times, trip lengths, and earliness and lateness costs. Second, we develop a nonlinear optimization problem to minimize the total time spent considering both observed and unobserved demand—that is, travelers opting in and out of the demand management platform. The accumulation-based MFD model that builds on aggregated system representation is implemented as part of the constraints in the nonlinear optimization problem. The results confirm the resourcefulness of the model to address complex two-region traffic dynamics and to increase overall performance by reaching a constrained system optimum scenario while ensuring the applicability at both full and partial user compliance conditions.

scholarly journals Design of SkSP-R Variables Sampling Plans

2015 ◽  
Vol 38 (2) ◽  
pp. 413-429 ◽  
Author(s):  
Muhammad Aslam ◽  
Saminathan Balamurali ◽  
Chi-Hyuck Jun ◽  
Batool Hussain
Keyword(s):  
Nonlinear Optimization ◽  
Optimization Problem ◽  
Sampling Plan ◽  
Producer’S Risk ◽  
Sample Number ◽  
Sampling Plans ◽  
Average Sample Number ◽  
Nonlinear Optimization Problem ◽  
Better Than ◽  
Average Sample

In this paper, we present the designing of the skip-lot sampling plan including the re-inspection  called SkSP-R. The plan parameters of the proposed plan are determined through a  nonlinear optimization problem by minimizing the average sample number satisfying both the producer's risk and the consumer's risks. The proposed plan is shown to perform better than the existing sampling plans in terms of the average sample number. The application of the proposed plan is explained with the help of illustrative examples.

OO-Based STATCOM Installation for Power System Loading Margin Improvement

2013 ◽  
Vol 284-287 ◽  
pp. 1087-1093 ◽  
Author(s):  
Ya Chin Chang ◽  
Rung Fang Chang
Keyword(s):  
Power Systems ◽  
Power System ◽  
Nonlinear Optimization ◽  
Optimization Problem ◽  
Transmission System ◽  
Exact Method ◽  
Ordinal Optimization ◽  
Static Synchronous Compensator ◽  
Nonlinear Optimization Problem ◽  
Voltage Instability

As electricity demands and power transactions continuously increase, it becomes vulnerable to voltage instability for power systems, generally incurred by over-utilized facilities or any contingency. The transmission system loading margin (LM) enhancement problem with Static Synchronous Compensator (STATCOM) installation can be formulated as a mixed discrete-continuous nonlinear optimization problem (MDCP); due to the complexity of the MDCP, the computing burden might be very heavy. In the paper, the proposed ordinal optimization (OO) based STATCOM installation method is applied to the MDCP to solve for good enough solutions rather than the best solution, so as to largely reduce the computation burden. In the method, the crude method is first used to solve the MDCP and, based on OO theory, the exact method is then used to determine the good enough solutions. Finally, the good enough solution, as uses the fewest STATCOM device units for installation and makes the power system able to provide the required LM, is recommended for network reinforcement.

scholarly journals Ultimate Limits for Counterweight Balancing of Crank-Rocker Four-Bar Linkages

2006 ◽  
Vol 128 (6) ◽  
pp. 1272-1284 ◽  
Author(s):  
Bram Demeulenaere ◽  
Erwin Aertbeliën ◽  
Myriam Verschuure ◽  
Jan Swevers ◽  
Joris De Schutter
Keyword(s):  
Nonlinear Optimization ◽  
Optimization Problem ◽  
Design Procedure ◽  
Global Optimum ◽  
Convex Program ◽  
Local Optimum ◽  
Local Optima ◽  
Nonlinear Optimization Problem ◽  
Driving Torque ◽  
Shaking Moment

This paper focuses on reducing the dynamic reactions (shaking force, shaking moment, and driving torque) of planar crank-rocker four-bars through counterweight addition. Determining the counterweight mass parameters constitutes a nonlinear optimization problem, which suffers from local optima. This paper, however, proves that it can be reformulated as a convex program, that is, a nonlinear optimization problem of which any local optimum is also globally optimal. Because of this unique property, it is possible to investigate (and by virtue of the guaranteed global optimum, in fact prove) the ultimate limits of counterweight balancing. In a first example a design procedure is presented that is based on graphically representing the ultimate limits in design charts. A second example illustrates the versatility and power of the convex optimization framework by reformulating an earlier counterweight balancing method as a convex program and providing improved numerical results for it.

Sign in / Sign up

Export Citation Format

Share Document