Active learning attraction basins of dynamical system

Abstract Dynamical systems often exhibit multiple attractors representing significantly different functioning conditions. A global map of attraction basins can offer valuable guidance for stabilizing or transitioning system states. Such a map can be constructed without prior system knowledge by identifying attractors across a sufficient number of points in the state space. However, determining the attractor for each initial state can be a laborious task. Here, we tackle the challenge of reconstructing attraction basins using as few initial points as possible. In each iteration of our approach, informative points are selected through random seeding and are driven along the current classification boundary, promoting the eventual selection of points that are both diverse and enlightening. The results across various experimental dynamical systems demonstrate that our approach requires fewer points than baseline methods while achieving comparable mapping accuracy. Additionally, the reconstructed map allows us to accurately estimate the minimum escape distance required to transition the system state to a target basin.

Authors

Institutions

Publication Details

Journal
Chinese Physics B
Published
2025-03-11
DOI
https://doi.org/10.1088/1674-1056/adbede
Primary Topic
Evolutionary Algorithms and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Active learning attraction basins of dynamical system

Gang Feng Yan, Xiao-Wei Cao, Xiao-lei Ru
Chinese Physics B
Evolutionary Algorithms and Applications
article

Active learning attraction basins of dynamical system

Gang Feng Yan, Xiao-Wei Cao, Xiao-lei Ru
article en

Abstract

Abstract Dynamical systems often exhibit multiple attractors representing significantly different functioning conditions. A global map of attraction basins can offer valuable guidance for stabilizing or transitioning system states. Such a map can be constructed without prior system knowledge by identifying attractors across a sufficient number of points in the state space. However, determining the attractor for each initial state can be a laborious task. Here, we tackle the challenge of reconstructing attraction basins using as few initial points as possible. In each iteration of our approach, informative points are selected through random seeding and are driven along the current classification boundary, promoting the eventual selection of points that are both diverse and enlightening. The results across various experimental dynamical systems demonstrate that our approach requires fewer points than baseline methods while achieving comparable mapping accuracy. Additionally, the reconstructed map allows us to accurately estimate the minimum escape distance required to transition the system state to a target basin.

Chinese Physics BVol. 34(5)
Tongji University (CN), Intelligent Systems Research (United States) (US)
Openalex Percentile: Top 98%
Evolutionary Algorithms and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.