Node-wise monotone barrier coupling law for formation control
We study a node-wise monotone barrier coupling law, motivated by the synaptic coupling of neural central pattern generators. It is illustrated that this coupling imitates the desirable properties of neural central pattern generators. In particular, the coupling law 1) allows us to assign multiple central patterns on the circle and 2) allows for rapid switching between different patterns via simple `kicks'. In the end, we achieve full control by partitioning the state space by utilizing a barrier effect and assigning a unique steady-state behavior to each element of the resulting partition. We analyze the global behavior and study the viability of the design.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Edge-wise funnel output synchronization of heterogeneous agents with relative degree one
When a group of heterogeneous node dynamics are diffusively coupled with a high coupling gain, the group exhibits a collective emergent behavior which is governed by a simple algebraic average of the node dynamics called…
Breaking the Finite-Sample Barrier in Entropy Coupling
Dependence among marginally constrained observations can break a finite-sample barrier. To formalize this phenomenon, we introduce the \emph{minimum list entropy coupling} $H(P\|Q_1,\dots,Q_m)$, the minimum conditional e…
Representation LearningPricing Barrier Options with DeepBSDEs
This paper presents a novel and direct approach to price boundary and final-value problems, corresponding to barrier options, using forward deep learning to solve forward-backward stochastic differential equations (FBSDE…
Spingarn's Method and Progressive Decoupling Beyond Elicitable Monotonicity
Spingarn's method of partial inverses and the progressive decoupling algorithm address inclusion problems involving the sum of an operator and the normal cone of a linear subspace, known as linkage problems. Despite thei…
Agnostic proper learning of monotone functions: beyond the black-box correction barrier
We give the first agnostic, efficient, proper learning algorithm for monotone Boolean functions. Given $2^{\tilde{O}(\sqrt{n}/\varepsilon)}$ uniformly random examples of an unknown function $f:\{\pm 1\}^n \rightarrow \{\…