{'fraction_non_alphanumeric': 0.02389572773352643, 'fraction_numerical': 0.0, 'mean_word_length': 5.518867924528302, '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 error-sensitive Q-learning approach for robot navigation

Reinforcement learning can capture notions of optimal behavior occurring in natural systems. In the context of reinforcement learning, the learning rate controls how fast we modify our estimates. Generally Q-learning approach leverages the temporal-difference (TD) error to regulate Q-value, while utilizing a constant or decreasing learning rate, e.g., linear or polynomial learning rate, throughout the agent's life. Learning algorithm with polynomial learning rate learns faster at the cost of inferior trade-off between exploration and exploitation. None of them is evaluated based on the TD error. Whereas that cannot psychologically reflect the agent's true learning progress with unnecessary extra training episodes and exploration. This paper proposes an error-sensitive learning rate mechanism for Q-learning algorithm termed as (ESQL) to achieve better mitigation and faster learning. The agent is endowed sensibility to the TD error summed over the episodes. The derived method is implemented with indoor robot navigation task simulation in a stationary grid world environment. Experimental results are presented showing that ESQL approach achieves faster learning and latent better trade-off between exploration and exploitation compared with both constant and decreasing learning rate Q-learning approaches.