I'm wondering what the correct term for an algorithm that is probabilistically complete is. An algorithm is probabilistically complete if the probability of finding a solution, should a solution exist, approaches one as the runtime goes to infinity.
A motion planner such as PRM will eventually find a solution if one exists, but cannot show that that no motion exists. This would be similar to an algorithm that semi-decides a problem, but the "yes" output is a trajectory, so it's not really a decision problem. Is there an accepted term for such algorithms? (Something like, PRM is semi-deciding)?