Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2310.00589v2

Help | Advanced Search

Mathematics > Optimization and Control

arXiv:2310.00589v2 (math)
[Submitted on 1 Oct 2023 (v1) , revised 12 Jun 2024 (this version, v2) , latest version 17 Jun 2024 (v3) ]

Title: Structural Controllability of Drift-free Bilinear Systems on $\mathbb{SE(n)}$

Title: 无漂移双线性系统的结构可控性$\mathbb{SE(n)}$

Authors:A. Sanand Amita Dilip, Chirayu D. Athalye
Abstract: We obtain graph theoretic necessary and sufficient conditions for the structural controllability of drift free bilinear systems on the special Euclidean group leveraging results from the existing literature. The graph theoretic conditions allow us to check the structural controllability in polynomial time. We use these conditions to find the sparsest structures for structural controllability. These conditions can also be used to check the structural accessibility of bilinear systems with drift. Equivalent conditions using the permutation group are also obtained. We consider the problem of link failures within a given structure and obtain equivalent conditions for structural controllability which are polynomial time checkable. We show that the problem of finding sparsest structures under $k$ link failures is NP-hard for $k>0$. We also discuss the case of structural controllability under probabilistic link failures.
Abstract: 我们通过利用现有文献中的结果,得到了无漂移双线性系统在特殊欧几里得群上的结构能控性的图论必要和充分条件。 图论条件使我们能够在多项式时间内检查结构能控性。 我们使用这些条件来找到结构能控性的最稀疏结构。 这些条件也可以用来检查具有漂移的双线性系统的结构可达性。 还获得了使用置换群的等价条件。 我们考虑给定结构内的链路故障问题,并得到了结构能控性的等价条件,这些条件可以在多项式时间内检查。 我们证明了在$k$链路故障下寻找最稀疏结构的问题对于$k>0$是NP难的。 我们还讨论了在概率链路故障下的结构能控性情况。
Subjects: Optimization and Control (math.OC) ; Systems and Control (eess.SY)
MSC classes: 17B45, 05C85, 91A68, 93B70
Cite as: arXiv:2310.00589 [math.OC]
  (or arXiv:2310.00589v2 [math.OC] for this version)
  https://doi.org/10.48550/arXiv.2310.00589
arXiv-issued DOI via DataCite

Submission history

From: Sanand Dilip [view email]
[v1] Sun, 1 Oct 2023 06:17:59 UTC (185 KB)
[v2] Wed, 12 Jun 2024 10:23:41 UTC (283 KB)
[v3] Mon, 17 Jun 2024 16:04:42 UTC (22 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
math.OC
< prev   |   next >
new | recent | 2023-10
Change to browse by:
cs
cs.SY
eess
eess.SY
math

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号