Estimating reachable sets for two-dimensional linear discrete systems
type: Item
instance of: scholarly article
title: Estimating reachable sets for two-dimensional linear discrete systems
zbMATH Open document ID: 0618.93006
DOI: 10.1007/BF00938527
published in: Journal of Optimization Theory and Applications
publication date: 1988-01-01T00:00:00Z
review text: We are concerned with the problem of estimating the reachable set \({\mathcal R}\) for a two-dimensional linear discrete-time system with bounded controls. Different approaches are adopted depending on whether the system matrix has real or complex eigenvalues. For the complex eigenvalue case, the quasi-periodic nature of minimum time trajectories is exploited in developing a simple, but often accurate, procedure. For the real eigenvalue case, overestimates of reachable sets can be trivially obtained using a decomposition method.
Mathematics Subject Classification ID: 93B05
Mathematics Subject Classification ID: 93B03
Mathematics Subject Classification ID: 93C55
Mathematics Subject Classification ID: 93C05
Mathematics Subject Classification ID: 15A18
zbMATH DE Number: 4003983
zbMATH Keywords: reachable set
zbMATH Keywords: two-dimensional linear discrete-time system
zbMATH Keywords: bounded controls
author: Michael E. Fisher
author: Jonathan E. Gayek
MaRDI profile type: Publication
cites work: The minimal time regulator problem for linear sampled-data systems: General theory
cites work: Discretional Convexity and the Maximum Principle for Discrete Systems
cites work: Q5680669
cites work: Estimating the effect of continual disturbances on discrete-time population models
cites work: Return time and vulnerability for a food chain model
cites work: Approximating reachable sets for a class of linear control systems†
full work available at URL: https://doi.org/10.1007/bf00938527
OpenAlex ID: W2029390889
description: scientific article; zbMATH DE number 4003983