Sampling-based Planning

In the previous section, we introduced how graphs can be searched. In this section, we discuss practical, and very commonly used strategies for building these graphs.

ince, in general, the configuration space is large and potentially high dimensional, we don’t want to search it exhaustively. Instead, it turns out that we can use strategies to sample it and then construct a graph whose edges constitute collision-free paths.