|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Modified bottleneck-based heuristic for large-scale job-shop scheduling problems with a single bottleneck显示文摘A modified bottleneck-based (MB) heuristic for large-scale job-shop scheduling problems with a well- defined 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 job- shop scheduling problems. | Zuo Yan Gu Hanyu Xi Yugeng | 2007 | Journal of Systems Engineering and Electronics2007，18，3： | 20 |
| 2 | Stabilization and trajectory tracking of autonomous airship's planar motion显示文摘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. | Zhang Yan Qu Weidong Xi Yugeng Cai Zili | 2008 | Journal of Systems Engineering and Electronics2008，19，5： | 6 |
| 3 | Quality guaranteed aggregation based model predictive control and stability analysis显示文摘The input aggregation strategy can reduce the online computational burden of the model predictive controller. But generally aggregation based MPC controller may lead to poor control quality. Therefore,a new concept,equivalent aggregation,is proposed to guarantee the control quality of aggregation based MPC. From the general framework of input linear aggregation,the design methods of equivalent aggregation are developed for unconstrained and terminal zero constrained MPC,which guarantee the actual control inputs exactly to be equal to that of the original MPC. For constrained MPC,quasi-equivalent aggregation strategies are also discussed,aiming to make the difference between the control inputs of aggregation based MPC and original MPC as small as possible. The stability conditions are given for the quasi-equivalent aggregation based MPC as well. | LI DeWei XI YuGeng | 2009 | Science in China(Series F)2009，52，7： | 6 |
| 4 | Reinforcement learning with actor-critic for knowledge graph reasoning显示文摘Dear editor,In recent years,with the development of artificial intelligence and deep learning techniques,knowledge graph(KG)is receiving unprecedented attention.Essentially,KG is a semantic network,which stores massive information structured as entityrelation pairs in a graphical model. | Linli ZHANG Dewei LI Yugeng XI Shuai JIA | 2020 | Science China(Information Sciences)2020，63，6： | 4 |
| 5 | Computationally Efficient Aggregation Optimization Strategy of Model Predictive Control显示文摘Model Predictive Control (MPC) is a popular technique and has been successfully used in various industrial applications. However, the big drawback of MPC involved in the formidable on line computational effort limits its applicability to relatively slow and/or small processes with a moderate number of inputs. This paper develops an aggregation optimization strategy for MPC that can improve the computational efficiency of MPC. For the regulation problem, an input decaying aggregation optimization algorithm is presented by aggregating all the original optimized variables on control horizon with the decaying sequence in respect of the current control action. | 杜晓宁 Xi Yugeng Li Shaoyuan | 2002 | High Technology Letters2002，8，2： | 4 |
| 6 | Rolling optimization algorithm based on collision window for single machine scheduling problem显示文摘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. | Wang Changjun Xi Yugeng | 2005 | Journal of Systems Engineering and Electronics2005，16，4： | 4 |
| 7 | A fast network partition method for large-scale urban traffic networks显示文摘In order to control the large-scale urban traffic network through hierarchical or decentralized methods, it is necessary to exploit a network partition method, which should be both effective in extracting subnetworks and fast to compute. In this paper, a new approach to calculate the correlation degree, which determines the desire for interconnection between two adjacent intersections, is first proposed. It is used as a weight of a link in an urban traffic network, which considers both the physical characteristics and the dynamic traffic information of the link. Then, a fast network division approach by optimizing the modularity, which is a criterion to distinguish the quality of the partition results, is applied to identify the subnetworks for large-scale urban traffic networks. Finally, an application to a specified urban traffic network is investigated using the proposed algorithm. The results show that it is an effective and efficient method for partitioning urban traffic networks automatically in real world. | Zhao ZHOU Shu LIN Yugeng XI | 2013 | 控制理论与应用(英文版)2013，11，3： | 3 |
| 8 | Outliers Mining in Time Series Data Sets显示文摘In this paper, we present a cluster-based algorithm for time series outlier mining.We use discrete Fourier transformation (DFT) to transform time series from time domain to frequency domain. Time series thus can be mapped as the points in k -dimensional space.For these points, a cluster-based algorithm is developed to mine the outliers from these points.The algorithm first partitions the input points into disjoint clusters and then prunes the clusters,through judgment that can not contain outliers.Our algorithm has been run in the electrical load time series of one steel enterprise and proved to be effective. | Zheng Binxiang,Du Xiuhua & Xi Yugeng Institute of Automation, Shanghai Jiaotong University,Shanghai 200030,P.R.China | 2002 | Journal of Systems Engineering and Electronics2002，13，1： | 3 |
| 9 | Distributed Subgradient Algorithm for Multi-Agent Optimization With Dynamic Stepsize显示文摘In this paper,we consider distributed convex optimization problems on multi-agent networks.We 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 solution.Our approach can be applied to both synchronous and asynchronous communication protocols.Specifically,we propose the distributed subgradient with uncoordinated dynamic stepsizes(DS-UD)algorithm for synchronous protocol and the AsynDGD algorithm for asynchronous protocol.Theoretical analysis shows that the proposed algorithms guarantee that all agents reach a consensus on the solution to the multi-agent optimization problem.Moreover,the proposed approach with dynamic stepsizes eliminates the requirement of diminishing stepsize in existing works.Numerical examples of distributed estimation in sensor networks are provided to illustrate the effectiveness of the proposed approach. | Xiaoxing Ren Dewei Li Yugeng Xi Haibin Shao | 2021 | IEEE/CAA Journal of Automatica Sinica2021，8，8： | 2 |
| 10 | More relaxed conditions for model predictive control with guaranteed stability显示文摘For the model predictive c ontroller,terminal state satisfying a certain inequality can guarantee the stability but it is somewhat conservative.In this paper,we give a more r elaxed stability condition by considering the effect of the initial state.Based on that we propose an algorithm to guarantee that the closed loop s ystem is asymptotically stable.Finally,the conclusions are verifie d by a simulation. | Bin LIU Yugeng XI | 2005 | 控制理论与应用(英文版)2005，3，2： | 2 |
| 11 | A Fuzzy-Neural Network Control of Nonlinear Dynamic Systems显示文摘In this paper, an adaptive dynamic control scheme based on a fuzzy neural network is presented, that presents utilizes both feed-forward and feedback controller elements. The former of the two elements comprises a neural network with both identification and control role, and the latter is a fuzzy neural algorithm, which is introduced to provide additional control enhancement. The feedforward controller provides only coarse control, whereas the feedback controller can generate on-line conditional proposition rule automatically to improve the overall control action. These properties make the design very versatile and applicable to a range of industrial applications. | Li Shaoyuan & Xi Yugeng (Shanghai Jiaotong University, 200030, P. R. China) | 2000 | Journal of Systems Engineering and Electronics2000，11，1： | 2 |
| 12 | Deducing Complete Selection Rule Set for Driver Nodes to Guarantee Network’s Structural Controllability显示文摘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. | Xichen Wang Yugeng Xi Wenzhen Huang Shuai Jia | 2019 | IEEE/CAA Journal of Automatica Sinica2019，6，5： | 2 |
| 13 | Performance analysis of active schedules in identical parallel machine显示文摘Active schedule is one of the most basic and popular concepts in production scheduling research. For identical parallel machine scheduling with jobs’ dynamic arrivals, the tight performance bounds of active schedules under the measurement of four popular objectives are respectively given in this paper. Similar analysis method and conclusions can be generalized to static identical parallel machine and single machine scheduling problem. | Changjun WANG Yugeng XI | 2007 | 控制理论与应用(英文版)2007，5，3： | 2 |
| 14 | Synthesis of model predictive control based on data-driven learning显示文摘Dear editor,Model predictive control(MPC)is a practically effective and attractive approach in the field of industrial processes[1]owing to its excellent ability to handle constraints,nonlinearity,and performance/cost trade-offs.The core of all model-based predictive algorithms is to use'open-loop optimal control'instead of'closed-loop optimal control'within a moving horizon[2]. | Yuanqiang ZHOU Dewei LI Yugeng XI Zhongxue GAN | 2020 | Science China(Information Sciences)2020，63，8： | 2 |
| 15 | A synthesis approach for output feedback robust constrained model predictive control显示文摘 | DING Baocang XI Yugeng CYCHOWSKI M T | 2008 | Automatica2008，44，1： | 1 |
| 16 | Constrained robust feed-back model predictive control for uncertain systems with polytopic description显示文摘 | LI Dewei XI Yugeng ZHENG Pengyuan | 2009 | International Journal of Control2009，82，7： | 1 |
| 17 | Synthesis of dynamic output feedback RMPC with saturated inputs显示文摘 | LI Dewei XI Yugeng GAO Furong | 2013 | Automatica2013，49，4： | 1 |
| 18 | Improved model prediction and RMPC design for LPV systems with bounded changes显示文摘 | ZHENG Pengyuan LI Dewei XI Yugeng | 2013 | Automatica2013，49，12： | 1 |
| 19 | A RollingWindow Optimization Method for Large-scale WCDMA Base Stations Planning Problem显示文摘 | Zhang Hongyuan Xi Yugeng Gu Hanyu | | 0，，01： | 1 |
| 20 | Fast model predictive control for urban road networks via MILP显示文摘 | Shu Lin De Schutter Yugeng Xi | 2011 | IEEE Transections on Intelligent Transportation System2011，12，3： | 1 |
您所在的机构暂未开通此部分的功能，请联系管理员