Toolgraph design of optimal and feasible control strategies for time-varying dynamical systems
Summary: The paper presents a new method for designing optimal and feasible control strategies for time-variant dynamical processes. The key point of the presented idea lies in utilizing a flow graph structure for representing pertinent properties of the autonomous dynamics of a given dynamical process in a time-and-state space, which is composed of certain elementary segments. The structure is referred to as a time-and-state space toolgraph. In the procedure, each segment of the temporary state space is assigned a node of the time-and-state space toolgraph. The flow values are proportional to the cost of driving the operational point of the dynamical process between the centers of adjacent segments. Any of the discrete optimization algorithms can be applied to search for a cheapest path connecting the initial and terminal points of the sought optimal piecewise-linear trajectory of the operational points in the considered time-and-state space. Additional assumptions or restrictions concerning arbitrary forbidden zones for the operational points can be easily taken into account. In such cases the nodes representing the segments partially or entirely belonging to the finite forbidden zones are deposed from the toolgraph structure.
- scientific article; zbMATH DE number 4188566
- Suboptimal Fault Tolerant Control Design with the Use of Discrete Optimization
- scientific article; zbMATH DE number 4140661
- A Combinatorial, Graph-Based Solution Method for a Class of Continuous-Time Optimal Control Problems
- A conditional optimal control problem and its adaptive solution method
- A theorem of Littlewood, Orlicz, and Grothendieck about sums in \(L^1(0,1)\)
- Dynamic programming and optimal control. Vol. 1.
- scientific article; zbMATH DE number 3586408 (Why is no real title available?)
- scientific article; zbMATH DE number 1064419 (Why is no real title available?)
- Path planning using intervals and graphs
- Suboptimal Fault Tolerant Control Design with the Use of Discrete Optimization
- The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
This page was built for publication: Toolgraph design of optimal and feasible control strategies for time-varying dynamical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1954471)
