Leveraging area bounds information for autonomous decentralized multi-robot exploration

The D-SBPF approach yields a simple potential field control strategy for all robots but nonetheless has good dispersion and overlap performance in exploring areas with convex geometry while avoiding potential minima. Both simulation and robot experimental results are included as evidence, and performance, speedup and efficiency metrics for each are presented.