{'fraction_non_alphanumeric': 0.019157088122605363, 'fraction_numerical': 0.0, 'mean_word_length': 5.0813953488372094, '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}}
Dynamic programming solution for a class of pursuit evasion problems: the herding problem

A herding dog and sheep problem is studied where the agent "dog" is considered the control action for moving the agent "sheep" to a fixed location using the dynamics of their interaction. The problem is solved for the deterministic case using dynamic programming. Proofs are provided for the correctness of the algorithms. The algorithm is analyzed for its complexity. A software package developed for experimentation is described.