Scholarlink

<p>Restarting a stochastic search process can accelerate its completion by providing an opportunity to take a more favorable path with each reset. This strategy, known as stochastic resetting, is well studied in random processes. Here, we introduce <i>chaotic resetting</i>, a fundamentally different resetting strategy designed for deterministic chaotic systems. Unlike stochastic resetting, where randomness is intrinsic to the dynamics, chaotic resetting exploits the extreme sensitivity to initial conditions inherent to chaotic motion: unavoidable uncertainties in the reset conditions effectively generate new realizations of the deterministic process. This extension is nontrivial because some realizations may significantly speed up the search, while others may significantly slow it down. We study the conditions required for chaotic resetting to be consistently advantageous, concluding that it requires the presence of a mixed phase space in which fractal and smooth regions coexist. We quantify its effectiveness by demonstrating substantial reductions –ranging from <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(40\%\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>40</mn> <mo>%</mo> </mrow> </math></EquationSource> </InlineEquation> to <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(90\%\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>90</mn> <mo>%</mo> </mrow> </math></EquationSource> </InlineEquation>– in average search times when an optimal resetting interval is used. These results establish a clear conceptual bridge between deterministic chaos and search optimization, opening new avenues for accelerating processes in real-world chaotic systems where perfect control or knowledge of initial conditions is unattainable.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Chaotic resetting: a resetting strategy for deterministic chaotic systems

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年3月5日

查看全文
  • Julia Cantisán,
  • Alexandre R. Nieto,
  • Jesús M. Seoane

摘要

Restarting a stochastic search process can accelerate its completion by providing an opportunity to take a more favorable path with each reset. This strategy, known as stochastic resetting, is well studied in random processes. Here, we introduce chaotic resetting, a fundamentally different resetting strategy designed for deterministic chaotic systems. Unlike stochastic resetting, where randomness is intrinsic to the dynamics, chaotic resetting exploits the extreme sensitivity to initial conditions inherent to chaotic motion: unavoidable uncertainties in the reset conditions effectively generate new realizations of the deterministic process. This extension is nontrivial because some realizations may significantly speed up the search, while others may significantly slow it down. We study the conditions required for chaotic resetting to be consistently advantageous, concluding that it requires the presence of a mixed phase space in which fractal and smooth regions coexist. We quantify its effectiveness by demonstrating substantial reductions –ranging from \(40\%\) 40 % to \(90\%\) 90 % – in average search times when an optimal resetting interval is used. These results establish a clear conceptual bridge between deterministic chaos and search optimization, opening new avenues for accelerating processes in real-world chaotic systems where perfect control or knowledge of initial conditions is unattainable.