betaFeedback

WorksComputer Science

Rapid Mean-Field Formation Transport with a Shared-Representation Neural Fokker-Planck Controller

Abstract

This paper develops a mean-field formation transport method with low online computational cost for large-scale multi-agent systems. Classical mean-field planners often require repeated solutions of coupled forward and backward partial differential equations, making online replanning computationally demanding. Density and control are therefore approximated by a common parameterized nonlinear map with separate scalar density and vector control outputs. Parameters are optimized using Fokker–Planck and initial-condition residuals, formation-matching costs on numerically simulated closed-loop particle trajectories, and control effort. Numerical computations are restricted to a bounded region of the state space, with an additional penalty on probability flux across its boundary. For the periodic-domain model, we establish well-posedness of the induced density evolution and bound the density-approximation error in terms of the dynamics and initial-condition residuals. Parameter optimization precedes online operation, during which controller coefficients remain fixed. Experiments quantify the accuracy–runtime trade-off relative to a mean-field planner, show lower transport error than classical feedback baselines, and demonstrate the benefits of the common parameterization.

Introduction

Large-scale robotic formation control is becoming increasingly important for tasks requiring scalable and robust coordination [1]. Classical approaches include potential-field control [2] and consensus-based coordination [3], but distributional objectives under stochastic disturbances motivate a population-level description. Mean-field formulations are attractive in this regime because they describe the swarm through a population density and interpret formation synthesis as probability transport [4, 5]. This formulation characterizes the spatial distribution of large agent populations under stochastic disturbances and expresses formation objectives directly in terms of the population density.

Numerical methods for coupled mean-field partial differential equations (PDEs) include policy iteration with repeated forward–backward solves [6] and alternating optimization of population and control approximations [7]. When these computations are repeated online, their cost can limit feedback implementation under restricted computational resources. Optimization based on particle simulations evaluates formation objectives directly, but does not explicitly impose the Fokker–Planck equation on an auxiliary density approximation. The control synthesis problem is therefore to incorporate the probability-transport dynamics and formation objectives into a feedback law that can be evaluated with low online computational cost.

This paper jointly parameterizes a decentralized feedback law and an auxiliary density approximation using a neural network, defined as a finite composition of affine maps and componentwise nonlinear functions. A common transformation of state and time supplies intermediate coordinates to separate density and control output maps. The coefficients are computed by minimizing an objective that combines density residuals, formation mismatch, and control effort. This numerical parameter optimization, termed training or learning, is performed offline, before online feedback execution (deployment). Formation mismatch is evaluated on simulated closed-loop particle trajectories (rollouts); their use in parameter optimization is termed rollout supervision. During online operation, the coefficients remain fixed, and each agent evaluates the feedback law using only its current state and time.

The contributions are summarized as follows.

  • A common state-time parameterization is constructed for the feedback law and density approximation. The shared coefficients couple the two maps during offline optimization, while online control requires only evaluation of the feedback map at each agent’s state and the current time.

  • A joint synthesis objective combines Fokker–Planck and initial-condition residuals with particle-based formation costs and control effort. The residual terms promote consistency with the density dynamics, while the particle-based terms penalize deviations from prescribed formations at selected times.

  • For the periodic-domain model, well-posedness of the induced density evolution and a residual-to-density error bound are established under the stated assumptions. The bound quantifies consistency between the density approximation and the exact density induced by the synthesized feedback law.

Presented for publication in the 2026 IEEE Conference on Decision and Control (CDC).

© 2026 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Background

Mean-Field Control and Probability Transport

Mean-field formulations describe the collective behavior of large agent populations through a state distribution [4]. For stochastic agent dynamics, the evolution of this distribution is characterized by a controlled Fokker–Planck equation [5]. Formation control can therefore be formulated as steering an initial population density toward a prescribed target distribution subject to drift and diffusion. Decentralized control under population coupling has been studied for large stochastic multi-agent systems [8], with applications to swarm tracking developed within mean-field game formulations [9]. Mean-field games seek consistency between individually optimal control laws and the resulting population distribution. The formulation considered here instead minimizes a common population objective, while retaining the controlled Fokker–Planck description of density evolution.

Numerical approaches to mean-field planning and mean-field games include policy iteration [6], proximal-gradient optimization [10], and alternating updates of neural density and control approximations [7]. Coupled approximations of the control law, value function, and population density have also been used to construct mean-field-game controllers for large multi-agent systems [11]. For methods that solve the coupled optimality equations separately for each planning instance, changes in the task specification require additional computation. This requirement can limit their use when control inputs must be computed within a restricted online computational budget.

Physics-Informed Solvers for Mean-Field Games

Physics-informed approximation incorporates governing-equation residuals into parameter optimization. Applications to mean-field games include spatiotemporal physics-informed neural operators [12] and unsupervised solution-operator learning [13]. These approaches approximate solution fields or mappings from problem data to solutions while incorporating the governing equations into the approximation procedure.

The coupling between density evolution and individual optimality remains part of the mean-field game formulation. Physics-informed neural network (PINN) methods address this coupling through residual-based optimization of network coefficients. Operator approximations can reduce the computation required for new problem instances by performing parameter optimization offline; their computational requirements depend on the class of problems represented. This paper considers a prescribed population-level formation objective and constructs an explicit feedback law through joint offline optimization of density and control approximations. During online operation, each agent evaluates this law at its current state and time with fixed coefficients, without solving a coupled forward–backward system.

Problem Formulation

Formation-Control Problem

Let Ω\Omega denote the state domain, T>0T > 0 the time horizon, and xi(t)∈Ωx_i(t) \in\Omega the state of agent ii, for i=1,…,Ni = 1,\ldots,N. The continuum model and analysis use the periodic domain Ω=Td\Omega= \mathbb{T}^d. Bounded Euclidean boxes, also denoted by Ω\Omega when discussing numerical computations, are treated separately through the boundary rules specified in Section IV. The swarm distribution is represented by the empirical measure

μtN=1N∑i=1Nδxi(t).\mu_t^N = \frac{1}{N}\sum_{i=1}^{N}\delta_{x_i(t)}.

where δx\delta_x denotes the Dirac measure concentrated at xx, so μtN\mu_t^N records the swarm shape at time tt. Let Ctar={cj}j=1M⊂Ω\mathcal{C}^{\mathrm{tar}} = \{c_j\}_{j=1}^{M} \subset\Omega denote a set of target points. The target measure

νtar=1M∑j=1Mδcj\nu^{\mathrm{tar}} = \frac{1}{M}\sum_{j=1}^{M}\delta_{c_j}

specifies the desired allocation of mass among these points. More generally, target samples can describe a continuous spatial distribution around the desired geometry. The control objective is to drive μtN\mu_t^N toward the prescribed target distribution at selected times while limiting control effort.

On the periodic domain, each agent obeys the stochastic dynamics

dxi(t)=(f(xi(t))+g(xi(t))u(xi(t),t)) dt+σ dWi(t),(1)dx_i(t) = \bigl(f(x_i(t)) + g(x_i(t))u(x_i(t),t)\bigr)\,dt + \sigma\,dW_i(t), \tag*{(1)}

where f:Ω→Rdf:\Omega\to\mathbb{R}^d and g:Ω→Rd×mg:\Omega\to\mathbb{R}^{d\times m} are known, u(x,t)∈Rmu(x,t) \in\mathbb{R}^m is the common feedback law, and σ>0\sigma> 0 is the diffusion coefficient. (1) is interpreted periodically. The WiW_i are independent standard dd-dimensional Wiener processes, independent of the initial states, which are independently sampled from ρ0\rho_0. The standing analytical assumptions are f∈W1,∞(Ω;Rd)f \in W^{1,\infty}(\Omega;\mathbb{R}^d), g∈W1,∞(Ω;Rd×m)g \in W^{1,\infty}(\Omega;\mathbb{R}^{d\times m}), and ρ0∈L2(Ω)\rho_0 \in L^2(\Omega) with ρ0≥0\rho_0 \ge0 and ∫Ωρ0 dx=1\int_\Omega\rho_0\,dx = 1. The spaces H1H^1 and W1,∞W^{1,\infty} are the usual periodic Sobolev spaces, and H−1=(H1)∗H^{-1} = (H^1)^*.

Fix a control bound Mu>0M_u > 0. The admissible class Uad\mathcal{U}_{\mathrm{ad}} consists of deterministic feedback laws that are measurable in time, Lipschitz continuous in state uniformly in time, and satisfy ∥u∥L∞(Ω×(0,T))≤Mu\|u\|_{L^\infty(\Omega\times(0,T))} \le M_u. Each such law yields well-posed agent dynamics. Population coupling enters through the common design objective rather than an explicit density-dependent drift.

Mean-Field Control Formulation

For a fixed u∈Uadu \in\mathcal{U}_{\mathrm{ad}}, independent of the population size NN, let ρu(x,t)\rho^u(x,t) denote the probability density of the common state law. Write ρ=ρu\rho= \rho^u when the feedback is understood. The empirical measure μtN\mu_t^N is a random finite-sample representation of this law. Independence gives, for each fixed tt and continuous test function φ\varphi,

∫Ωφ dμtN=1N∑i=1Nφ(xi(t))→ N→∞ a.s.∫Ωφ(x)ρ(x,t) dx.\int_\Omega\varphi\,d\mu_t^N = \frac{1}{N}\sum_{i=1}^{N}\varphi(x_i(t)) \xrightarrow[\ N\to\infty\ ]{\mathrm{a.s.}} \int_\Omega\varphi(x)\rho(x,t)\,dx.

Thus ρ(⋅,t) dx\rho(\cdot,t)\,dx is the weak limit of μtN\mu_t^N. Densities at different evaluation times are time slices of this same evolving law, corresponding to the empirical measures at those times.

For a smooth periodic test function φ\varphi, define the controlled diffusion generator

Luφ(x,t)=∇φ(x)⋅(f(x)+g(x)u(x,t))+σ22Δφ(x).\mathcal{L}_u\varphi(x,t)=\nabla\varphi(x)\cdot(f(x)+g(x)u(x,t))+\frac{\sigma^2}{2}\Delta\varphi(x).

Then Itô’s formula applied to (1) and averaged over the swarm gives

ddt∫Ωφ(x) μtN(dx)=∫ΩLuφ(x,t) μtN(dx)+σN∑i=1N∇φ(xi(t))⋅dWi(t).\frac{d}{dt}\int_{\Omega}\varphi(x)\,\mu_t^N(dx)=\int_{\Omega}\mathcal{L}_u\varphi(x,t)\,\mu_t^N(dx)+\frac{\sigma}{N}\sum_{i=1}^{N}\nabla\varphi(x_i(t))\cdot dW_i(t).

By Itô’s isometry, the stochastic integral over [0,t][0,t] has second moment at most σ2T∥∇φ∥∞2/N\sigma^2T\|\nabla\varphi\|_\infty^2/N for t≤Tt\le T. Taking expectations gives

ddt∫Ωφ(x)ρ(x,t) dx=∫ΩLuφ(x,t)ρ(x,t) dx,\frac{d}{dt}\int_{\Omega}\varphi(x)\rho(x,t)\,dx=\int_{\Omega}\mathcal{L}_u\varphi(x,t)\rho(x,t)\,dx,

for all smooth periodic test functions φ\varphi and almost every tt, which is the weak form of the controlled Fokker–Planck equation. Hence formation control becomes a probability-transport problem for the swarm density, and the shared feedback law in (1) induces

∂tρ+∇⋅((f+gu)ρ)−σ22Δρ=0in Q=Ω×(0,T),(2)\partial_t\rho+\nabla\cdot((f+gu)\rho)-\frac{\sigma^2}{2}\Delta\rho=0\quad\text{in }Q=\Omega\times(0,T), \tag*{(2)}

with initial density ρ(⋅,0)=ρ0\rho(\cdot,0)=\rho_0. The periodic model requires no boundary flux condition. Numerical computations on bounded boxes use an auxiliary flux penalty and particle projection, which are not covered by the periodic-domain analysis. Let Ts={tk}k=1Ns\mathcal{T}_s=\{t_k\}_{k=1}^{N_s}, with 0<t1<⋯<tNs≤T0<t_1<\cdots<t_{N_s}\le T, denote the formation-evaluation times, and let {ρktar}k=1Ns\{\rho_k^{\mathrm{tar}}\}_{k=1}^{N_s} denote the prescribed target densities at those times. A finite target measure νtar\nu^{\mathrm{tar}} is atomic and has no Lebesgue density; a continuous target can instead be specified by smooth profiles around the target points. Empirical measures of independent, identically distributed samples from ρktar\rho_k^{\mathrm{tar}} converge weakly almost surely to ρktar(x) dx\rho_k^{\mathrm{tar}}(x)\,dx as their sample size increases. For static formations, one may take ρktar≡ρtar\rho_k^{\mathrm{tar}}\equiv\rho^{\mathrm{tar}} for all kk, whereas for staged transport tasks the target density may vary with kk. The mean-field formation-transport problem is therefore to choose a shared feedback law uu such that the induced density ρ(⋅,tk)\rho(\cdot,t_k) approaches ρktar\rho_k^{\mathrm{tar}} at the selected times while maintaining moderate control effort. The target geometry is imposed by penalizing the mismatch between simulated particle distributions and target formations at the times in Ts\mathcal{T}_s.

Shared-Representation Neural Fokker–Planck Controller

Shared-Representation Density-Control Parameterization

The approximations ρθ\rho_\theta and uθu_\theta, parameterized by the coefficient vector θ\theta, are coupled through the transport term

(f(x)+g(x)uθ(x,t))ρθ(x,t).(f(x)+g(x)u_\theta(x,t))\rho_\theta(x,t).

The shared feature map Tθ:Ω×[0,T]→RpT_\theta:\Omega\times[0,T]\to\mathbb{R}^p computes p∈Np\in\mathbb{N} intermediate coordinates used by both outputs. The density head is the scalar output map Sθ:Rp→RS_\theta:\mathbb{R}^p\to\mathbb{R}, and the control head is the vector output map Uθ:Rp→RmU_\theta:\mathbb{R}^p\to\mathbb{R}^m. They use the common coordinates hθh_\theta to compute the raw scalar ρ~θ(x,t)\widetilde{\rho}_\theta(x,t) and feedback input uθ(x,t)u_\theta(x,t), respectively. With θ\theta collecting all adjustable coefficients,

hθ(x,t)=Tθ(x,t),ρ~θ=Sθ(hθ),uθ=Uθ(hθ).(3)h_\theta(x,t)=T_\theta(x,t),\qquad\widetilde{\rho}_\theta=S_\theta(h_\theta),\qquad u_\theta=U_\theta(h_\theta). \tag*{(3)}

The raw output ρ~θ\widetilde{\rho}_\theta may have either sign and is not itself a probability density. The common map followed by the two output maps defines the two-head architecture, termed the shared-representation neural Fokker–Planck controller (SR-NFPC). The density output is normalized at each time by

ρθ(x,t)=softplus⁡(ρ~θ(x,t))+ε∫Ω(softplus⁡(ρ~θ(ξ,t))+ε) dξ,(4)\rho_\theta(x,t)=\frac{\operatorname{softplus}(\widetilde{\rho}_\theta(x,t))+\varepsilon}{\int_{\Omega}(\operatorname{softplus}(\widetilde{\rho}_\theta(\xi,t))+\varepsilon)\,d\xi}, \tag*{(4)}

where softplus⁡(z)=log⁡(1+exp⁡(z))\operatorname{softplus}(z)=\log(1+\exp(z)) and ε>0\varepsilon>0 is a fixed numerical offset. Since ∣Ω∣<∞|\Omega|<\infty, exact evaluation of the denominator gives ρθ>0\rho_\theta>0 and ∫Ωρθ(⋅,t) dx=1\int_{\Omega}\rho_\theta(\cdot,t)\,dx=1; numerical quadrature introduces an integration error. The term learned density refers to the approximation ρθ\rho_\theta obtained by parameter optimization. Equations (3) and (4) define a coupled map

(x,t)↦(ρθ(x,t),uθ(x,t))(x,t)\mapsto(\rho_\theta(x,t),u_\theta(x,t))

with shared intermediate coordinates. The control output satisfies ∥uθ∥L∞(Q)≤Mu\|u_\theta\|_{L^\infty(Q)}\le M_u. Smooth nonlinearities provide the derivatives required for collocation and yield a feedback law that is Lipschitz continuous in state on the compact state-time domain. For the periodic analysis, both approximations are required to be periodic in state, so uθ∈Uadu_\theta\in\mathcal{U}_{\mathrm{ad}}. Online execution requires only the composition uθ=Uθ∘Tθu_\theta=U_\theta\circ T_\theta.

Physics-Informed Density Residuals

Density residuals measure defects in the controlled Fokker–Planck equation and its initial condition. Define the interior operator

F[ρθ,uθ]=∂tρθ+∇⋅((f+guθ)ρθ)−σ22Δρθ,\mathcal{F}[\rho_\theta,u_\theta]=\partial_t\rho_\theta+\nabla\cdot((f+gu_\theta)\rho_\theta)-\frac{\sigma^2}{2}\Delta\rho_\theta,

so the formal mean-field model (2), together with ρ(⋅,0)=ρ0\rho(\cdot,0)=\rho_0, requires

F[ρ,u]=0in Q,\mathcal{F}[\rho,u]=0\quad\text{in }Q,
ρ(⋅,0)−ρ0=0.\rho(\cdot,0)-\rho_0=0.

The dynamics and initial-condition residuals entering the formal analysis are

εdyn2=∫0T∥F[ρθ,uθ](⋅,t)∥H−1(Ω)2 dt,(5)\varepsilon_{\mathrm{dyn}}^2=\int_0^T\|\mathcal{F}[\rho_\theta,u_\theta](\cdot,t)\|_{H^{-1}(\Omega)}^2\,dt, \tag*{(5)}
ε02=∥ρθ(⋅,0)−ρ0∥L2(Ω)2.(6)\varepsilon_0^2=\|\rho_\theta(\cdot,0)-\rho_0\|_{L^2(\Omega)}^2. \tag*{(6)}

For a square-integrable residual, the continuous norm satisfies

εdyn≤CΩ∥F[ρθ,uθ]∥L2(Q),\varepsilon_{\mathrm{dyn}}\le C_\Omega\|\mathcal{F}[\rho_\theta,u_\theta]\|_{L^2(Q)},

where CΩC_\Omega is the norm of the embedding L2(Ω)↪H−1(Ω)L^2(\Omega)\hookrightarrow H^{-1}(\Omega). Collocation approximates the squared L2(Q)L^2(Q) norm by residual evaluations at sampled points. This finite-sample quantity does not itself bound εdyn\varepsilon_{\mathrm{dyn}} without an additional sampling-error estimate. All derivatives act on the normalized density in (4), including the time-dependent denominator.

For the bounded box Ω\Omega used in numerical computations, let nn denote the outward unit normal on ∂Ω\partial\Omega. The auxiliary boundary penalty is

εflux2=∥((f+guθ)ρθ−σ22∇ρθ)⋅n∥L2(∂Ω×(0,T))2,(7)\varepsilon_{\mathrm{flux}}^{2}=\left\|\left(\left(f+g u_{\theta}\right)\rho_{\theta}-\frac{\sigma^{2}}{2}\nabla\rho_{\theta}\right)\cdot n\right\|_{L^{2}(\partial\Omega\times(0,T))}^{2}, \tag*{(7)}

which penalizes departures from zero normal probability flux. For the periodic model, set εflux=0\varepsilon_{\mathrm{flux}}=0. The bounded-domain penalty does not impose an exact boundary condition.

Minimizing these residuals promotes consistency with the transport-diffusion equation and initial distribution. These constraints alone do not select a target formation, since different feedback laws can induce different density evolutions satisfying the same PDE model and initial condition.

Formation Matching by Particle Simulation

Formation costs evaluated on simulated particle distributions supply geometric information absent from the PDE residuals. These simulations use the same feedback law as online operation.

For the bounded-box numerical model, use nn simulated particles initialized independently from ρ0\rho_{0}. Let LL be the number of integration steps, Δt=T/L\Delta t=T/L, and sℓ=ℓΔts_{\ell}=\ell\Delta t. The projected Euler–Maruyama update is

xiℓ+1=ΠΩ(xiℓ+Δt(f(xiℓ)+g(xiℓ)uθ(xiℓ,sℓ))+σΔt ξiℓ),(8)x_{i}^{\ell+1}=\Pi_{\Omega}\left(x_{i}^{\ell}+\Delta t\left(f(x_{i}^{\ell})+g(x_{i}^{\ell})u_{\theta}(x_{i}^{\ell},s_{\ell})\right)+\sigma\sqrt{\Delta t}\,\xi_{i}^{\ell}\right), \tag*{(8)}

where i=1,…,ni=1,\ldots,n, ℓ=0,…,L−1\ell=0,\ldots,L-1, the ξiℓ\xi_{i}^{\ell} are independent N(0,Id)\mathcal{N}(0,I_{d}) vectors independent of the initial states, IdI_{d} is the d×dd\times d identity matrix, and ΠΩ\Pi_{\Omega} is Euclidean projection onto the closed box. This numerical boundary rule is distinct from the periodic interpretation of (1).

For simulation, choose evaluation times tk=sℓkt_{k}=s_{\ell_{k}}, where 1≤ℓ1<⋯<ℓNs≤L1\leq\ell_{1}<\cdots<\ell_{N_{s}}\leq L. The particle set Xk={xiℓk}i=1nX_{k}=\{x_{i}^{\ell_{k}}\}_{i=1}^{n} is compared with target samples YkY_{k} and prescribed centers Ck={ck,j}j=1MkC_{k}=\{c_{k,j}\}_{j=1}^{M_{k}}. The entries of YkY_{k} are independent and identically distributed with density ρktar\rho_{k}^{\mathrm{tar}}, independently of the simulated particles. The formation-matching cost is

Lroll=∑k=1Nswk[MMD⁡2(Xk,Yk)+λaAτ(Xk,Ck)],(9)\mathcal{L}_{\mathrm{roll}}=\sum_{k=1}^{N_{s}}w_{k}\left[\operatorname{MMD}^{2}(X_{k},Y_{k})+\lambda_{a}\mathcal{A}_{\tau}(X_{k},C_{k})\right], \tag*{(9)}

where MMD is the maximum mean discrepancy, the fixed weights satisfy wk≥0w_{k}\geq0 and ∑kwk>0\sum_{k}w_{k}>0, and λa>0\lambda_{a}>0 balances center assignment against distribution matching. MMD compares unlabeled samples without estimating a density or assigning individual particle correspondences. We use the Gaussian kernel

Kγ(x,y)=exp⁡(−∥x−y∥22γ2),γ>0,K_{\gamma}(x,y)=\exp\left(-\frac{\lVert x-y\rVert^{2}}{2\gamma^{2}}\right),\qquad\gamma>0,

where γ\gamma is the prescribed spatial bandwidth, distinct from the diffusion coefficient σ\sigma. For sample sets X={xi}i=1nXX=\{x_{i}\}_{i=1}^{n_{X}} and Y={yj}j=1nYY=\{y_{j}\}_{j=1}^{n_{Y}}, we define

MMD⁡2(X,Y)=1nX2∑i,i′=1nXKγ(xi,xi′)+1nY2∑j,j′=1nYKγ(yj,yj′)−2nXnY∑i=1nX∑j=1nYKγ(xi,yj),\operatorname{MMD}^{2}(X,Y)=\frac{1}{n_{X}^{2}}\sum_{i,i'=1}^{n_{X}}K_{\gamma}(x_{i},x_{i'})+\frac{1}{n_{Y}^{2}}\sum_{j,j'=1}^{n_{Y}}K_{\gamma}(y_{j},y_{j'})-\frac{2}{n_{X}n_{Y}}\sum_{i=1}^{n_{X}}\sum_{j=1}^{n_{Y}}K_{\gamma}(x_{i},y_{j}),

including diagonal pairs. This cost is differentiable with respect to particle positions and invariant to sample ordering. At the population level, Gaussian-kernel MMD is zero only for identical probability distributions [14], making it suitable for matching multimodal formations.

For X={xi}i=1nX=\{x_{i}\}_{i=1}^{n} and C={cj}j=1MC=\{c_{j}\}_{j=1}^{M}, the formation-center term combines a weighted distance cost with a penalty for uneven allocation:

πij=exp⁡(−∥xi−cj∥2/τ)∑r=1Mexp⁡(−∥xi−cr∥2/τ),(10)\pi_{ij}=\frac{\exp\left(-\lVert x_{i}-c_{j}\rVert^{2}/\tau\right)}{\sum_{r=1}^{M}\exp\left(-\lVert x_{i}-c_{r}\rVert^{2}/\tau\right)}, \tag*{(10)}
Aτ(X,C)=1n∑i=1n∑j=1Mπij∥xi−cj∥2+λoccKL⁡(π^ ∥ Unif⁡),(11)\mathcal{A}_{\tau}(X,C)=\frac{1}{n}\sum_{i=1}^{n}\sum_{j=1}^{M}\pi_{ij}\lVert x_{i}-c_{j}\rVert^{2}+\lambda_{\mathrm{occ}}\operatorname{KL}(\hat{\pi}\,\|\,\operatorname{Unif}), \tag*{(11)}

where τ>0\tau>0 controls the concentration of the assignment weights πij\pi_{ij}, λocc>0\lambda_{\mathrm{occ}}>0 is the allocation penalty weight, π^j=1n∑iπij\hat{\pi}_{j}=\frac{1}{n}\sum_{i}\pi_{ij} is the average assignment weight for center jj, and Unif⁡=(1/M,…,1/M)\operatorname{Unif}=(1/M,\ldots,1/M). The relative entropy is KL⁡(π^ ∥ Unif⁡)=∑j=1Mπ^jlog⁡(Mπ^j)\operatorname{KL}(\hat{\pi}\,\|\,\operatorname{Unif})=\sum_{j=1}^{M}\hat{\pi}_{j}\log(M\hat{\pi}_{j}).

Using the L2(Q)L^{2}(Q) residual penalty as a surrogate for the weak residual, the composite loss is

L=λdyn∥F[ρθ,uθ]∥L2(Q)2+λ0ε02+λfluxεflux2+λrollLroll+λu∬Q∥uθ∥2ρθ dx dt.(12)\mathcal{L}=\lambda_{\mathrm{dyn}}\|\mathcal{F}[\rho_{\theta},u_{\theta}]\|_{L^{2}(Q)}^{2}+\lambda_{0}\varepsilon_{0}^{2} +\lambda_{\mathrm{flux}}\varepsilon_{\mathrm{flux}}^{2}+\lambda_{\mathrm{roll}}\mathcal{L}_{\mathrm{roll}} +\lambda_{u}\iint_{Q}\lVert u_{\theta}\rVert^{2}\rho_{\theta}\,dx\,dt. \tag*{(12)}

The weights λdyn,λ0,λroll,λu\lambda_{\mathrm{dyn}},\lambda_{0},\lambda_{\mathrm{roll}},\lambda_{u} are positive, and λflux>0\lambda_{\mathrm{flux}}>0 weights the bounded-domain penalty. Numerical optimization approximates the integrals in (12) by quadrature or sampling. The particle term specifies the formation objective, while the residual terms promote consistency of the density approximation with the controlled dynamics.

Offline Optimization and Online Feedback Execution

Formation mismatch is evaluated at selected times rather than every integration step. For static targets, we evaluate formation mismatch at t=T/2t=T/2 and t=Tt=T; for mode splitting or aggregation, we add one intermediate time before the final approach. No full reference trajectory is prescribed for individual particles.

Each offline iteration samples residual-evaluation points and simulates particles to evaluate (12). The PDE residual depends on the normalized density ρθ\rho_{\theta} and the feedback uθu_{\theta}, so its gradients update both output maps and the common map. The particle formation cost depends on the feedback

Algorithm 1 Offline optimization and online feedback for SR-NFPC

  1. Sample interior, initial, and boundary points for residual evaluation.

  2. Evaluate ρθ\rho_\theta, uθu_\theta, and sampled PDE, initial, and boundary residual losses.

  3. Simulate closed-loop particle trajectories with (8) under uθu_\theta.

  4. Compute formation-matching cost (9) from MMD and weighted center assignments.

  5. Update θ\theta using the sampled objective corresponding to (12); repeat steps 1–5 for the prescribed iterations.

  6. Fix θ\theta and apply ui(t)=Uθ(Tθ(xi(t),t))u_i(t) = U_\theta(T_\theta(x_i(t),t)) online.

composition Uθ∘TθU_\theta\circ T_\theta: it directly updates UθU_\theta and TθT_\theta, and changes the density approximation indirectly through TθT_\theta. Online, each agent applies ui(t)=Uθ(Tθ(xi(t),t))u_i(t) = U_\theta(T_\theta(x_i(t),t)) with fixed θ\theta: one evaluation of the common map and control output map per agent and control update. Algorithm 1 summarizes the procedure.

Density Approximation Bound

The normalized network output ρθ\rho_\theta approximates the exact density ρˉθ:=ρuθ\bar{\rho}_\theta:= \rho^{u^\theta} induced by the same feedback law. Both objects are defined on the periodic domain in this section. The analysis uses the Aubin–Lions compactness theorem [15] and the Lions–Magenes time-continuity and energy identities [16 Ch. III, Sec. 1].

Proposition 1. Under the standing analytical assumptions, for every u∈Uadu \in\mathcal{U}_{\mathrm{ad}}, (2) with initial density ρ0\rho_0 admits a unique weak solution satisfying

ρu∈L2(0,T;H1(Ω))∩C([0,T];L2(Ω)),\rho^u \in L^2(0,T;H^1(\Omega)) \cap C([0,T];L^2(\Omega)),
∂tρu∈L2(0,T;H−1(Ω)).\partial_t\rho^u \in L^2(0,T;H^{-1}(\Omega)).

Moreover, ρu(⋅,t)≥0\rho^u(\cdot,t) \ge0 almost everywhere and ∫Ωρu(x,t) dx=1\int_\Omega\rho^u(x,t)\,\mathrm{d}x = 1 for every t∈[0,T]t \in[0,T].

Proof. Omitted due to page limits.

Fix uθ∈Uadu_\theta\in\mathcal{U}_{\mathrm{ad}} and a normalized periodic approximation ρθ\rho_\theta satisfying

ρθ∈L2(0,T;H1(Ω)),∂tρθ∈L2(0,T;H−1(Ω)).(13)\rho_\theta\in L^2(0,T;H^1(\Omega)), \qquad\partial_t\rho_\theta\in L^2(0,T;H^{-1}(\Omega)). \tag*{(13)}

This regularity gives a representative in C([0,T];L2(Ω))C([0,T];L^2(\Omega)), so the time traces in the error estimate are well defined.

Theorem 1. Under the standing analytical assumptions and (13), there is Cρ>0C_\rho> 0, independent of θ\theta, such that

sup⁡t∈[0,T]∥ρθ(t)−ρˉθ(t)∥L2(Ω)+∥ρθ−ρˉθ∥L2(0,T;H1(Ω))≤Cρ(εdyn+ε0).(14)\sup_{t\in[0,T]}\|\rho_\theta(t)-\bar{\rho}_\theta(t)\|_{L^2(\Omega)} +\|\rho_\theta-\bar{\rho}_\theta\|_{L^2(0,T;H^1(\Omega))} \le C_\rho(\varepsilon_{\mathrm{dyn}}+\varepsilon_0). \tag*{(14)}

Proof. Omitted due to page limits.

The constant CρC_\rho depends only on Ω\Omega, TT, σ\sigma, ∥f∥∞\|f\|_\infty, ∥g∥∞\|g\|_\infty, and MuM_u. Theorem 1 concerns the periodic continuum model; sampling, time-discretization, and bounded-domain boundary errors are outside its scope.

Experiments

Setup

The experiments consist of a 1D Fokker–Planck (FP) transport benchmark and a 2D formation-control simulation. The 1D benchmark uses the domain [−3,3][-3,3], horizon T=3T=3, time step 0.040.04, diffusion σ=0.12\sigma=0.12, and 1800 simulated particles. The target is a Gaussian profile with center 1.2 and scale 0.09, restricted to the domain and normalized to unit mass. We compare the proposed controller against a tuned mean-field planning baseline [9, 10] and a tuned centralized sampled-goal baseline that assigns each agent a sampled terminal target and tracks it with centralized feedback.

The formation control simulation uses the 2D domain [−3,3]2[-3,3]^2, horizon T=4T=4, time step 0.050.05, diffusion σ=0.15\sigma=0.15, and 2500 agents. We evaluate five target geometries, namely line, ring, split, transition, and triangle. We compare against a navigation-function potential-field baseline [2], a consensus-style feedback baseline [3, 17], and the uncontrolled case. Metrics are terminal 2-Wasserstein distance W2W_2, control energy, and runtime.

1D Planner Comparison

Figure 1 compares the transient transport errors. After approximately t=1t=1, SR-NFPC has a smaller discrepancy than the mean-field planner over most of the remaining horizon, whereas the planner attains the lowest terminal error. The curves complement the terminal metrics by showing how rapidly the population approaches the target distribution during the maneuver.

Figure 1. Evolution of the 2-Wasserstein distance to the target distribution on the 1D benchmark. The plotted reference ρt∗\rho_t^* is the fixed target density.

Table 1 shows that SR-NFPC trades terminal accuracy for lower control energy and shorter reported runtime relative to the mean-field planner. The centralized sampledgoal baseline provides an additional accuracy reference; its timing is not directly comparable because it uses a different communication architecture.

MethodW2W_2EnergyTime (s)
SR-NFPC0.0773.6260.101
Mean-field plan [10]0.0253.8860.307
Centralized sampled-goal0.0405.0770.044

Table 1. 1D benchmark terminal metrics and total runtime.

MethodAvg. W2W_2Avg. energyBest W2W_2 count
SR-NFPC0.4281.4125/5
Potential field [2]0.7191.1820/5
Consensus [3], [17]1.1591.5810/5
No control0.9310.0000/5

Table 2. Average performance over five formation tasks.

Formation Benchmark

Figure 2 summarizes the five-formation suite. SR-NFPC achieves the lowest terminal Wasserstein distance among the compared methods on all five tasks, with particularly large reductions on the line, transition, and triangle targets.

Figure 2. Terminal Wasserstein distance across the five formation tasks. SR-NFPC achieves the lowest error among the compared methods on all five tasks.

Table II makes the trade-off explicit. The proposed controller has the lowest average Wasserstein distance among the compared methods, with average control energy between those of the potential-field controller [2] and the consensus controller [3], [17]. The no-control baseline confirms that diffusion alone is not enough to recover the target geometries.

Effects of the Shared Representation

Table III shows that, on the transition task, replacing separate density/control networks with a shared representation reduces the parameter count from 17,154 to 2,594 while reducing terminal W2W_2 from 0.0542 to 0.0394 and runtime from 0.0862 s to 0.0621 s. This supports the design choice behind (4)–(12), since the Fokker–Planck equation couples density and control directly.

This comparison supports the use of shared coordinates: the shared model uses fewer parameters and achieves lower terminal W2W_2 and control energy on the reported task.

Conclusions

This paper presented a mean-field formation-transport method with direct online feedback evaluation based on a shared-representation neural Fokker–Planck controller. The

MetricShared mapSeparate maps
Terminal W2W_20.03940.0542
Control energy4.1584.756
Runtime (s)0.06210.0862
Parameter count259417154

Table 3. Shared representation versus separate density/control networks on the transition task.

combined objective uses density residuals to promote consistency with the controlled dynamics and particle costs to specify the target formation. The shared parameterization supports direct feedback evaluation after offline optimization. Future work will extend the controller to obstacle-rich environments, higher-dimensional formations, and stronger approximation guarantees for the particle-based formation cost.

References

  1. [1]M. Dorigo, G. Theraulaz, and V. Trianni, “Swarm robotics: Past, present, and future [point of view],” Proceedings of the IEEE, vol. 109, no. 7, pp. 1152–1165, 2021.DOI
  2. [2]E. Rimon and D. E. Koditschek, “Exact robot navigation using artificial potential functions,” IEEE Transactions on Robotics and Automation, vol. 8, no. 5, pp. 501–518, 1992.DOI
  3. [3]W. Ren and R. W. Beard, Distributed Consensus in Multi-vehicle Cooperative Control: Theory and Applications. Springer, 2008.DOI
  4. [4]J.-M. Lasry and P.-L. Lions, “Mean field games,” Japanese Journal of Mathematics, vol. 2, no. 1, pp. 229–260, 2007.
  5. [5]A. Bensoussan, J. Frehse, and P. Yam, Mean Field Games and Mean Field Type Control Theory. Springer, 2013.DOI
  6. [6]S. Cacace, F. Camilli, and A. Goffi, “A policy iteration method for mean field games,” ESAIM: Control, Optimisation and Calculus of Variations, vol. 27, p. 85, 2021.arxiv.org/abs/2007.04818
  7. [7]A. T. Lin, S. W. Fung, W. Li, L. Nurbekyan, and S. J. Osher, “Alternating the population and control neural networks to solve high-dimensional stochastic mean-field games,” Proceedings of the National Academy of Sciences, vol. 118, no. 31, p. e2024713118, 2021.DOI
  8. [8]T. Li and J.-F. Zhang, “Asymptotically optimal decentralized control for large population stochastic multiagent systems,” IEEE Transactions on Automatic Control, vol. 53, no. 7, pp. 1643–1660, 2008.DOI
  9. [9]Z. Zhou and H. Xu, “Large-scale multiagent system tracking control using mean field games,” IEEE Transactions on Neural Networks and Learning Systems, vol. 33, no. 10, pp. 5602–5610, 2022.DOI
  10. [10]J. Yu, R. Lai, W. Li, and S. Osher, “A fast proximal gradient method and convergence analysis for dynamic mean field planning,” Mathematics of Computation, vol. 93, no. 346, pp. 603–642, 2024.arxiv.org/abs/2102.13260
  11. [11]Z. Zhou and H. Xu, “A novel mean-field game-type optimal control for very large-scale multiagent systems,” IEEE Transactions on Cybernetics, vol. 52, no. 6, pp. 5197–5208, 2022.
  12. [12]S. Liu, X. Chen, and X. Di, “Scalable learning for spatiotemporal mean field games using physics-informed neural operator,” Mathematics, vol. 12, no. 6, p. 803, 2024.DOI
  13. [13]H. Huang and R. Lai, “Unsupervised solution operator learning for mean-field games,” Journal of Computational Physics, vol. 537, p. 114057, 2025.DOI
  14. [14]A. Gretton, K. M. Borgwardt, M. J. Rasch, B. Schölkopf, and A. Smola, “A kernel two-sample test,” Journal of Machine Learning Research, vol. 13, pp. 723–773, 2012. [Online]. Available: https://jmlr.org/papers/v13/gretton12a.htmlDOI
  15. [15]J. Simon, “Compact sets in the space Lp(0,T; B),” Annali di Matematica Pura ed Applicata, vol. 146, pp. 65–96, 1986.
  16. [16]J.-L. Lions and E. Magenes, Non-Homogeneous Boundary Value Problems and Applications. Springer, 1972, vol. 1.
  17. [17]R. Olfati-Saber, “Flocking for multi-agent dynamic systems: Algorithms and theory,” IEEE Transactions on Automatic Control, vol. 51, no. 3, pp. 401–420, 2006.

Paper details

vlnc:W_rmj4hcnm
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC0-1.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents