arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.09132math.OCcs.LOcs.SYeess.SY
收藏

连续线性定常系统的可达性判定

On the Decidability of Reachability in Continuous Time Linear Time-Invariant Systems

Mohan Dantam, Amaury Pouly

摘要:

研究了连续时间线性定常控制系统状态到状态可达性的判定问题。我们分析这个问题的允许控制集,这是假设下的单位超立方体的线性映射的图像。这自然地对有界(有时称为饱和)控制进行建模。控制集是$\mathbb{R}^n$的仿射子空间的可达性问题的判定性是控制理论中的一个基本结果。我们的第一个结果是二维可判定性($n=2$),如果矩阵$A$满足某些谱条件,以及一般的条件可判定性。如果变换矩阵$A$是对角的有理元素(或同一代数数的有理倍数),则可达性问题是可判定的。如果变换矩阵$A$只有实特征值,则可达性问题是条件可判定的。时间有界可达性问题在二维上是条件可判定的,也是无条件可判定的。我们的一些可判定性结果是有条件的,因为它们依赖于某些数学理论的可判定性,即指数实数理论($\mathfrak{R}_{\exp}$)和有界正弦实数理论($\mathfrak{R}_{\exp,\sin}$)。我们还得到了一个硬度的问题,其中目标是简单的集合(超立方体的尺寸$n-1$或超平面),而不是一个点,控制集是凸有界多面体的温和推广的结果。在这种情况下,我们表明,该问题至少是一样难的\emph{Continuous Positivity problem}或\emph{Nontangential Continuous Positivity problem}。

英文摘要:

We consider the decidability of state-to-state reachability in linear time-invariant control systems over continuous time. We analyse this problem with respect to the allowable control sets, which are assumed to be the image under a linear map of the unit hypercube. This naturally models bounded (sometimes called saturated) controls. Decidability of the version of the reachability problem in which control sets are affine subspaces of $\mathbb{R}^n$ is a fundamental result in control theory. Our first result is decidability in two dimensions ($n=2$) if the matrix $A$ satisfies some spectral conditions, and conditional decidablility in general. If the transformation matrix $A$ is diagonal with rational entries (or rational multiples of the same algebraic number) then the reachability problem is decidable. If the transformation matrix $A$ only has real eigenvalues, the reachability problem is conditionally decidable. The time-bounded reachability problem is conditionally decidable, and unconditionally decidable in two dimensions. Some of our decidability results are conditional in that they rely on the decidability of certain mathematical theories, namely the theory of the reals with exponential ($\mathfrak{R}_{\exp}$) and with bounded sine ($\mathfrak{R}_{\exp,\sin}$). We also obtain a hardness result for a mild generalization of the problem where the target is simple set (hypercube of dimension $n-1$ or hyperplane) instead of a point, and the control set is a convex bounded polytope. In this case, we show that the problem is at least as hard as the \emph{Continuous Positivity problem} or the \emph{Nontangential Continuous Positivity problem}.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑