BACK TO INDEX

Publications about 'accessibility'
Articles in journal or book chapters
  1. A. C. Antoulas, E. D. Sontag, and Y. Yamamoto. Controllability and Observability, pages 264-281. John Wiley & Sons, Inc., 2001. [WWW] [PDF] [doi:10.1002/047134608X.W1006] Keyword(s): reachability, controllability, observability, Lie algebra accessibility.


  2. E.D. Sontag and F.R. Wirth. Remarks on universal nonsingular controls for discrete-time systems. Systems Control Lett., 33(2):81-88, 1998. [PDF] [doi:http://dx.doi.org/10.1016/S0167-6911(97)00117-5] Keyword(s): discrete time, controllability, real-analytic functions.
    Abstract:
    For analytic discrete-time systems, it is shown that uniform forward accessibility implies the generic existence of universal nonsingular control sequences. A particular application is given by considering forward accessible systems on compact manifolds. For general systems, it is proved that the complement of the set of universal sequences of infinite length is of the first category. For classes of systems satisfying a descending chain condition, and in particular for systems defined by polynomial dynamics, forward accessibility implies uniform forward accessibility.


  3. F. Albertini and E.D. Sontag. Further results on controllability properties of discrete-time nonlinear systems. Dynam. Control, 4(3):235-253, 1994. [PDF] [doi:http://dx.doi.org/10.1007/BF01985073] Keyword(s): discrete-time, nonlinear control.
    Abstract:
    Controllability questions for discrete-time nonlinear systems are addressed in this paper. In particular, we continue the search for conditions under which the group-like notion of transitivity implies the stronger and semigroup-like property of forward accessibility. We show that this implication holds, pointwise, for states which have a weak Poisson stability property, and globally, if there exists a global "attractor" for the system.


  4. F. Albertini and E.D. Sontag. Discrete-time transitivity and accessibility: analytic systems. SIAM J. Control Optim., 31(6):1599-1622, 1993. [PDF] [doi:http://dx.doi.org/10.1137/0331075] Keyword(s): controllability, discrete-time systems, accessibility, real-analytic functions.
    Abstract:
    A basic open question for discrete-time nonlinear systems is that of determining when, in analogy with the classical continuous-time "positive form of Chow's Lemma", accessibility follows from transitivity of a natural group action. This paper studies the problem, and establishes the desired implication for analytic systems in several cases: (i) compact state space, (ii) under a Poisson stability condition, and (iii) in a generic sense. In addition, the paper studies accessibility properties of the "control sets" recently introduced in the context of dynamical systems studies. Finally, various examples and counterexamples are provided relating the various Lie algebras introduced in past work.


  5. E.D. Sontag. Universal nonsingular controls. Systems Control Lett., 19(3):221-224, 1992. Note: Erratum appeared in SCL 20(1993), p. 77, can be found in same file.[PDF] [doi:http://dx.doi.org/10.1016/0167-6911(92)90116-A] Keyword(s): controllability, real-analytic functions.
    Abstract:
    For analytic systems satisfying the strong accessibility rank condition, generic inputs produce trajectories along which the linearized system is controllable. Applications to the steering of systems without drift are briefly mentioned.


  6. F. Albertini and E.D. Sontag. Transitivity and forward accessibility of discrete-time nonlinear systems. In Analysis of controlled dynamical systems (Lyon, 1990), volume 8 of Progr. Systems Control Theory, pages 21-34. Birkhäuser Boston, Boston, MA, 1991.


  7. E.D. Sontag. Kalman's controllability rank condition: from linear to nonlinear. In Mathematical system theory, pages 453-462. Springer, Berlin, 1991. [PDF] Keyword(s): controllability.
    Abstract:
    The notion of controllability was identified by Kalman as one of the central properties determining system behavior. His simple rank condition is ubiquitous in linear systems analysis. This article presents an elementary and expository overview of the generalizations of this test to a condition for testing accessibility of discrete and continuous time nonlinear systems.


  8. E.D. Sontag. Integrability of certain distributions associated with actions on manifolds and applications to control problems. In Nonlinear controllability and optimal control, volume 133 of Monogr. Textbooks Pure Appl. Math., pages 81-131. Dekker, New York, 1990. [PDF] Keyword(s): controllability.
    Abstract:
    Results are given on the integrability of certain distributions which arise from smoothly parametrized families of diffeomorphisms acting on manifolds. Applications to control problems and in particular to the problem of sampling are discussed. Pages 42-50 apply the results to the control of continuous time systems; this is an exposition of some of the basic results of the Lie algebraic accessibility theory.


  9. B. Jakubczyk and E.D. Sontag. Controllability of nonlinear discrete-time systems: a Lie-algebraic approach. SIAM J. Control Optim., 28(1):1-33, 1990. [PDF] [doi:http://dx.doi.org/10.1137/0328001] Keyword(s): discrete-time.
    Abstract:
    This paper presents a geometric study of controllability for discrete-time nonlinear systems. Various accessibility properties are characterized in terms of Lie algebras of vector fields. Some of the results obtained are parallel to analogous ones in continuous-time, but in many respects the theory is substantially different and many new phenomena appear.


  10. B. Jakubczyk and E.D. Sontag. Nonlinear discrete-time systems. Accessibility conditions. In Modern optimal control, volume 119 of Lecture Notes in Pure and Appl. Math., pages 173-185. Dekker, New York, 1989. [PDF]


  11. E.D. Sontag. A Chow property for sampled bilinear systems. In C.I. Byrnes, C.F. Martin, and R. Saeks, editors, Analysis and Control of Nonlinear Systems, pages 205-211. North Holland, Amsterdam, 1988. [PDF] Keyword(s): discrete-time, bilinear systems.
    Abstract:
    This paper studies accessibility (weak controllability) of bilinear systems under constant sampling rates. It is shown that the property is preserved provided that the sampling period satisfies a condition related to the eigenvalues of the autonomous dynamics matrix. This condition generalizes the classical Kalman-Ho-Narendra criterion which is well known in the linear case, and which, for observability, results in the classical Nyquist theorem.


  12. E.D. Sontag. Controllability is harder to decide than accessibility. SIAM J. Control Optim., 26(5):1106-1118, 1988. [PDF] [doi:http://dx.doi.org/10.1137/0326061] Keyword(s): computational complexity, controllability, computational complexity.
    Abstract:
    The present article compares the difficulties of deciding controllability and accessibility. These are standard properties of control systems, but complete algebraic characterizations of controllability have proved elusive. We show in particular that for subsystems of bilinear systems, accessibility can be decided in polynomial time, but controllability is NP-hard.


Conference articles
  1. E.D. Sontag. From linear to nonlinear: some complexity comparisons. In Proc. IEEE Conf. Decision and Control, New Orleans, Dec. 1995, IEEE Publications, 1995, pages 2916-2920, 1995. [PDF] Keyword(s): theory of computing and complexity, computational complexity, controllability, observability.
    Abstract:
    This paper deals with the computational complexity, and in some cases undecidability, of several problems in nonlinear control. The objective is to compare the theoretical difficulty of solving such problems to the corresponding problems for linear systems. In particular, the problem of null-controllability for systems with saturations (of a "neural network" type) is mentioned, as well as problems regarding piecewise linear (hybrid) systems. A comparison of accessibility, which can be checked fairly simply by Lie-algebraic methods, and controllability, which is at least NP-hard for bilinear systems, is carried out. Finally, some remarks are given on analog computation in this context.


  2. F. Albertini and E.D. Sontag. Accessibility of discrete-time nonlinear systems, and some relations to chaotic dynamics. In Proc. Conf. Inform. Sci. and Systems, John Hopkins University, March 1991, pages 731-736, 1991.


  3. F. Albertini and E.D. Sontag. Some connections between chaotic dynamical systems and control systems. In Proc. European Control Conf. , Vol 1, Grenoble, July 1991, pages 58-163, 1991. [PDF] Keyword(s): chaotic systems, controllability.
    Abstract:
    This paper shows how to extend recent results of Colonius and Kliemann, regarding connections between chaos and controllability, from continuous to discrete time. The extension is nontrivial because the results all rely on basic properties of the accessibility Lie algebra which fail to hold in discrete time. Thus, this paper first develops further results in nonlinear accessibility, and then shows how a theorem can be proved, which while analogous to the one given in the work by Colonius and Klieman, also exhibits some important differences. A counterexample is used to show that the theorem given in continuous time cannot be generalized in a straightforward manner.


  4. E.D. Sontag. Some complexity questions regarding controllability. In Proc. IEEE Conf. Decision and Control, Austin, Dec. 1988, pages 1326-1329, 1988. [PDF] Keyword(s): theory of computing and complexity, computational complexity, controllability, computational complexity.
    Abstract:
    It has been known for a long time that certain controllability properties are more difficult to verify than others. This article makes this fact precise, comparing controllability with accessibility, for a wide class of nonlinear continuous time systems. The original contribution is in formalizing this comparison in the context of computational complexity. (This paper placed here by special request.)


  5. E.D. Sontag. Further results on accessibility under sampling. In Proc.Conf. Info. Sci. and Systems, Johns Hopkins University, March 1985, 1985.


  6. E.D. Sontag. Further remarks preservation of accessibility under sampling. In Proc. Johns Hopkins Conf. on Info. Sci. and Systems, 1983, pages 326-332, 1983.


  7. E.D. Sontag and H.J. Sussmann. Accessibility under sampling. In Proc. IEEE Conf. Dec. and Control, Orlando, Dec. 1982, 1982. [PDF] Keyword(s): discrete-time.
    Abstract:
    This note addresses the following problem: Find conditions under which a continuous-time (nonlinear) system gives rise, under constant rate sampling, to a discrete-time system which satisfies the accessibility property.



BACK TO INDEX




Disclaimer:

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders.




Last modified: Fri Sep 20 11:51:28 2024
Author: sontag.


This document was translated from BibTEX by bibtex2html