—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
The doubling constant of a metric space (X, d) is the smallest value λ such that every ball in X can be covered by λ balls of half the radius. The doubling dimension of X is the...
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...