Computing regions of attraction with polytopes: Planar case

被引：12
|
作者：
Romanchuk, BG
机构：
[1] Department of Electrical Engineering, McGill University, Montreal, Que. H3A 2A7
来源：
AUTOMATICA | 1996年 / 32卷 / 12期
关键词：
Lyapunov stability; piecewise-linear analysis; numerical algorithms; saturation;
D O I：
10.1016/S0005-1098(96)80011-2
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
An algorithm that estimates the region of attraction of the origin using a convex polytope is developed for piecewise-linear dynamical systems. This is equivalent to the problem of computing a Lyapunov function. The R(2) case is studied here for simplicity. Copyright (C) 1996 Elsevier Science Ltd.
引用
收藏
页码：1727 / 1732
页数：6
相关论文
共 50 条
  • [21] Almost global attraction in planar systems
    Monzón, P
    SYSTEMS & CONTROL LETTERS, 2005, 54 (08) : 753 - 758
  • [22] INTERTWINED BASINS OF ATTRACTION IN PLANAR SYSTEMS
    Ding, Changming
    INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS, 2009, 19 (07): : 2377 - 2381
  • [23] FINITE REGIONS OF ATTRACTION FOR PROBLEM OF LURE
    WALKER, JA
    MCCLAMROCH, NH
    INTERNATIONAL JOURNAL OF CONTROL, 1967, 6 (04) : 331 - +
  • [24] A computational method for the determination of attraction regions
    Fermin Guerrero-Sanchez, W.
    Guerrero-Castellanos, J. F.
    Alexandrov, Vladimir V.
    2009 6TH INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING, COMPUTING SCIENCE AND AUTOMATION CONTROL (CCE 2009), 2009, : 102 - +
  • [25] The structure of basins of attraction and their trapping regions
    Nusse, HE
    Yorke, JA
    ERGODIC THEORY AND DYNAMICAL SYSTEMS, 1997, 17 : 463 - 481
  • [26] On the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes
    Hans Raj Tiwary
    Discrete & Computational Geometry, 2008, 40 : 469 - 479
  • [27] Regions of Attraction for Two Hidden Attractors
    Guzan, Milan
    Hlavacka, Michal
    Maliakova, Mariia
    PROCEEDINGS OF THE 2019 IEEE INTERNATIONAL CONFERENCE ON MODERN ELECTRICAL AND ENERGY SYSTEMS (MEES'2019), 2019, : 346 - 349
  • [28] On the hardness of computing intersection, union and Minkowski sum of polytopes
    Tiwary, Hans Raj
    DISCRETE & COMPUTATIONAL GEOMETRY, 2008, 40 (03) : 469 - 479
  • [29] Computing the degree of a vertex in the skeleton of acyclic Birkhoff polytopes
    Fernandes, Rosario
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2015, 475 : 119 - 133
  • [30] Computing Volumes of Adjacency Polytopes via Draconian Sequences
    Davis, Robert
    Chen, Tianran
    ELECTRONIC JOURNAL OF COMBINATORICS, 2022, 29 (01): : 1 - 42
12345