跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2607.00846 · v3

MMAO-Dyn: A Metabolic Multi-Agent Optimizer for Dynamic Optimization

首次提交 2026-07-01 20:12
版本更新 2026-11-13 12:56
雷达观测 2026-11-17 04:57
arXiv ↗PDF ↗

摘要

This paper studies whether the Metabolic Multi-Agent Optimizer (MMAO) can be credibly derived into a dynamic-optimization method without replacing its core metabolic control loop by external adaptation modules. The proposed MMAO-Dyn maps private energy, communal budget, role drift, success feedback, and lifecycle turnover to a nonstationary setting in which environmental changes repeatedly invalidate previously useful local structure. We evaluate MMAO-Dyn on an 18-scenario synthetic dynamic continuous benchmark matrix covering shifted sphere, shifted Ackley, and shifted Rastrigin landscapes at 10D10D, 20D20D, and 30D30D, with two change severities and 12 seeds per scenario. The comparison layer includes a generic MMAO variant without dynamic derivation, dynamic random search, dynamic PSO-lite, dynamic DE-lite, and three endogenous ablations. Across the full 216-run matrix, MMAO-Dyn attains mean offline error 28.0728.07, improving over Generic-MMAO (29.3629.36), Dynamic-PSO-lite (34.6534.65), Dynamic-DE-lite (67.0967.09), and Dynamic-RandomSearch (111.37111.37). The gains are clearest in aggregate robustness on sphere and Rastrigin families and in 10-step post-change recovery relative to the generic backbone, whereas the seed-aligned comparison with Dynamic-PSO-lite remains unfavorable in win-loss count and the NoMemoryRefresh ablation stays very close to the full method. The results support extending the metabolic loop to dynamic optimization, particularly through recovery-oriented resource redistribution.

作者备注:8 pages

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v3,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v3 · 2026-11-13 12:56 · 最新观测版本

MMAO-Dyn: A Metabolic Multi-Agent Optimizer for Dynamic Optimization

This paper studies whether the Metabolic Multi-Agent Optimizer (MMAO) can be credibly derived into a dynamic-optimization method without replacing its core metabolic control loop by external adaptation modules. The proposed MMAO-Dyn maps private energy, communal budget, role drift, success feedback, and lifecycle turnover to a nonstationary setting in which environmental changes repeatedly invalidate previously useful local structure. We evaluate MMAO-Dyn on an 18-scenario synthetic dynamic continuous benchmark matrix covering shifted sphere, shifted Ackley, and shifted Rastrigin landscapes at 10D10D, 20D20D, and 30D30D, with two change severities and 12 seeds per scenario. The comparison layer includes a generic MMAO variant without dynamic derivation, dynamic random search, dynamic PSO-lite, dynamic DE-lite, and three endogenous ablations. Across the full 216-run matrix, MMAO-Dyn attains mean offline error 28.0728.07, improving over Generic-MMAO (29.3629.36), Dynamic-PSO-lite (34.6534.65), Dynamic-DE-lite (67.0967.09), and Dynamic-RandomSearch (111.37111.37). The gains are clearest in aggregate robustness on sphere and Rastrigin families and in 10-step post-change recovery relative to the generic backbone, whereas the seed-aligned comparison with Dynamic-PSO-lite remains unfavorable in win-loss count and the NoMemoryRefresh ablation stays very close to the full method. The results support extending the metabolic loop to dynamic optimization, particularly through recovery-oriented resource redistribution.

查看此版本解读 →查看此版本原文 ↗