“…Similarly, sampling-based methods, motivated by the typically high-dimensional configuration spaces arising from combined task and motion planning (Garrett et al, 2018), can achieve asymptotic optimality (Vega-Brown and Roy, 2018), but no guarantee of convergence (or task completion) under partial prior knowledge or limited sampling, and their probabilistic completeness guarantees can be slow to be realized in practice when confronting settings with narrow passages (Noreen et al, 2016), even in 2D environments. More importantly, our recent parallel work (Vasilopoulos et al, 2020), that uses the reactive planning principles presented in this article, shows that existing state-of-the-art path replanning algorithms for unknown 2D environments (Otte and Frazzoli, 2015) can cycle repeatedly in the presence of both unforeseen obstacles and narrow passages as they search for alternative openings, before eventually (and after protracted cycling) reporting failure (incorrectly) and halting.…”