Control of a compound computer program as a variational problem
From MaRDI portal
The execution of a compound computer program is treated as a multiphase cyclic queueing system with a specified customer processing sequence. Dynamic optimal control problems are formulated for specific programs running on a fixed structure computer. The necessary optimality conditions are used in order to pass from variational problems to boundary-value problems whose solution is the optimal control for an executing program. Some results of numerical computer experiments are given.
Recommendations
- Optimal control from theory to computer programs
- Control of the dynamics of systems with program constraints
- scientific article; zbMATH DE number 695664
- scientific article; zbMATH DE number 3293350
- Programmed constructions in control problems with vector criterion
- Variational method and computation for H_ control
- A new computational approach to solving a class of optimal control problems
- scientific article; zbMATH DE number 1424029
- The method of programmed iterations in abstract control problems
- A Computational Approach to Optimal Control Problems with Almost Smooth Controls
Cited in
(6)- Optimizing computer operating processes in automated control systems
- Dispatching of robotic control programs
- scientific article; zbMATH DE number 444955 (Why is no real title available?)
- scientific article; zbMATH DE number 3965407 (Why is no real title available?)
- scientific article; zbMATH DE number 3985077 (Why is no real title available?)
- An analog solution of programming problems
This page was built for publication: Control of a compound computer program as a variational problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1087010)
