  We are given $N$ autonomous mobile robots inside a bounded region. The robots
are opaque which means that three collinear robots are unable to see each other
as one of the robots acts as an obstruction for the other two. They operate in
classical \emph{Look-Compute-Move} (LCM) activation cycles. Moreover, the
robots are oblivious except for a persistent light (which is why they are
called \emph{Luminous robots}) that can determine a color from a fixed color
set. Obliviousness does not allow the robots to remember any information from
past activation cycles. The Uniform Partitioning problem requires the robots to
partition the whole region into sub-regions of equal area, each of which
contains exactly one robot. Due to application-oriented motivation, we, in this
paper consider the region to be well-known geometric shapes such as rectangle,
square and circle. We investigate the problem in \emph{asynchronous} setting
where there is no notion of common time and any robot gets activated at any
time with a fair assumption that every robot needs to get activated infinitely
often. To the best of our knowledge, this is the first attempt to study the
Uniform Partitioning problem using oblivious opaque robots working under
asynchronous settings. We propose three algorithms considering three different
regions: rectangle, square and circle. The algorithms proposed for rectangular
and square regions run in $O(N)$ epochs whereas the algorithm for circular
regions runs in $O(N^2)$ epochs, where an epoch is the smallest unit of time in
which all robots are activated at least once and execute their LCM cycles. The
algorithms for the rectangular, square and circular regions require $2$ (which
is optimal), $5$ and $8$ colors, respectively.
