{'fraction_non_alphanumeric': 0.012658227848101266, 'fraction_numerical': 0.0, 'mean_word_length': 5.228346456692913, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An energy saving robot mobility diversity algorithm for wireless communications

There are emerging applications in which a robot must explore some physical area or do some surveillance task and then communicate with a base station (BS) to transmit its information. Often this working environment has rich scattering and so the wireless channel will experience small scale fading. In this paper we develop an algorithm whereby the robot visits a specific number of locations with a pre-determined geometry, and transmits its data from one of these locations in an optimum way that minimizes the overall energy consumption. We show analytically (and via simulation) that this approach can both reduce the total energy required and obtain a diversity gain for robotic wireless communications.