In applications such as environmental monitoring, search and rescue operations, mobile wireless networks, a team of robots is asked to perform a task over a large space. Distributed environment-partitioning algorithms consist of control and communication laws for individual robots such that the team divides a space into regions in order to optimize the quality of service provided. Coverage control algorithms additionally optimize the position of the agent inside of the region. In this work we look at two existing partitioning and coverage control; one-to-base-station and pairwise partitioning. These algorithms are novel in that the communication is distributed (i.e., robots need only communicate with neighboring agents), and in the fact that coverage cost is improved after every step of the algorithm.  In our work we accomplish two main tasks. First, we simulate the algorithms and confirm their effectiveness under “ideal” conditions.  Second, we implement the protocol on physical hardware (3 mobile robotic agents) to validate robustness of theoretical framework in real-world application. Successful implementations showed that in-fact the algorithms performed robustly on real hardware with no modification needed.