One practical application of $\int |\nabla u|^p\to \min$ is in image denoising. If $u$ is the light intensity, then noise contributes to $|\nabla u|$. The easiest thing to do computationally is to decrease $\int |\nabla u|^2$, which more or less amounts to Gaussian smoothing. Unfortunately, $\int |\nabla u|^2$ penalizes not only noise, but also sharp edges, which become blurry in the process.
Taking $p=1$ instead of $p=2$, we arrive at TV denoising, which preserves edges. The drawback here is that the total variation functional is not strictly convex (bad for minimum search) and the associated Euler-Lagrange equation $\nabla \cdot (|\nabla u|^{-1}\nabla u)$ is awfully degenerate. One way around this is to minimize $\int \alpha |\nabla u| + |u-u_0|^2$, with $u_0$ being the noisy image. This addition of the quadratic term makes the optimization process more palatable: see here, for example.
On the opposite extreme, for large $p$, the $p$-Laplacian is used to model growing/collapsing sandpiles.