In this work we assume that crowd is in motion
within a bounded area with a target to reach. Pedestrians dynamics
is modelled under a multiscale point of view using a mathematical
technique, stemming from measure and optimal transport
theory. The pedestrian velocity consists of two components: the
desired and the interaction velocity. Fixing a boundary condition
and some parameters as the initial density and the exit point,
we face the problem of finding the obstacle configuration which
minimizes the pedestrian average exit time. Two algorithms are
proposed for this purpose: the exhaustive exploration algorithm
that compares the average exit time computed for all possible
scenarios, and an algorithm of steepest descent type
