Discussion

Given a geometrical description of part shape, the planning algorithm is guaranteed to rapidly find a plan. For each of the polygons tested, the algorithm found a plan of length less than the number of polygon edges. Thus we conjecture that the upper bound on plan length can be tightened to . Although we have not been able to prove this for plans that orient the part up to symmetry, we can prove a linear length bound for stochastic parts feeding plans.