Dynamic Optimal Transport with optimal star shaped graphs
Abstract: We study an optimal transport problem in a compact convex set $\Omega\subset\mathbb{R}d$ where bulk transport is coupled to dynamic optimal transport on a metric graph $ \mathsf{G} = (\mathsf{V},\mathsf{E})$ which is embedded in $\Omega$. We prove existence of solutions for fixed graphs. Next, we consider varying graphs, yet only for the case of star-shaped ones. Here, the action functional is augmented by an additional penalty that prevents the edges of the graph to overlap. This allows to preserve the graph topology and thus to rely on standard techniques in Calculus of Variations in order to show existence of minimizers.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.