检索结果-南通市图书馆

Resilient predictive control for a class of uncertain time-delay systems

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2007年第2期18卷 334-340页

作者： Zhang Qunliang xi yugeng Dept. of Automation Shanghai Jiaotong Univ. Shanghai 200240 P.R. China

In practice, gain perturbations of controllers which axe caused by actuator degradation and other reasons often lead to performance degradation. They are capable of violating the closed-loop stability. For a system with constrained inputs, the actual controllers might exceed their limits because of gain perturbations. By the reason, this article considers the problem of resilient predictive control for a class of uncertain time-delay systems. By describing the gain perturbation as a time-varying uncertainty, the sufficient conditions to ensure the closedloop stability and the input constraints are derived. Additionally, an approach to design the resilient predictive controllers is presented in terms of LMI. Finally, the simulation shows that the proposed approach is very effective.

关键词： Gain perturbations Constraints Resilient predictive controllers Stability.

Rolling optimization algorithm based on collision window for single machine scheduling problem

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2005年第4期16卷 816-822页

作者： Wang Changjun xi yugeng Dept. of Automation Shanghai Jiaotong Univ. Shanghai 200030 P. R. China

Focusing on the single machine scheduling problem which minimizes the total completion time in the presence of dynamic job arrivals, a rolling optimization scheduling algorithm is proposed based on the analysis of the character and structure of scheduling. An optimal scheduling strategy in collision window is presented. Performance evaluation of this algorithm is given. Simulation indicates that the proposed algorithm is better than other common heuristic algorithms on both the total performance and stability.

关键词： single machine scheduling rolling scheduling performance analysis heuristic algorithm.

Predictive Control in Fuzzy Dynamic Environment

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2000年第4期11卷 24-29页

作者： Li Shaoyuan xi yugeng Institute of Automation Shanghai Jiaotong University200030P.R.China

This paper investigates the use of fuzzy decision making in predictive control. The use of fuzzy goals and fuzzy constraints in predictive control allows for a more flexible aggregation of the control objectives than the usual weighting sum of squared errors. Compared to the standard quadratic objective function, with the fuzzy decision-making approach, the designer has more freedom in specifying the desired process behavior.

关键词： Fuzzy predictive control Fuzzy goals Fuzzy constraints Optimization.?

Modified bottleneck-based heuristic for large-scale job-shop scheduling problems with a single bottleneck

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2007年第3期18卷 556-565页

作者： Zuo Yan Gu Hanyu xi yugeng Inst. of Automation Shanghai Jiaotong Univ. Shanghai 200240 P. R. China

A modified bottleneck-based （MB） heuristic for large-scale job-shop scheduling problems with a welldefined bottleneck is suggested, which is simpler but more tailored than the shifting bottleneck （SB） procedure. In this algorithm, the bottleneck is first scheduled optimally while the non-bottleneck machines are subordinated around the solutions of the bottleneck schedule by some effective dispatching rules. Computational results indicate that the MB heuristic can achieve a better tradeoff between solution quality and computational time compared to SB procedure for medium-size problems. Furthermore, it can obtain a good solution in a short time for large-scale jobshop scheduling problems.

关键词： job shop scheduling problem bottleneck shifting bottleneck procedure.

Distributed Subgradient Algorithm for Multi-Agent Optimization With Dynamic Stepsize

在线全文

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2021年第8期8卷 1451-1464页

作者： xiaoxing Ren Dewei Li yugeng xi Haibin Shao Department of Automation Shanghai Jiao Tong UniversityShanghai 200240China

In this paper,we consider distributed convex optimization problems on multi-agent *** develop and analyze the distributed gradient method which allows each agent to compute its dynamic stepsize by utilizing the time-varying estimate of the local function value at the global optimal *** approach can be applied to both synchronous and asynchronous communication ***,we propose the distributed subgradient with uncoordinated dynamic stepsizes(DS-UD)algorithm for synchronous protocol and the AsynDGD algorithm for asynchronous *** analysis shows that the proposed algorithms guarantee that all agents reach a consensus on the solution to the multi-agent optimization ***,the proposed approach with dynamic stepsizes eliminates the requirement of diminishing stepsize in existing *** examples of distributed estimation in sensor networks are provided to illustrate the effectiveness of the proposed approach.

关键词： Distributed optimization dynamic stepsize gradient method multi-agent networks

Stabilization and trajectory tracking of autonomous airship's planar motion

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2008年第5期19卷 974-981页

作者： Zhang Yan Qu Weidong xi yugeng Cai Zili Dept. of Automation Shanghai Jiaotong Univ. Shanghai 200240 P. R. China GE (China) Research and Development Center Co. Ltd Shanghai 201203 P. R. China

The stabilization and trajectory tracking problems of autonomous airship＇s planar motion are studied. By defining novel configuration error and velocity error, the dynamics of error systems are derived. By applying Lyapunov stability method, the state feedback control laws are designed and the close-loop error systems are proved to be uniformly asymptotically stable by Matrosov theorem. In particular, the controller does not need knowledge on system parameters in the case of set-point stabilization, which makes the controller robust with respect to parameter uncertainty. Numerical simulations illustrate the effectiveness of the controller designed.

关键词： airship planar motion stabilization trajectory tracking robustness Lyapunov stability Matrosov theorem.

MODIFIED BOTTLENECK-BASED PROCEDURE FOR LARGE-SCALE FLOW-SHOP SCHEDULING PROBLEMS WITH BOTTLENECK

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Mechanical Engineering 2006年第3期19卷 356-361页

作者： ZUO Yan GU Hanyu xi yugeng Institute of Automation Shanghai Jiaotong University Shanghai 200240 China

A new bottleneck-based heuristic for large-scale flow-shop scheduling problems with a bottleneck is proposed, which is simpler but more tailored than the shifting bottleneck （SB） procedure. In this algorithm, a schedule for the bottleneck machine is first constructed optimally and then the non-bottleneck machines are scheduled around the bottleneck schedule by some effective dispatching rules. Computational results show that the modified bottleneck-based procedure can achieve a tradeoff between solution quality and computational time comparing with SB procedure for medium-size problems. Furthermore it can obtain a good solution in quite short time for large-scale scheduling problems.

关键词： Flow-shop scheduling problem Heuristic Bottleneck machine

Deducing Complete Selection Rule Set for Driver Nodes to Guarantee Network’s Structural Controllability

在线全文

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2019年第5期6卷 1152-1165页

作者： xichen Wang yugeng xi Wenzhen Huang Shuai Jia the Department of Automation Shanghai Jiao Tong UniversityKey Laboratory of System Control and Information ProcessingMinistry of Education of ChinaShanghai200240

Structural controllability is critical for operating and controlling large-scale complex networks. In real applications, for a given network, it is always desirable to have more selections for driver nodes which make the network structurally controllable. Different from the works in complex network field where structural controllability is often used to explore the emergence properties of complex networks at a macro level,in this paper, we investigate it for control design purpose at the application level and focus on describing and obtaining the solution space for all selections of driver nodes to guarantee structural controllability. In accord with practical applications,we define the complete selection rule set as the solution space which is composed of a series of selection rules expressed by intuitive algebraic forms. It explicitly indicates which nodes must be controlled and how many nodes need to be controlled in a node set and thus is particularly helpful for freely selecting driver nodes. Based on two algebraic criteria of structural controllability, we separately develop an input-connectivity algorithm and a relevancy algorithm to deduce selection rules for driver nodes. In order to reduce the computational complexity,we propose a pretreatment algorithm to reduce the scale of network's structural matrix efficiently, and a rearrangement algorithm to partition the matrix into several smaller ones. A general procedure is proposed to get the complete selection rule set for driver nodes which guarantee network's structural controllability. Simulation tests with efficiency analysis of the proposed algorithms are given and the result of applying the proposed procedure to some real networks is also shown, and these all indicate the validity of the proposed procedure.

关键词： Algebraic criteria complete selection rule set structural controllability driver nodes

Sewage flow optimization algorithm for large-scale urban sewer networks based on network community division

在线全文

学校读者我要写书评

暂无评论

控制理论与应用（英文版） 2008年第4期6卷 372-378页

作者： Lihui CEN yugeng xi Department of Automation Shanghai Jiao Tong University Shanghai 200240 China

By considering the flow control of urban sewer networks to minimize the electricity consumption of pumping stations, a decomposition-coordination strategy for energy savings based on network community division is developed in this paper. A mathematical model characterizing the steady-state flow of urban sewer networks is first constructed, consisting of a set of algebraic equations with the structure transportation capacities captured as constraints. Since the sewer networks have no apparent natural hierarchical structure in general, it is very difficult to identify the clustered groups. A fast network division approach through calculating the betweenness of each edge is successfully applied to identify the groups and a sewer network with arbitrary configuration could be then decomposed into subnetworks. By integrating the coupling constraints of the subnetworks, the original problem is separated into N optimization subproblems in accordance with the network decomposition. Each subproblem is solved locally and the solutions to the subproblems are coordinated to form an appropriate global solution. Finally, an application to a specified large-scale sewer network is also investigated to demonstrate the validity of the proposed algorithm.

关键词： Large-scale sewer network Betweenness Network community division Decomposition and coordination