PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
March 29, 2026Известия Российской академии наук Теория и системы управления / Journal of Computer and System Sciences International0 citations

Decomposition in the Time-Optimization Problem for a Linear Discrete-Time System With Bounded Control

View Full Paper
DID. N. IbragimovVPV. M. Podgornaya

Key Points

  • To solve the time-optimization problem for linear discrete-time systems with constraints on control.
  • Developed a decomposition method for multidimensional systems into two-dimensional subsystems.
  • Created an algorithm for calculating vertex sets of polyhedra in explicit form.
  • Applied the method to find the fastest damping solution for high-rise structures in seismic zones.
  • Reduced time complexity in optimizing control for linear systems.
  • Demonstrated successful application in a model simulating seismic activity scenarios.

Abstract

The paper considers the solution to the time-optimization problem for a linear system with discrete time and geometric constraints on control. A method for decomposing a multidimensional system into two-dimensional subsystems to reduce time complexity and an algorithm for calculating the vertex sets of the sum of two polyhedra on a plane in explicit form have been developed. An example of using the method and algorithm to solve the problem of fastest damping of a high-rise structure located in a seismic activity zone is given.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Ibragimov et al. (2025) studied this question.

synapsesocial.com/papers/69c8c3bdde0f0f753b39eac2https://doi.org/10.7868/s3034644425060012
Ask AI
Helpful
Bookmark
Share
View Full Paper