In order to enhance the efficiency of the federating for disjoint segments method in multi-robot wireless sensor networks (WSNs), this paper presents a solution for optimizing the federating for disjoint segments in WSNs based on partition energy balance, along with an approximate algorithm to address this optimization problem. Firstly, this research incorporates relevant model assumptions and symbol definitions to propose a sophisticated connection mechanism. Drawing inspiration from divide-and-conquer and local priority approaches, the proposed mechanism ensures energy balance within the network. Furthermore, a round-robin iterative process is introduced to iteratively refine the method, which is then precisely formulated using mathematical representations. Secondly, a relay deployment algorithm is designed using heuristic algorithms, taking into account the energy balance of the robots. Finally, through comparative experiments conducted with existing methods, the results demonstrate the effectiveness of the proposed approach. Notably, the approach successfully conserves connection costs while maintaining energy balance and significantly improves the efficiency of the federating for disjoint segments method in WSNs and demonstrates its capability to prolong the overall lifespan of the network. Overall, this research contributes a comprehensive solution for optimizing the federating for disjoint segments method in multi-robot WSNs.