The sensitivity of linear time-optimal systems to weak phase constraints

1975 ◽  
Vol 15 (5) ◽  
pp. 19-31
Author(s):  
A.A. Belolipetskii
Keyword(s):  
Linear Time ◽  
Weak Phase ◽  
Phase Constraints ◽  
Time Optimal

A Generalization of the Bang-Bang Principle of Linear Control Theory*

1965 ◽  
Vol 8 (6) ◽  
pp. 783-789
Author(s):  
Richard Datko
Keyword(s):  
Optimal Control ◽  
Control Theory ◽  
Matrix Function ◽  
Linear Time ◽  
Time Optimal Control ◽  
Linear Control ◽  
Dimensional Vector ◽  
R Matrix ◽  
Linear Control Theory ◽  
Time Optimal

In a paper by LaSalle [l] on linear time optimal control the following lemma is proved:Let Ω be the set of all r-dimensional vector functions U(τ) measurable on [ 0, t] with |ui(τ)≦1. Let Ωo be the subset of functions uo(τ) with |uoi(τ) = 1. Let Y(τ) be any (n × r ) matrix function in L1([ 0, t]).

scholarly journals Channel Density Minimization by Pin Permutation

VLSI Design ◽  
1994 ◽  
Vol 2 (2) ◽  
pp. 171-183
Author(s):  
Yang Cai ◽  
D. F. Wong ◽  
Jason Cong
Keyword(s):  
Optimal Algorithm ◽  
Linear Time ◽  
Layout Design ◽  
Strong Sense ◽  
Np Hard ◽  
Wire Length ◽  
Channel Density ◽  
Time Optimal ◽  
Two Sides ◽  
Intergrated Circuits

We present in this paper a linear time optimal algorithm for minimizing the density of a channel (with exits) by permuting the terminals on the two sides of the channel. This compares favorably with the previously known near-optimal algorithm presented in [6] that runs in superlinear time. Our algorithm has important applications in hierarchical layout design of intergrated circuits. We also show that the problem of minimizing wire length by permuting terminals is NP-hard in the strong sense.

Sign in / Sign up

Export Citation Format

Share Document