Motion planning for highly-dynamic unconditioned reflexes based on chained Signed Distance Functions

TL;DR

This paper introduces a real-time motion planning algorithm for manipulators that mimics highly-dynamic unconditioned reflexes, using chained Signed Distance Functions to quickly generate escape behaviors in dynamic environments.

Contribution

The paper presents a novel online motion planning method based on chained SDFs that enables manipulators to react within 1ms to dynamic obstacles, surpassing human reflex times.

Findings

Faster path solutions with lower time and shorter trajectories in static scenarios.

Reliable pursuit of dynamic targets and obstacle avoidance within 1ms.

Outperforms existing methods in reaction speed and efficiency.

Abstract

The unconditioned reflex (e.g., protective reflex), which is the innate reaction of the organism and usually performed through the spinal cord rather than the brain, can enable organisms to escape harms from environments. In this paper, we propose an online, highly-dynamic motion planning algorithm to endow manipulators the highly-dynamic unconditioned reflexes to humans and/or environments. Our method is based on a chained version of Signed Distance Functions (SDFs), which can be pre-computed and stored. Our proposed algorithm is divided into two stages. In the offline stage, we create 3 groups of local SDFs to store the geometric information of the manipulator and its working environment. In the online stage, the pre-computed local SDFs are chained together according the configuration of the manipulator, to provide global geometric information about the environment. While the point clouds of the dynamic objects serve as query points to look up these local SDFs for quickly generating escape velocity. Then we propose a modified geometric Jacobian matrix and use the Jacobian-pseudo-inverse method to generate real-time reflex behaviors to avoid the static and dynamic obstacles in the environment. The benefits of our method are validated in both static and dynamic scenarios. In the static scenario, our method identifies the path solutions with lower time consumption and shorter trajectory length compared to existing solutions. In the dynamic scenario, our method can reliably pursue the dynamic target point, avoid dynamic obstacles, and react to these obstacles within 1ms, which surpasses the unconditioned reflex reaction time of humans.