The generalized quantum Stein's lemma remains valid for almost-iid states via a new continuity bound on relative entropy of entanglement with respect to quantum Wasserstein distance.
C ∗: A coverage path planning algorithm for unknown environments using rapidly covering graphs
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
PECMAN lets multiple robots share perception and morph their individual RRT* trees to replan paths in unknown environments, reducing team completion time by up to 52 percent with near-100 percent success in 28,000 simulations and real-robot tests.
citing papers explorer
-
Robust generalized quantum Stein's lemma
The generalized quantum Stein's lemma remains valid for almost-iid states via a new continuity bound on relative entropy of entanglement with respect to quantum Wasserstein distance.
-
PECMAN: Perception-enabled Collaborative Multi-Agent Navigation in Unknown Environments
PECMAN lets multiple robots share perception and morph their individual RRT* trees to replan paths in unknown environments, reducing team completion time by up to 52 percent with near-100 percent success in 28,000 simulations and real-robot tests.