Backend
Topology Identification of Directed Signed Networks via Repelling Laplacians
arXiv cs.SY0 views
arXiv:2611.06327v1 Announce Type: new Abstract: We address the problem of simultaneously identifying the interaction topology and synchronizing a network interconnected over a directed graph that exhibits both cooperative and antagonistic interactions, modeled via a repelling Laplacian matrix. We propose an adaptive control protocol built on a node-centric regressor formulation, in which the network is driven to track a persistently exciting auxiliary network. We then propose a time-varying adaptive gain to remove the need for global knowledge of the network. We establish uniform semiglobal practical asymptotic stability of the estimation errors when the excitation depends only on measurable errors. Numerical simulations validate the theoretical results.
Source:https://arxiv.org/abs/2611.06327PreviousTransversal Passivity: Dissipation Relative to Input and Output ManifoldsNextOn the Optimality of Implicit Feedback in Markov Decision Processes over Imperfect Links
Related posts
Building for agent use without MCP or skills
0Hacker News New
Show HN: teletap – Your remote coding agents ask you when stuck
0Hacker News Show
7 AI Security Mistakes Beginners Should Avoid
0dev.to
Four Idle Myths About Free Servers, and the Wake Probe That Settles Them
0dev.to
Deep Work for Developers Who Keep Getting Interrupted
0dev.to
Fence the Human-Owned Paragraphs: A Markdown Contract for Model-Assisted Docs
0dev.to