I. Introduction
Task and Motion Planning (TAMP) usually combines a discrete search on a symbolic, logical level with a geometric planner. Discrete search is employed to find the high-level symbolic action sequence, which, in turn, informs the geometric planner to solve for a feasible motion path that satisfies the goal state. Due to the huge computational overhead of solving geometric problems and the combinatorial complexity of discrete decisions, solving a TAMP problem often requires a large amount of computation [1]–[4].