Browsing by Author "LIN, SY"

Now showing 1 - 13 of 13

A 2-PHASE PARALLEL COMPUTING ALGORITHM FOR THE SOLUTION OF IMPLEMENTABLE RECEDING HORIZON CONTROL FOR CONSTRAINED NONLINEAR-SYSTEMS
(1993)
LIN, SY
;
電控工程研究所
;
Institute of Electrical and Control Engineering
A DISTRIBUTED STATE ESTIMATOR FOR ELECTRIC-POWER SYSTEMS
(1992-05-01)
LIN, SY
;
交大名義發表
;
電控工程研究所
;
National Chiao Tung University
;
Institute of Electrical and Control Engineering
In this paper, we develop a theoretically robust and computationally efficient distributed state estimator, which is to solve the WLS problem by using distributed computation, for the power system. This distributed state estimator aims at its utilization in the decentralized control, and it is executing in a data communication network which is assumed to be topologically the same and physically in parallel with the power network. Along with this state estimator, we can obtain several attractive satellite functions which include (1) reduction of the time-skew problem, (2) being free from the power network topological error, (3) easy identification of the unobservable states and (4) bad data detection and identification. We have analyzed the computation complexity of this distributed state estimator. Moreover, we have also simulated this state estimator on several cases of the IEEE 30-bus system. The numerical accuracy of the simulation results are satisfactory, and the estimated computation time including the communication delay demonstrates the excellent computational performance of the distributed state estimator.
A FLEXIBLE PARALLEL ARCHITECTURE FOR RELAXATION LABELING ALGORITHMS
(1992-05-01)
LIN, SY
;
CHEN, Z
;
交大名義發表
;
資訊工程學系
;
National Chiao Tung University
The design of a flexible parallel architecture for both the discrete relaxation labeling (DRL) algorithm and the probabilistic relaxation labeling (PRL) algorithm is addressed. Through the analysis of parallelism in the computational models of both algorithms, the parallel execution of the algorithms on a flexible parallel architecture is presented. Three basic types of parallel operations are performed in the architecture: simultaneous, pipeline, and systolic. An illustrative example is used to show how the DRL algorithm can be executed on the parallel architecture. In doing so the processing element (PE) organization and the combiner organization of the architecture are described. The same architecture with programmable functional units is shown to be able to execute the PRL algorithm, too. The performance comparisons between the proposed architecture and some other existing ones are also given.
A HARDWARE IMPLEMENTABLE 2-LEVEL PARALLEL COMPUTING ALGORITHM FOR GENERAL MINIMUM-TIME CONTROL
(1992-05-01)
LIN, SY
;
交大名義發表
;
電控工程研究所
;
National Chiao Tung University
;
Institute of Electrical and Control Engineering
In this paper, we propose a hardware implementable two-level parallel computing algorithm for general minimum-time control. We first discretize and transform the minimum-time control problem for a continuous-time system into a parameter optimization problem which is large dimensional and nonseparable. Then, the proposed two-level algorithm decomposes this parameter optimization problem into a master-slave problem. The master problem can be easily solved by a one-dimensional gradient method, and the slave problem will be solved by the proposed parallel computing method which combines recursive quadratic programming with the dual method. Furthermore, we have proved the convergence of this iterative two-level parallel computing algorithm under some conditions. Based on the VLSI array processor technology, we present a dedicated hardware computing architecture to realize this algorithm. The corresponding time complexity is also analyzed. Finally, several practical problems including the minimum-time orbit transfer problem and the minimum-time robot control problem have been simulated. The results show that the algorithm is well-suited for real-time application of minimum-time control.
A HARDWARE IMPLEMENTABLE RECEDING HORIZON CONTROLLER FOR CONSTRAINED NONLINEAR-SYSTEMS
(1994-09-01)
LIN, SY
;
交大名義發表
;
電控工程研究所
;
National Chiao Tung University
;
Institute of Electrical and Control Engineering
We present a two-phase parallel computing method for obtaining an implementable receding horizon control solution for constrained nonlinear systems. The phase 1 method solves a feasibility problem to find an approximate open-loop admissible control and horizon pair. The phase 2 method successively improves the admissible control to obtain an implementable open-loop receding horizon control solution. We briefly sketch an approach to realizing this two-phase method using VLSI array processors. Solution times for simulation examples estimated on the basis of current VLSI technology confirm that our controller is well suited to the stabilization of real-time processing, fast, constrained nonlinear systems.
A METHOD TO SOLVE POWER-SYSTEM STATIC-STATE ESTIMATION PROBLEMS BY USING A NETWORK OF PROCESSORS
(1990)
LIN, SY
;
電控工程研究所
;
Institute of Electrical and Control Engineering
A PARALLEL ARCHITECTURE FOR PROBABILISTIC RELAXATION OPERATIONS ON IMAGES
(1990)
CHEN, Z
;
LIN, SY
;
CHEN, YY
;
交大名義發表
;
資訊工程學系
AN EFFICIENT DESCENT ALGORITHM FOR A CLASS OF UNCONSTRAINED OPTIMIZATION PROBLEMS OF NONLINEAR LARGE MESH-INTERCONNECTED SYSTEMS
(1993)
LIN, SY
;
LIN, CH
;
YU, SL
;
電控工程研究所
;
Institute of Electrical and Control Engineering
AN EFFICIENT METHOD FOR UNCONSTRAINED OPTIMIZATION PROBLEMS OF NONLINEAR LARGE MESH-INTERCONNECTED SYSTEMS
(1995-03-01)
LIN, SY
;
LIN, CH
;
交大名義發表
;
電控工程研究所
;
National Chiao Tung University
We present a new efficient method for solving unconstrained optimization problems for nonlinear large mesh-interconnected systems. This method combines an approximate scaled gradient method with a block Gauss-Seidel with line search method which is used to obtain an approximate solution of the unconstrained quadratic programming subproblem. We prove that our method is globally convergent and demonstrate by several numerical examples its superior efficiency compared to a sparse matrix technique based method. In an example of a system of more than 200 variables, we observe that our method is 3.45 times faster than the sparse matrix technique based Newton-like method and about 50 times faster than the Newton-like method without the sparse matrix technique.
AN IMPLEMENTABLE DISTRIBUTED STATE ESTIMATOR AND DISTRIBUTED BAD DATA-PROCESSING SCHEMES FOR ELECTRIC-POWER SYSTEMS
(1994-08-01)
LIN, SY
;
LIN, CH
;
交大名義發表
;
電控工程研究所
;
National Chiao Tung University
In this paper, we present an implementable distributed state estimator and distributed bad data detection and identification schemes for electric power systems. The system under consideration is partitioned into k areas, each of which is governed by a local control center that has at least one computer system. These decentralized computer systems are linked by a communication network. The distributed state estimator and distributed bad data processing schemes are designed to be carried out in this computer network. The proposed distributed state estimator possesses the following properties, which ensure its implementability: 1) it uses only the computers available in the decentralized local control centers, 2) it is executed in a small-scale computer communication network, 3) it can converge even if errors occasionally occur in the communication links, and 4) the decentralized computers need not be synchronous. Furthermore, our distributed bad data processing schemes can process the bad data in each area independently using the corresponding local computer system.
COMBINING PROJECTED JACOBI METHOD WITH DUAL PROJECTED PSEUDO-QUASI-NEWTON METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS
(1993)
LIN, SY
;
LIN, CH
;
電控工程研究所
;
Institute of Electrical and Control Engineering
COMPLETE DECOMPOSITION ALGORITHM FOR NONCONVEX SEPARABLE OPTIMIZATION PROBLEMS AND APPLICATIONS
(1992-11-01)
LIN, SY
;
交大名義發表
;
電控工程研究所
;
National Chiao Tung University
;
Institute of Electrical and Control Engineering
In this paper, we present a complete decomposition algorithm for nonconvex separable optimization problems applied in the optimal control problems. This complete decomposition algorithm combines recursive quadratic programming with the dual method. When our algorithm is applied to discretized optimal control problems, a simple and parallel computation and a simple and regular data flow pattern between consecutive computational steps results. This paper also suggests an approach for developing a hardware implementation of our algorithm and gives an estimation of the execution time needed to solve a practical example.
MULTIYEAR MULTI-CASE OPTIMAL VAR PLANNING
(1990-11-01)
HONG, YY
;
SUN, DI
;
LIN, SY
;
LIN, CJ
;
電控工程研究所