MORALS: Analysis of High-Dimensional Robot Controllers via Topological Tools in a Latent Space

被引:0
|
作者
Vieira, Ewerton R. [2 ,3 ]
Sivaramakrishnan, Aravind [1 ]
Tangirala, Sumanth [1 ]
Granados, Edgar [1 ]
Mischaikow, Konstantin [2 ]
Bekris, Kostas E. [1 ]
机构
[1] Rutgers, Dept Comp Sci, New Brunswick, NJ 08901 USA
[2] Rutgers, Dept Math, New Brunswick, NJ 08901 USA
[3] Rutgers, DIMACS, New Brunswick, NJ 08901 USA
关键词
ATTRACTION DOMAIN; DYNAMICS;
D O I
10.1109/ICRA57147.2024.10610383
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Estimating the region of attraction (RoA) for a robot controller is essential for safe application and controller composition. Many existing methods require a closed-form expression that limit applicability to data-driven controllers. Methods that operate only over trajectory rollouts tend to be data-hungry. In prior work, we have demonstrated that topological tools based on Morse Graphs (directed acyclic graphs that combinatorially represent the underlying nonlinear dynamics) offer data-efficient RoA estimation without needing an analytical model. They struggle, however, with high-dimensional systems as they operate over a state-space discretization. This paper presents Morse Graph-aided discovery of Regions of Attraction in a learned Latent Space (MORALS)**. The approach combines auto-encoding neural networks with Morse Graphs. MORALS shows promising predictive capabilities in estimating attractors and their RoAs for data-driven controllers operating over high-dimensional systems, including a 67-dim humanoid robot and a 96-dim 3-fingered manipulator. It first projects the dynamics of the controlled system into a learned latent space. Then, it constructs a reduced form of Morse Graphs representing the bistability of the underlying dynamics, i.e., detecting when the controller results in a desired versus an undesired behavior. The evaluation on high-dimensional robotic datasets indicates data efficiency in RoA estimation.
引用
收藏
页码:27 / 33
页数:7
相关论文
共 50 条
  • [41] Publishing Private High-dimensional Datasets: A Topological Approach
    Alipourjeddi, Narges
    Miri, Ali
    2022 INTERNATIONAL WIRELESS COMMUNICATIONS AND MOBILE COMPUTING, IWCMC, 2022, : 1142 - 1147
  • [42] Tools for the analysis of high-dimensional single-cell RNA sequencing data
    Wu, Yan
    Zhang, Kun
    NATURE REVIEWS NEPHROLOGY, 2020, 16 (07) : 408 - 421
  • [43] An Adaptive Latent Factor Model via Particle Swarm Optimization for High-Dimensional and Sparse Matrices
    Chen, Sili
    Yuan, Ye
    Wang, Jin
    2019 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC), 2019, : 1738 - 1743
  • [44] Tools for the analysis of high-dimensional single-cell RNA sequencing data
    Yan Wu
    Kun Zhang
    Nature Reviews Nephrology, 2020, 16 : 408 - 421
  • [45] Analysis of high-dimensional data using local input space histograms
    Kerdels, Jochen
    Peters, Gabriele
    NEUROCOMPUTING, 2015, 169 : 272 - 280
  • [46] Control and analysis of center guided flocking motion in high-dimensional space
    Yu, Hui
    Wang, Yongji
    DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2007, 14 : 377 - 382
  • [47] Planning in High-dimensional Shape Space for a Single-wheeled Balancing Mobile Robot with Arms
    Nagarajan, Umashankar
    Kim, Byungjun
    Hollis, Ralph
    2012 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2012, : 130 - 135
  • [48] A Graph-Incorporated Latent Factor Analysis Model for High-Dimensional and Sparse Data
    Wu, Di
    He, Yi
    Luo, Xin
    IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING, 2023, 11 (04) : 907 - 917
  • [49] Fast Statistical Analysis of Rare Circuit Failure Events via Subset Simulation in High-Dimensional Variation Space
    Sun, Shupeng
    Li, Xin
    2014 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN (ICCAD), 2014, : 324 - 331
  • [50] MMLF: Multi-Metric Latent Feature Analysis for High-Dimensional and Incomplete Data
    Wu, Di
    Zhang, Peng
    He, Yi
    Luo, Xin
    IEEE TRANSACTIONS ON SERVICES COMPUTING, 2024, 17 (02) : 575 - 588