{'fraction_non_alphanumeric': 0.018433179723502304, 'fraction_numerical': 0.001152073732718894, 'mean_word_length': 5.533834586466165, '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}}
Dynamically feasible task-constrained motion planning with moving obstacles

We present a randomized algorithm for planning dynamically feasible motions of robots subject to geometric task constraints in the presence of moving obstacles. The proposed method builds upon our previous results on task-constrained motion planning with moving obstacles. With respect to our previous formulation, the inclusion of bounds on the available actuator torques leads to the adoption of an acceleration-level motion generation scheme. Therefore, the new planner must operate in a task-constrained state space extended with time. The generated trajectories are collision-free, obey velocity and torque bounds, and satisfy the task constraint with arbitrary accuracy. The effectiveness of the proposed approach is shown by results on various scenarios involving a 7-dof manipulator.