A dynamic control problem for a two part-type pull manufacturing system

2002 ◽  
Author(s):  
F. Martinelli ◽  
P. Valigi
Keyword(s):  
Control Problem ◽  
Manufacturing System ◽  
Dynamic Control ◽  
Part Type

The Mathematics of Coordinated Control of Prosthetic Arms and Manipulators

1972 ◽  
Vol 94 (4) ◽  
pp. 303-309 ◽  
Author(s):  
D. E. Whitney
Keyword(s):  
Control Problem ◽  
Rate Control ◽  
Position Control ◽  
Dynamic Control ◽  
Mathematical Formulation ◽  
Coordinated Control ◽  
Computer Assisted ◽  
Final Position ◽  
Coordinate Systems ◽  
Joint Angles

The problems of coordinated rate control and position control of multidegree-of-freedom arms are treated together in this paper. A mathematical formulation is presented which allows real time computer-assisted rate control under a variety of external coordinate systems. A new solution to the endpoint position control problem is given, allowing the arm to be driven to a final position specified in meaningful external coordinates without the corresponding final joint angles being known. Attention is given to redundant arms, to the possibility of singularities, and to the relation between this work and dynamic control of arms.

Dynamic Scheduling of a Four-Station Queueing Network

1990 ◽  
Vol 4 (1) ◽  
pp. 131-156 ◽  
Author(s):  
C. N. Laws ◽  
G. M. Louth
Keyword(s):  
Control Problem ◽  
Dynamic Scheduling ◽  
Dynamic Control ◽  
Queueing Network ◽  
Single Server ◽  
Scheduling Policies ◽  
Resource Pooling ◽  
Static Scheduling ◽  
Open Queueing Network ◽  
Dynamic Policy

This paper is concerned with the problem of optimally scheduling a multiclass open queueing network with four single-server stations in which dynamic control policies are permitted. Under the assumption that the system is heavily loaded, the original scheduling problem can be approximated by a dynamic control problem involving Brownian motion. We reformulate and solve this problem and, from the interpretation of the solution, we obtain two dynamic scheduling policies for our queueing network. We compare the performance of these policies with two static scheduling policies and a lower bound via simulation. Our results suggest that under either dynamic policy the system, at least when heavily loaded, exhibits the form of resource pooling given by the solution to the approximating control problem. Furthermore, even when lightly loaded the system performs better under the dynamic policies than under either static policy.

Sign in / Sign up

Export Citation Format

Share Document