The random population control decision problem asks for the existence of a controller capable of gathering almost-surely a whole population of identical finite-state agents simultaneously in a final state. The controller must be able to satisfy this requirement however large the population, provided that it is finite. The problem was previously known to be decidable and EXPTIME-hard. This paper tackles the exact complexity: the problem is EXPTIME-complete.