A Dubins-distance-based task allocation and path planning method for fixed-wing UAV swarms achieves sub-millisecond replanning, with total path length about 9.57% above a simulated-annealing baseline.
Erd\H{o}s distinct distances in hyperbolic surfaces
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In this paper, we introduce the notion of "geodesic cover" for Fuchsian groups, which summons copies of fundamental polygons in the hyperbolic plane to cover pairs of representatives realizing distances in the corresponding hyperbolic surface. Then we use estimates of geodesic-covering numbers to study the distinct distances problem in hyperbolic surfaces. Especially, for $Y$ from a large class of hyperbolic surfaces, we establish the nearly optimal bound $\geq c(Y)N/\log N$ for distinct distances determined by any $N$ points in $Y$, where $c(Y)>0$ is some constant depending only on $Y$. In particular, for $Y$ being modular surface or standard regular of genus $g\geq 2$, we evaluate $c(Y)$ explicitly. We also derive new sum-product type estimates.
citation-role summary
citation-polarity summary
fields
cs.RO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Dynamic real-time multi-UAV cooperative mission planning method under multiple constraints
A Dubins-distance-based task allocation and path planning method for fixed-wing UAV swarms achieves sub-millisecond replanning, with total path length about 9.57% above a simulated-annealing baseline.