The generic degree of autonomy
From MaRDI portal
Abstract: This paper calculates the degree of autonomy of a generic autonomous n-D system given by the kernel of a partial difference operator. The calculation implies that attaching a generic controller to a non-autonomous system, results in a controlled system whose degree of autonomy is the maximum possible. Thus a generic controller is maximally efficient with respect to the criterion of maximising degree of autonomy. The term generic here refers to an open (dense) subset of the set of all n-D systems with the Zariski topology.
Recommendations
- Controllable and autonomous nD linear systems
- On the generic dimension of controllable subspaces
- Autonomous multidimensional systems and their implementation by behavioral control
- Relative genericity of controllablity and stabilizability for differential-algebraic systems
- scientific article; zbMATH DE number 3871113
Cites work
- A Behavioral Approach to Control of Distributed Systems
- A formal theory of matrix primeness
- Algorithms for the theory of restrictions of scalar \(n\)-D systems to proper subspaces of \(\mathbb {R}^n\)
- Autonomous multidimensional systems and their implementation by behavioral control
- Bounds for the degrees in the Nullstellensatz
- Continuity of dynamical systems: A system theoretic approach
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- Multidimensional constant linear systems
- On interconnections, control, and feedback
- The Behavioral Approach to Open and Interconnected Systems
- The Hautus test and genericity results for controllable and uncontrollable behaviors
Cited in
(4)
This page was built for publication: The generic degree of autonomy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4687472)