Sampling-based algorithms are a class of algorithms used primarily in robotics and computer graphics for solving high-dimensional path planning problems. They work by randomly sampling the search space and constructing a graph or tree that approximates the solution space, making them particularly effective for complex, non-linear environments where traditional methods struggle.