Reactive collision-free motion generation in joint space via dynamical systems and sampling-based MPC

Abstract

Dynamical system (DS) based motion planning offers collision-free motion, with closed-loop reactivity thanks to their analytical expression. It ensures that obstacles are not penetrated by reshaping a nominal DS through matrix modulation, which is constructed using continuously differentiable obstacle representations. However, state-of-the-art approaches may suffer from local minima induced by non-convex obstacles, thus failing to scale to complex, high-dimensional joint spaces. On the other hand, sampling-based Model Predictive Control (MPC) techniques provide feasible collision-free paths in joint-space, yet are limited to quasi-reactive scenarios due to computational complexity that grows cubically with space dimensionality and horizon length. To control the robot in the cluttered environment with moving obstacles, and to generate feasible and highly reactive collision-free motion in robots’ joint space, we present an approach for modulating joint-space DS using sampling-based MPC. Specifically, a nominal DS representing an unconstrained desired joint space motion to a target is locally deflected with obstacle-tangential velocity components navigating the robot around obstacles and avoiding local minima. Such tangential velocity components are constructed from receding horizon collision-free paths generated asynchronously by the sampling-based MPC. Notably, the MPC is not required to run constantly, but only activated when the local minima is detected. The approach is validated in simulation and real-world experiments on a 7-DoF robot demonstrating the capability of avoiding concave obstacles, while maintaining local attractor stability in both quasi-static and highly dynamic cluttered environments.

1. Introduction

Modern robotic systems are expected to operate in a variety of environments and interact with static and dynamic objects, as well as other agents, such as humans, animals, and other robots. While direct contact may be necessary to accomplish certain tasks, almost any motion requires a reaching phase where the robot must move its end-effector to a desired location while avoiding collisions between the robot body and obstacles or and other agents. For future reference, we assume that the obstacles in the environment are moving unpredictably, and reactive motion assumes feasible plan generation on frequencies above 100 Hz.

Techniques to generate collision-free motion can be categorized into two paradigms: offline and feedback/reactive planning (LaValle, 2006). In the former, the problem is divided into two phases—offline planning of collision-free paths (typically sampling-based algorithms or trajectory optimization) followed by trajectory execution (Spong et al., 2020). However, depending on the complexity of the environment and the dimensionality of the robot configuration space, offline planning may take a significant amount of time, which hinders operation in dynamic environments with moving obstacles and active agents.

Early works in reactive collision-free motion generation rely on local alternation of the system’s dynamics in the vicinity of obstacles via Artificial Potential Fields (Khatib, 1986) or navigation functions (Rimon and Koditschek, 1992). Such classical feedback motion planning techniques, although reactive, are vulnerable to local minima and limited to parametric obstacle representations such as convex (spheres, ellipsoids, etc) or star-shaped obstacles. To ensure reactive collision-free motions with convergence guarantees the modulated dynamical system (DS) based approach was introduced by Khansari-Zadeh and Billard (2012). In this approach, the nominal robot motion is generated by a DS that defines a vector field in the task space for end-effector motion (in this case, an additional Inverse Kinematics controller is required) or in joint space to describe the whole-body state-dependent motion law. The proposed modulation locally changes this law in order to navigate around obstacles.

Local modulation of DS for obstacle avoidance is performed with relatively low computation cost, however, convergence guarantees can only be ensured for conservative obstacle types such as convex (Khansari-Zadeh and Billard, 2012) or star-shaped (Billard et al., 2022; Huber et al., 2019). Further, a saddle point local minimum trajectory still remains for such parametric shapes. These shortcomings limit the applicability of reactive DS modulation approaches to complex spaces with arbitrarily shaped obstacles that are hard to convexify such as joint space of redundant manipulators.

Receding horizon path planning approaches such as Model Predictive Control (MPC), can be used to generate collision-free trajectories in real-time (Erez et al., 2013; White et al., 2022). However, these methods are often computationally expensive, and finding a balance between computation speed and trajectory quality can be challenging (Bhardwaj et al., 2022). The computational complexity of MPC methods grows cubically with state dimensionality and time horizon (Richter et al., 2012), which can be prohibitive for cases when the robot with a high number of degrees of freedom (DoF) is required to reactively navigate in cluttered environments while avoiding obstacles.

1.1. Contributions

In this paper, we aim to combine the advantages of DS motion planning and sampling-based MPC to allow for instantaneous obstacle avoidance and swift feasible trajectory generation for any type of environment. We adopt a modulated DS approach (Billard et al., 2022; Khansari-Zadeh and Billard, 2012) as a primary motion generator and empower it with a popular sampling-based MPC algorithm known as Model Predictive Path Integral (MPPI) control (Williams et al., 2017), to navigate the robot away from the local minima caused by concave obstacles. We prove theoretically that the impenetrability and local convergence properties of the modulated DS are preserved with the MPC-based additive terms. Additionally, we focus on the challenging problem of joint space control and validate the proposed method using a 7-DoF robot. Example of a reaching task executed by the robot is shown in Figure 1. Apart from presenting a simulated benchmark, we demonstrate the collision avoidance controller running at 500 Hz (on a modern laptop CPU) with a real robot, generating reaching motions while avoiding the human that tries to obstruct the robot reaching motion with a concave arm trap. The source code for running the presented algorithm in simulation and on real robot is available online. ¹

Figure 1.

The robot begins in the blue state (start joint configuration) and must reach the attractor configuration (green state) while avoiding a concave task-space obstacle represented by a set of red spheres. The nominal robot dynamics is a linear motion in joint space towards the attractor. The standard modulated DS approach (Khansari-Zadeh and Billard, 2012) exhibits a local minimum (represented by the red robot state) in this scenario. Our proposed method is able to reactively navigate around the obstacle and reach the attractor successfully.

1.2. Paper organization

In Section 2, we summarize related works for task space and joint space robot motion planning in the presence of obstacles. Section 3 presents the mathematical problem formulation, including assumptions, definitions, and goals of this paper. In Section 4, we present the background of the DS modulation method, as it is the basis of our approach. Our method formulation is then presented in Section 5. Further, Section 6 introduces the basics of the state-of-the-art MPPI algorithm, and describes our approach to leveraging optimization to find optimal DS modulation strategies. Section 7 outlines various implementation details, and presents our approach to implementing the hybrid controller combining modulated DS and MPPI methods. Finally, Section 8 presents the validation of the method in simulation and on a real robot.

2. Related work

In this paper, we consider the generation of feasible paths in the configuration space of a robotic manipulator. For manipulators with revolute joints, the configuration space coincides with the robot’s joint space. In this section we cover the state-of-the-art in motion planning in high-dimensional spaces, as well as collision detection techniques.

2.1. Offline path planning

A hierarchical approach, in which a feasible path is first generated offline and then executed by a high-frequency controller, can be considered the dominant paradigm in robotic systems. Several sampling-based methods exist to generate paths in the high-dimensional joint space of the robot, such as Rapidly-exploring Random Trees, Probabilistic Roadmaps, and their variants (Kavraki et al., 1996; Kuffner and LaValle, 2000; Sandakalum and Ang Jr., 2022). These methods provide probabilistic completeness, but their computation and memory costs are often significant (Kingston et al., 2018). The path generation time can range from seconds to minutes, depending on the complexity of the environment and the system’s dimensionality (Chase et al., 2021). Although these methods are suitable for many applications, they may not be the best choice for rapidly changing environments that require online replanning at frequencies exceeding 100 Hz. Trajectory optimization methods, such as CHOMP (Ratliff et al., 2009) and TrajOpt (Schulman et al., 2014), can optimize for feasible trajectories within a tight, frequently sub-second time budget, providing control frequency of 1–5 Hz. However, quick optimization convergence requires a good initial guess for the trajectory (Zucker et al., 2013), which can be problematic in a changing environment. Due to the amount of time needed to calculate a trajectory, these methods are unsuitable to use in highly dynamic environments with moving obstacles, and are mainly applied in a static environments with pre-computed distance fields (Yang et al., 2019).

2.2. Receding horizon path planning

An approach that differs from hierarchical model involves repetitive solving of a nonlinear optimization problem with a receding horizon. It encapsulates tasks for the system and system dynamics as constraints in nonlinear optimization problem and generates dynamically feasible trajectories online. Such methods have wide range of applications, including humanoid robot control (Erez et al., 2013) and autonomous driving (Frasch et al., 2013). The main limitation of MPC methods lies in polynomial scaling with number of parameters in the optimization. Typically, the computational cost has complexity O (n³), where n is number of parameters determined by number of states, control inputs, and time horizon (Domahidi et al., 2012; Richter et al., 2012). Thus, the operating frequency of these methods typically does not exceed 20 Hz for high-DoF robots. As this approach is unable to provide replanning at 100 Hz rate, it cannot fulfill the objectives of this paper. However, such methods may be applied in a hybrid controller scheme to generate high-level motion policies (Hansel et al., 2023).

Recent developments in computational hardware, such as GPU chips allowing for massive parallelization, have enabled a new generation of optimization methods that rely on sampling-based exploration for approximating the optimal input distribution (Williams et al., 2017). Such methods are capable of handling complex dynamics and non-differentiable cost functions. For instance, Bhardwaj et al. (2022) use MPPI approach and demonstrate online trajectory optimization via sampling-based model predictive control operating at 125 Hz on a 7 DoF robotic manipulator. This method can be considered reactive, as it is capable of quickly moving the robot away from collisions if an obstacle moves towards the manipulator. At the same time, thanks to trajectory planning with a look-ahead horizon, this method can navigate relatively complex environments. However, the method may still require some specific sampling heuristics, or increased number of samples to find paths in cluttered environments (Sacks and Boots, 2022; Yoon et al., 2022). We use MPPI in our method in combination with sampling in locally obstacle-tangent space to achieve improved path-planning.

2.3. Reactive planning

Similar to the artificial potential fields approach (Khatib, 1986) mentioned in the introduction, control-barrier functions (CBF) method can be used to reactive motion generation (Singletary et al., 2021). However, CBF requires solving a QP problem on each iteration, thus reducing scalability to higher dimensions, such as robot joint space.

Dynamical systems, which represent a pre-defined state-dependent law acquired by learning from demonstrations or manually defined by the user, are another classical method for robot motion generation (Gribovskaya et al., 2011; Khansari-Zadeh and Billard, 2011; Kronander et al., 2015). They can encapsulate complex behaviors and guide the robot to follow the desired trajectory without extensive real-time computations (Figueroa and Billard, 2018; Figueroa et al., 2020; Shavit et al., 2018a). While DS approaches generally do not consider obstacles, an extension was proposed to enable navigation around convex (Khansari-Zadeh and Billard, 2012) and star-shaped (Huber et al., 2019) obstacles. This method relies on obstacle-related information, such as distance function and normal direction, to modulate the DS close to the obstacles. While many objects can be approximated with convex and star shapes, such approximations may be too restrictive in some cases. We build upon this method as it allows for reactive any-frequency collision avoidance.

In recent years, Riemannian Motion Policies (RMPs) (Ratliff et al., 2018) have emerged as an alternative to modular reactive motion generation, formulated as second-order DS with associated Riemannian metrics in various task spaces. For each objective or constraint, for example, target reaching, orientation control, obstacle avoidance, redundancy resolution, and joint limits, an individual RMP must be designed. To combine them into a global reactive motion policy while ensuring geometric consistency Cheng et al. (2018) introduced RMPflow, a computational graph representing tree-structured task-maps of RMPs. The global motion policy synthesized by RMPflow is Lyapunov-stable if the underlying policies (subtasks) are a class of stable RMPs known as Geometric Dynamical Systems (GDS), the closure property relating to task consistency is preserved and task priorities are properly tuned. Such restrictions may lead to suboptimal performance and unnecessary energy consumption by the system. To alleviate this, Li et al. (2019) offer a relaxation of the GDS assumption and reinterpretation of the stability guarantees of RMPflows through the lens of control lyapunov functions. Van Wyk et al. (2022) further improved RMPflow by introducing geometric fabrics, which utilize Finsler geometries and bending terms to enhance expressivity of subtasks while ensuring stability and convergence to a local solution and transform trees to combine them. In a similar vein, Composable Energy Policies (CEP) (Urain et al., 2021) offer modular reactive motion generation by optimizing over products of stochastic policies, effectively resolving conflicts between multiple motion objectives via a Bayesian network energy tree.

While the latter methods offer desirable performance and stability guarantees, they require the construction of graphs or trees or entail multi-objective optimization, which can be computationally intensive compared to our modulation approach—which is a closed form solution that only requires local reshaping of a nominal DS. Furthermore, when performing collision avoidance of non-convex boundaries all of these methods are prone to local minima and must resort to adhoc environment heuristics (as in Van Wyk et al. (2022)) or learning the adhoc obstacle avoidance subtask behavior (as in Urain et al. (2021)). In contrast, the modulated DS framework offers a general approach for obstacle avoidance, avoiding the need for complex constructions, intensive optimizations or adhoc heuristics. We achieve couple the modulated DS approach with MPPI control, to achieve a practical and intuitive, yet powerful solution for reactive motion planning.

Our proposed approach shares similarities with the hybrid planning architectures introduced by Löw et al. (2021) and Hansel et al. (2023) that combine local reactive motion policies with longer horizon planning schemes. The former approach, named PROMPT incorporates probabilistic movement primitives (ProMPs) (Paraschos et al., 2013) in both sampling and optimization based trajectory planners to generate high quality feasible paths. This is achieved by leveraging the constraint conditioning and blending capabilities of ProMPs. Nevertheless, this approach is not applicable to reactive scenarios with highly dynamic obstacles nor is it scalable to high-dimensional spaces as its computational complexity increases relative to state space dimensionality, planning horizon and number of samples. This is evidenced by experiments reporting 1 Hz of planner runtime for 2D state spaces. The hierarchical policy blending as inference (HiPBI) approach (Hansel et al., 2023), built upon the RMPflow framework, addresses local minima through an online sampling-based planner. It reformulates RMPs as Gaussian policies and blends them using the product of experts technique. To dynamically optimize weights, a high-level, sampling-based online planner operates on the parameter space, mitigating local minima seen in the standard RMPflow approach. While our approach shares similarities with HiPBI, latter is constrained by RMPs, requiring specific subtask policy construction and a prior distribution assumption. Although HiPBI simplifies task-tree construction and weight tuning, it remains computationally intensive, reporting a 10 Hz planning frequency for a 7DoF manipulator robot. In contrast, our approach uses modulated DS for reactive motion policies, ensuring stability guarantees and achieving a 500 Hz execution rate. This choice enhances collision avoidance and reactivity, resulting in natural trajectories. The coupling with the high-level MPPI controller further enhances local minima free navigation in complex scenarios.

2.4. Differentiable collision checking

Although all the methods mentioned above can consider various constraints for generating paths, collision avoidance is usually the most critical constraint in motion planning. Importantly, the collision checking routine (and corresponding gradient computation, where needed) often takes up the majority of computation time (Pan and Manocha, 2016). Based on the implementation, speedups can be achieved by simplifying collision shapes (by means of convex hulls, geometric primitives, or spheres) (Stasse et al., 2008) or by pre-computing the static environment (Zucker et al., 2013). Recently, there were developments in approximating the distance functions using Machine Learning (ML) based methods (Koptev et al., 2021; Liu et al., 2022; Salehian et al., 2018; Zhi et al., 2022) for efficient use in robot control. In this paper, we rely on our previous work (Koptev et al., 2023), which learns a signed distance as a function of robot joint states and 3D points in the robot’s environment. Properties such as batched evaluation or continuous differentiability enable efficient use of this function in the proposed method.

3. Problem definition

3.1. Assumptions and definitions

In this paper, we consider a robot with K physical links and d degrees of freedom (DoF). The joint state of the robot is defined as a vector of joint angles $\mathit{q}=\left[q^1,\dots ,q^d\right]\in {\mathbb{R}}^d$ . Additionally, it is assumed that all the joints of the robot are revolute and are subject to joint limits, q ∈ [ q _min , q _max ]. The desired robot motion is defined by a continuous time-invariant nominal DS of the following form:

$\stackrel{.}{\mathit{q}}=\mathit{f}\left(\mathit{q}\right),$

(1)which defines a state-dependent vector field guiding the robot state towards a goal (attractor ${\mathit{q}}^{*}\in {\mathbb{R}}^d$ ). The function f ( q ) is autonomous, that is, the law governing the evolution of the system depends solely on the system’s current state q and not on time. While the system defined in (1) is time-invariant, the system state q = q (t) changes over time. For better readability, time-dependency of the state variable is omitted in the remainder of the text.

We assume that the nominal DS f ( q ) is known and globally asymptotically stable (G.A.S.) to the attractor q * wrt. to a Lyapunov function $V\left(\mathit{q},{\mathit{q}}^{*}\right):{\mathbb{R}}^d\to \mathbb{R}$ . Such G.A.S. DS can be designed by users (Salehian et al., 2018), or learned from a demonstration (LfD) (Figueroa and Billard, 2018; Khansari-Zadeh and Billard, 2011; Kronander et al., 2015; Shavit et al., 2018b), and can be of arbitrary form (e.g., linear, nonlinear). While the nominal DS may implicitly avoid collisions in some scenarios, such as when an LfD-generated trajectory avoids static obstacles, it is not always guaranteed that it will do so in all scenarios. As shown by Wang et al. (2022), DS-based LfD can ensure reachability to a target q *, but cannot ensure invariance to unsafe boundaries, unless a boundary function is explicitly defined and enforced through modulation or control-barrier functions (Taylor et al., 2020).

Obstacles (static or dynamic) can be defined as a set of points $\mathcal{O}\subset {\mathbb{R}}^3$ in the workspace of the robot. We assume that obstacles are known and are represented either by a point cloud or by a set of spheres. Moreover, we consider obstacles of arbitrary shape, including concave ones. Based on previous work (Koptev et al., 2023), we define the vector-valued function $\mathbf{\Gamma }\left(\mathit{q},\mathit{y}\right):{\mathbb{R}}^{d+n}\to {\mathbb{R}}^K$ , which represents minimal distances between an n-dimensional point $\mathit{y}\in \mathcal{O}$ and each link (k = 1, …, K) of the robot in configuration q ; that is, Γ( q , y ) = [Γ₁, …, Γ _K ]. Function Γ( q , y ) is differentiable, and its partial derivative with respect to q results in the following Jacobian matrix:

$\begin{array}{ll}{\text{Jac}}_q\left(\mathbf{\Gamma }\left(\mathit{q},\mathit{y}\right)\right)& =\left[\begin{array}{ccc}\frac{\partial {\mathrm{\Gamma }}_1\left(\mathit{q},\mathit{y}\right)}{\partial q_1}& \dots & \frac{\partial {\mathrm{\Gamma }}_K\left(\mathit{q},\mathit{y}\right)}{\partial q_1}\\ ⋮& \ddots & ⋮\\ \frac{\partial {\mathrm{\Gamma }}_1\left(\mathit{q},\mathit{y}\right)}{\partial q_d}& \dots & \frac{\partial {\mathrm{\Gamma }}_K\left(\mathit{q},\mathit{y}\right)}{\partial q_d}\end{array}\right]\end{array}$

(2)where each k-th column vector of ${\text{Jac}}_q\left(\mathbf{\Gamma }\left(\mathit{q},\mathit{y}\right)\right)$ corresponds to the gradient of each k-th scalar distance function Γ _k ( q , y ) with respect to q . For simplified notation, we use

$\mathrm{\Gamma }\left(\mathit{q}\right)={\min }_{\mathit{y}\in \mathcal{O}}\hspace{0.17em}{\min }_{k=1,\dots ,K}\hspace{0.17em}{\mathrm{\Gamma }}_k\left(\mathit{q},\mathit{y}\right),$

(3)and denote the corresponding column of ${\text{Jac}}_q\left(\mathbf{\Gamma }\left(\mathit{q},\mathit{y}\right)\right)$ as ∇Γ( q ). In this way, $\mathrm{\Gamma }\left(\mathit{q}\right):{\mathbb{R}}^{d+n}\to \mathbb{R}$ represents the minimal distance between the robot in configuration q and the nearest obstacle, and ∇Γ( q ) represents the corresponding repulsive gradient in the joint space of the robot. Similarly, we assume the existence of function Γ _self ( q ), which represents the minimal distance between the robot in configuration q and its own links. The gradient of Γ _self ( q ) with respect to q is denoted as ∇Γ _self ( q ). Please refer to our previous work (Koptev et al., 2021, 2023) for more details on learning and applications of such distance functions.

3.2. Goals

The main goal of this paper is to design a modulation algorithm that reshapes f ( q ) from (1) with respect to the task-space obstacles $\mathcal{O}$ defined by Γ( q ) and self-collision boundary defined by Γ _self ( q ), enabling the robot to (a) avoid concave obstacles in joint space while (b) maintaining local stability of the nominal DS (Equation (1)), and a controller capable of (c) computing the required modulation with high frequency to enable avoidance of moving obstacles.

To this end, we aim to leverage the parallelization and differentiability properties of the learned function Γ( q ), by combining the modulation framework (Huber et al., 2019; Khansari-Zadeh and Billard, 2012) with sampling-based model predictive control (Bhardwaj et al., 2022; Williams et al., 2017). The vision is to achieve the desired properties such as local stability of the modulated DS and the ability to reactively avoid moving obstacles of arbitrary shape, within a single unified framework.

4. Background

In this section, we provide the mathematical preliminaries describing the DS modulation method for obstacle avoidance, as it is essential for understanding our approach. We begin in Section 4.1 by introducing the original DS modulation method by Khansari-Zadeh and Billard (2012) that ensures impenetrability of obstacle boundaries, yet suffers from spurious attractor generation. Next, in Section 4.2 we describe the improved approach by Huber et al. (2019) designed to ensure convergence for convex and star-shaped obstacles (a unique subset of non-convex obstacles) almost everywhere except at a single saddle point trajectory. We further interpret this improved method from a controlled system perspective, setting the groundwork for our novel locally deflected obstacle-tangent space dynamics approach, that allows circumnavigation of complex non-convex obstacles in high-dimensional state spaces, detailed in Section 5. For an in-depth description of DS as motion policies and their robotic applications, please refer to (Billard et al., 2022).

4.1. Dynamical system modulation

A nominal Dynamical System, as in equation (1), defines a state-dependent vector field that can be altered, or modulated, by rotating the field with a modulation matrix M (.), where M can depend on different variables. The modulated Dynamical System is then defined as

$\stackrel{.}{\mathit{q}}=\mathit{M}(·)\mathit{f}\left(\mathit{q}\right),$

(4)Depending on the choice of M (.), this DS can exhibit various behaviors. For example, M ( q ) is a matrix-valued function of the system state q , and it can be activated differently in different regions of the state space, reshaping the nominal DS f ( q ). Importantly, if we aim to preserve some stability properties of nominal DS, certain limitations must be applied to the modulation matrix M (.).

When starting from a G.A.S. DS f ( q ), reshaping it with a full rank and locally active matrix M ( q ) only guarantees that the system remains stable (no spurious attractors are introduced but limit cycles can arise) and that trajectories can be kept arbitrarily close to the attractor q *, if they start close enough (which is equal to local asymptotic stability of the attractor) (Kronander et al., 2015).

DS modulation using matrix $\mathit{M}\left(\mathit{q},\mathcal{O}\right)\in {\mathbb{R}}^{d\times d}$ that depends on the obstacles configuration $\mathcal{O}$ , can be used to achieve obstacle avoidance. Further, we omit the matrix M ( q ) dependency on obstacles state $\mathcal{O}$ for a simpler notation, and always assume that M is a function of both state q and obstacle configuration $\mathcal{O}$ . To allow for obstacle avoidance, the following modulation matrix is proposed by Khansari-Zadeh and Billard (2012):

$\mathit{M}\left(\mathit{q}\right)=\mathit{E}\left(\mathit{q}\right)\mathit{D}\left(\mathit{q}\right)\mathit{E}{\left(\mathit{q}\right)}^{-1},$

(5)where M ( q ) is composed through eigenvalue decomposition. In (5), D ( q ) is a diagonal scaling matrix and E ( q ) is an orthogonal matrix defined as

$\mathit{E}\left(\mathit{q}\right)=\left[\begin{array}{llll}\mathit{n}\left(\mathit{q}\right)& {\mathit{e}}_1\left(\mathit{q}\right)& \dots & {\mathit{e}}_{d-1}\left(\mathit{q}\right)\end{array}\right].$

(6)The first column of the matrix E ( q ) consists of the obstacle normal n ( q ). ² The remaining columns, e _i ( q ), form a (d − 1)-dimensional orthonormal basis for the tangent space at the state q . The tangential hyperplane formed by this basis is referred to as the deflection hyperplane by Khansari-Zadeh and Billard (2012). Note that it is not a necessary condition for this basis to be orthonormal. Any basis that forms a tangential hyperplane to the normal n ( q ) and has linearly independent columns is valid. However, by enforcing orthonormality on the basis, we can exploit the fact that E ( q ) becomes orthogonal and E ( q )⁻¹ = E ( q ) ^T , thereby improving numerical stability.

The diagonal matrix D ( q ) is defined as

$\mathit{D}\left(\mathit{q}\right)=\left[\begin{array}{llll}{\lambda }_n\left(\mathit{q}\right)& 0& \dots & 0\\ 0& {\lambda }_{\tau }\left(\mathit{q}\right)& \dots & 0\\ ⋮& ⋮& \ddots & ⋮\\ 0& 0& \dots & {\lambda }_{\tau }\left(\mathit{q}\right)\end{array}\right],$

(7)and is composed of two eigenvalues λ _n ( q ) and λ _τ ( q ) defined as a function of the distance of the system from the obstacle Γ( q ).

While the definition of Γ( q ) may vary, the general idea is that D ( q ) should become identity matrix when the system is far from collisions, λ _n ( q ) should approach 0 as the system is getting closer to collision, and λ _n ( q ) = 0 at the obstacle boundary ${\mathit{Q}}_{\mathcal{O}}$ . In essence, the modulation (5) reshapes the flow of the nominal DS (1) based on proximity to the obstacle, thus allowing obstacle avoidance. Refer to Figures 2 and 3 for 2-dimensional visualization of DS modulation.

Figure 2.

Nominal linear DS motion (equation (1)) of a planar 2-DoF robot. The robot sweeps through the workspace in the absence of obstacles. The task space is visualized on the left, while the joint space is on the right.

Figure 3.

Modulated DS motion (equation (4)) of a planar 2-DoF robot in presence of two circular obstacles (in red). The robot avoids the first obstacle but gets stuck near the second due to the vanishing tangential component after modulation.

However, the collision avoidance properties of such modulation are restricted to a subset of convex obstacles. There is also an edge case within the subset of states located on the obstacle boundary ${\mathit{Q}}_{\mathcal{O}}$ . To ensure obstacle impenetrability by design, λ _n ( q ) = 0 for all $\mathit{q}\in {\mathit{Q}}_{\mathcal{O}}$ , causing the matrix M ( q ) to lose rank and create a nullspace. Consequently, velocities may vanish, leading to the emergence of spurious attractors and destabilization of the system’s dynamics. Figure 3 demonstrates how vanishing tangential component may lead to a local minima, rendering DS modulation framework unable to ensure convergence.

Definition 1

(Neumann boundary condition). Consider an obstacle whose boundary is described by a smooth function Γ( q ) = 0, where $\mathrm{\Gamma }:{\mathbb{R}}^d\to \mathbb{R}$ is a continuously differentiable function $\left({\mathcal{C}}^1\right)$ . Obstacle boundary normal is represented as n ( q ) = ∇Γ( q )/‖∇Γ( q )‖₂. A vector field f ( q ) is not penetrating the obstacle boundary if its projection onto the obstacle normal n ( q ) vanishes on the obstacle’s surface Γ( q ) = 0:

$\mathit{f}{\left(\mathit{q}\right)}^T\mathit{n}\left(\mathit{q}\right)=0\hspace{1em}\forall \mathit{q}:\mathrm{\Gamma }\left(\mathit{q}\right)=0.$

(8)

Definition 1 is derived from (Khansari-Zadeh and Billard, 2012). Nonetheless, this definition is only valid for the continuous case, whereas any robotics application necessitates discretizing the dynamics. Specifically, even for the case of convex obstacles, if the integration timestep δt is sufficiently large, a single iteration could bring the system state inside the obstacle. For concave obstacles, an additional mode of failure arises, in which any motion in the tangential plane will violate the obstacle boundary if the system starts on the obstacle surface. We propose a more general definition of impenetrability for the discretized case. Notably, it is still applicable for continuous dynamics.

Definition 2

(Impenetrability). Consider an obstacle whose boundary is described by isosurface Γ( q ) = 0, where $\mathrm{\Gamma }:{\mathbb{R}}^d\to \mathbb{R}$ . A vector field f ( q ) is not penetrating the obstacle boundary, if for any trajectory { q } _t that starts outside the obstacle boundary, that is, Γ( q ₀) ≥ 0, and evolving according to $\stackrel{.}{\mathit{q}}=\mathit{f}\left(\mathit{q}\right)$ , the following holds: Γ({ q } _t ) ≥ 0, ∀t.

Definition 1 is useful for analyzing the stability properties of modulation. Spurious attractors, which can be can be local minima or saddle points, are induced when the nominal DS and obstacle normal are collinear at the obstacle boundary, that is, |⟨ f ( q ), n ( q )⟩| = ‖ f ( q )‖ and ⟨ f ( q ), e _i ( q )⟩ = 0 holds for all i. Refer to Figure 4 for demonstration of the local minima created with a simple concave obstacle.

Figure 4.

Two-dimensional toy example demonstrating the behavior of the modulated DS in presence of obstacle (blue). The system is linear with stable attractor (red) at (8,0). Orange lines indicate trajectories integrated forward in time. (left) Modulated DS (Khansari-Zadeh and Billard, 2012) has local minima in the concave region of the obstacle. (right) Our method avoids the local minima by adding one navigation kernel with parameters estimated via sampling-based MPC. Green arrow indicates the center ${\widehat{q}}_k$ and the direction ${\widehat{g}}_k$ of the added deflection. Green shaded area shows the kernel activation region.

4.2. Convergence for star-shaped obstacles

An improvement upon the modulation framework for obstacle avoidance to avoid spurious attractors and preserve stability is proposed by Huber et al. (2019, 2022). Instead of using the obstacle normal n ( q ) as the first column of E ( q ), the authors propose to instead use the reference direction $\widehat{\mathit{r}}\left(\mathit{q},{\mathit{q}}^r\right)$ defined as

$\widehat{\mathit{r}}\left(\mathit{q},{\mathit{q}}^r\right)=\frac{{\mathit{q}}^r-\mathit{q}}{\Vert {\mathit{q}}^r-\mathit{q}\Vert },$

(9)where q ^r is a point belonging to the obstacle.

While discarding the orthonormality of the basis E ( q ), this modification allows for the system to avoid obstacles with non-convex boundaries that can be represented as star-shaped obstacles. The reference direction $\widehat{\mathit{r}}\left(\mathit{q},{\mathit{q}}^r\right)$ is not orthogonal to any of the basis vectors e _i , thus $〈\widehat{\mathit{r}}\left(\mathit{q},{\mathit{q}}^r\right),\mathit{f}\left(\mathit{q}\right)〉$ is projected onto tangential space, and there exists a tangential vector flow on the obstacle boundary, alleviating the local minima issue for any point on the boundary expect for a single saddle point when $〈\widehat{\mathit{r}}\left(\mathit{q},{\mathit{q}}^r\right),\mathit{f}\left(\mathit{q}\right)〉$ are collinear.

Interestingly, the improved modulated DS approach using reference direction (9) to construct E ( q ) can be interpreted as a nonlinear control system with the following form:

$\stackrel{.}{\mathit{q}}=\underset{\text{ModulatedDynamics}}{\underbrace{\mathit{M}\left(\mathit{q}\right)\cdot \mathit{f}\left(\mathit{q}\right)}}+\underset{\text{Input}}{\underbrace{\mathit{g}\left(\mathit{q},{\mathit{q}}^r\right)}},$

(10)where g ( q , q ^r ) is a nonlinear function that depends on the current state q and the obstacle reference point q ^r and pushes the robot state away from local minima. This interpretation connects the DS modulation approach to optimal control domain, as the tangent space vector flow can be thought of as a virtual control input applied to the system. Thus, q ^r can be considered a control variable that is forcing the modulation to avoid M ( q )⋅ f ( q ) → 0 at the obstacle boundary.

While (10) alleviates the creation of spurious attractors by inducing additional tangent space velocities through the additive nonlinear function g ( q , q ^r ), such term is difficult to control and scale to high-dimensional problems. Specifically, g ( q , q ^r ) is dependent on the projection of the nominal DS f ( q ) and the placement of reference point q ^r . Finding a suitable q ^r is not trivial for high-dimensional concave obstacles, thus it may be challenging to build an algorithm that guarantees the collision avoidance and convergence in case of multiple complex obstacles. Additionally, this method introduces the need to invert the matrix E ( q ) at every iteration, which can be computationally expensive for high-frequency applications in high-dimensional systems.

5. Locally deflected obstacle-tangent space dynamics

Inspired by the state-input system interpretation introduced in (10), we present our approach for creating meaningful obstacle-tangent deflections that are locally active in the regions of potential local minima of the modulated nominal DS. To alleviate the shortcomings of (Huber et al., 2019; Khansari-Zadeh and Billard, 2012), we propose the following formulation for modulating the DS:

$\begin{array}{l}\stackrel{.}{\mathit{q}}=\mathit{M}\left(\mathit{q}\right)\left(\mathit{f}\left(\mathit{q}\right)+\alpha \left(\mathit{q}\right)\mathit{g}\left(\mathit{q}\right)\right)\\ =\underset{\text{Standard} \text{Modulation}}{\underbrace{\mathit{M}\left(\mathit{q}\right)\cdot \mathit{f}\left(\mathit{q}\right)}}+\underset{\in \left[0,1\right]}{\underset{ุ}{\alpha \left(\mathit{q}\right)}}\underset{\begin{array}{l}\text{Explicit} \text{Tangent}\\ \text{Space} \text{Dynamics}\end{array}}{\underbrace{\mathit{M}\left(\mathit{q}\right)\cdot \mathit{g}\left(\mathit{q}\right)}}\end{array}$

(11)where $\mathit{M}\left(\mathit{q}\right)\in {\mathbb{R}}^{d\times d}$ is a modulation matrix as defined in equations (5)–(7), and (13), $\mathit{f}\left(\mathit{q}\right):{\mathbb{R}}^d\to {\mathbb{R}}^d$ is the nominal DS, and $\mathit{g}\left(\mathit{q}\right):{\mathbb{R}}^d\to {\mathbb{R}}^d$ is a vector field that is explicitly defined to be locally tangential to the obstacle boundary, that is, g ( q ) ⊥ n ( q ), with n ( q ) being the obstacle normal.

Continuous scalar-valued activation function $\alpha \left(\mathit{q}\right):{\mathbb{R}}^d\to \mathbb{R}$ indicates the regions in state space where the obstacle-tangential vector field g ( q ) is active; with α( q ) ∈ [0, 1]. When the nominal modulated DS term is close to local minima (i.e., M ( q )⋅ f ( q ) → 0), then 0 < α( q ) ≤ 1, otherwise, α( q ) = 0. Obstacle-tangential velocities g ( q ) are thus introduced only to avoid generation of spurious attractors. Figure 4 demonstrates the possible deflection added in the vicinity of local minima.

The advantage of (11) over (Huber et al., 2019; Khansari-Zadeh and Billard, 2012;) is that g ( q ) is independent of f ( q ) or any reference point q ^r , opening the possibility of defining such tangential vector field with external optimization techniques analogous to a stabilizing optimal control input. This allows an intuitive and explicit control over the tangential component of the vector field yielding an inherent boundary impenetrable modulated DS.

5.1. Distance function adaptation

Our goal is to use a learned model of the true distance-to-collision, as defined in (3), to define the collision boundary. To preserve the collision avoidance properties of the modulation M ( q ) defined in equation (5), we need to properly define the functions λ _n ( q ) and λ _τ ( q ), which are used to construct the diagonal gains matrix D ( q ).

We employ a parametrized sigmoid function:

$\begin{array}{l}\sigma \left(d_1,d_2,{\lambda }_1,{\lambda }_2,k\right)=\\ ={\lambda }_1+\frac{{\lambda }_2-{\lambda }_1}{1+\exp \left(-k\left(\mathrm{\Gamma }\left(\mathit{q}\right)-\frac{\left(d_1+d_2\right)}{2}\right)\right)},\end{array}$

(12)which smoothly connects the constant values λ₁ and λ₂ as a function of distance Γ( q ). The parameter k controls the width of the transition, and the offsets d₁ and d₂ define the transition mid-point.

To define λ _n ( q ), we use λ₁ = 0 and λ₂ = 1, while for λ _τ ( q ), λ₁ = 2 and λ₂ = 1. Distance parameters d₁ and d₂ are set to be 0 cm and 10 cm, respectively, and parameter k is set to k = 2. Thus, diagonal elements of matrix D ( q ) are defined as

$\begin{array}{l}{\lambda }_n\left(\mathit{q}\right)=\sigma \left(1cm,10cm,0,1,2\right)\\ {\lambda }_{\tau }\left(\mathit{q}\right)=\sigma \left(1cm,10cm,2,1,2\right)\end{array}$

(13)With such construction, λ _n ( q ) = λ _τ ( q ) = 1 (making matrix D ( q ) to be identity) for Γ( q ) > 10 cm. For situations when distance-to-collision is lower than threshold Γ( q ) = 1 cm, λ _n ( q ) = 0 and λ _τ ( q ) = 2, guaranteeing non-penetrability. Following such definition, the non-negative nature of the values λ _n and λ _τ ensures that the matrix M is positive definite. Consequently, M cannot reverse the nominal DS flow; it can only redirect it. However, the incorporation of additional tangent dynamics enables the generation of motion that can oppose the direction of the original DS.

Proposition 1

Impenetrability. Consider an obstacle in the task space of the robot, represented by a set of points $\subset {\mathbb{R}}^3$ . Let $\mathrm{\Gamma }\left(\mathit{q}\right):{\mathbb{R}}^d\to \mathbb{R}$ be a continuous and continuously differentiable $\left({\mathcal{C}}^1\right)$ function that expresses the minimal distance between the robot in state q and set 𝒪. System (11) preserves the impenetrability of the obstacle.

Proof: See Appendix B.

5.2. Explicit tangent space dynamics as navigation kernels

We propose to construct the vector field g ( q ) that will be projected onto the tangent space of the obstacle boundary as a sum of K local dynamics ${\widehat{\mathit{g}}}_k$ , which we refer to as navigation kernels, activated by radial-basis functions as follows:

$\mathit{g}\left(\mathit{q}\right)={\displaystyle \sum }_{k=1}^K{\widehat{\mathit{g}}}_k\hspace{0.17em}\exp \left(-{\gamma }_k\Vert \mathit{q}-{\widehat{\mathit{q}}}_k\Vert \right),$

(14)where ${\widehat{\mathit{q}}}_k$ is the centroid of k-th navigation kernel, and γ _k regulates kernel width. Vector ${\widehat{\mathit{g}}}_k$ is a linear local dynamics activated in the vicinity of the kernel center $\widehat{{\mathit{q}}_k}$ .

Essentially, formulation (14) allows g ( q ) to be defined by a set of K navigation kernels, so that g ( q ) is present when the state q is close to the k-th kernel center ${\widehat{\mathit{q}}}_k$ , and exponentially decays as the distance to the kernel center increases. If kernels are placed close to the obstacles (so that $\mathrm{\Gamma }\left({\widehat{\mathit{q}}}_k\right)<\epsilon$ ), then the added tangential modulation will be stronger in the vicinity of the obstacle, and will decay as the distance to the obstacle increases.

5.3. Navigation kernel activation

The navigation kernels defined in (14) are activated in the deflected dynamics (11) by a state-dependent scalar-valued function α( q ) ∈ [0, 1], that is used to reduce the effect of the vector field g ( q ) when the system is not in the local minima induced by the obstacle. This function consists of three components:

$\alpha \left(\mathit{q}\right)=\{\begin{array}{ll}{\alpha }_{\mathrm{\Gamma }}\left(\mathit{q}\right)\cdot {\alpha }_n\left(\mathit{q}\right)\cdot {\alpha }_f\left(\mathit{q}\right),& \hspace{1em}\Vert \mathit{q}-{\mathit{q}}^{*}\Vert >r\\ 0,& \hspace{1em}\Vert \mathit{q}-{\mathit{q}}^{*}\Vert \le r\end{array}$

(15)where α_Γ( q ) is equal to one when the system is close to the obstacle, and decays to zero with the increase of distance-to-collision. For example, we can define α_Γ( q ) = 1 − λ _n ( q ), rendering navigation kernels inactive for any robot state that is further than 10 cm from collision. Values of α _n ( q ) change between 0 and 1 depending on the angle between the obstacle normal and the nominal DS direction. Finally, α _f ( q ) continuously changes from 1 to 0 as the system state q approaches the nominal DS attractor q *.

Additionally, we enforce α( q ) = 0 within a ball B _r with radius r enclosing the attractor q *, to be able to preserve local stability of the attractor. Refer to Figure 4 for visualization of active area for a kernel placed close to the concave obstacle. Exact mathematical definitions for ${\alpha }_{\left\{\Gamma ,n,f\right\}}$ are provided further in Section 7.2.

Proposition 2

(L.A.S). Consider a modulated DS in the form $\stackrel{.}{\mathit{q}}=\mathit{M}\left(\mathit{q}\right)\mathit{f}\left(\mathit{q}\right)$ . Assume that f ( q ) is G.A.S. at the attractor q *, modulation matrix M ( q ) has full rank $\forall \mathit{q}\in {\mathbb{R}}^d$ and is equal to an identity matrix in a ball B _r with radius r centered at q *, that is, $\mathit{M}\left(\mathit{q}\right)={\mathbb{I}}_{d\times d}$ , ∀ q : q ∈ B _r . The modulated DS with the tangential deflection component (as in equations 11, 14, and 15) in a form $\stackrel{.}{\mathit{q}}=\mathit{M}\left(\mathit{q}\right)\left(\mathit{f}\left(\mathit{q}\right)+\alpha \left(\mathit{q}\right)\mathit{g}\left(\mathit{q}\right)\right)$ is locally asymptotically stable (L.A.S.) at the attractor q * if the activation parameter α( q ) = 0, ∀ q : q ∈ B _r .

Proof: See Appendix C.

5.4. Navigation kernel parameter optimization

The combination of K kernels allows to define a policy that is locally active, and is able to provide meaningful tangential components to the nominal DS enabling navigation around obstacles. The described policy is defined by direction ${\widehat{\mathit{g}}}_k$ , kernel center ${\widehat{\mathit{q}}}_k$ , and kernel width γ _k for each k-th kernel, respectively. To determine these parameters, we propose to use MPPI approach similar to (Bhardwaj et al., 2022).

The MPPI algorithm provides a framework for finding the optimal parameters of a navigation policy by sampling a distribution of system parameters and then evaluating the corresponding cost of each trajectory generated by these samples. In our proposed formulation, we apply MPPI to learn the parameters of the navigation kernels. Specifically, the MPPI algorithm will be used to search over the space of ${\widehat{\mathit{g}}}_k$ , which represents the local dynamics associated with each kernel.

6. Navigation kernel parameters optimization via sampling-based MPC (MPPI)

Section 6.1 provides an introduction to the classical MPPI method. Subsequent Sections 6.2-6.4 detail how we utilize MPPI to determine the optimal parameters for navigation kernels introduced previously.

6.1. MPPI algorithm description

The idea behind the MPPI method is to sample the system parameters from a distribution, and then to use the sampled parameters to generate a set of trajectories. The cost of each trajectory is computed, and used to change the distribution and bias the sampling procedure towards the parameters that lead to the lower cost. Eventually, the procedure converges to parameters that minimize the defined cost function (Yoon et al., 2022).

Let’s consider an autonomous discrete-time Dynamical System of the form

${\mathit{q}}_h=\stackrel{\sim }{\mathit{f}}\left({\mathit{q}}_{h-1},{\mathit{g}}_1,\dots ,{\mathit{g}}_K\right),$

(16)where q _h is the state vector at time-index h and parameters g _{k = 1…K} alter the system’s behavior. If g _k = 0, ∀k, then the system behaves as some nominal DS.

At each iteration, N candidate parameter sets ${\left\{{\mathit{g}}_{i,k}\right\}}_{i=1..N}^{k=1..K}$ are sampled from K independent multivariate Gaussian distributions such that ${\mathit{g}}_{i,k}\sim {\mathcal{N}}_k\left({\mathit{\mu }}_k,{\mathbf{\Sigma }}_k\right)$ , and then used to generate N trajectories by propagating system (16) forward in time for H timesteps. We denote resulting trajectories (or roll-outs) as ${\left\{{\mathit{q}}_{i,h},{\stackrel{.}{\mathit{q}}}_{i,h}\right\}}_{i=1..N}^{h=1..H}$ . After that, the cost for each trajectory is defined as c _i = c ( q _i,1, …, q _i,H). The cost is designed according to the desired behavior, that is, to prefer trajectories that are close to the nominal DS, or to enable obstacle avoidance, or to be compliant with secondary tasks. Corresponding weights are then calculated as

$w_i=\exp \left(-\frac{c_i}{\beta }\right),$

(17)and the means of the parameter distributions are updated as follows:

${\mathit{\mu }}_k^{new}=\left(1-{\alpha }_{\mu }\right){\mathit{\mu }}_k+{\alpha }_{\mu }\frac{{\sum }_{i=1}^N{w}_i{\mathit{g}}_{i,k}}{{\sum }_{i=1}^N{w}_i},$

(18)essentially shifting the distribution center towards the parameters that lead to the lowest cost. The covariance matrix may also be updated:

$\begin{array}{l}{\mathbf{\Sigma }}_k^{new}=\left(1-{\alpha }_{\mathrm{\Sigma }}\right){\mathbf{\Sigma }}_k+\\ +{\alpha }_{\mathrm{\Sigma }}\frac{{\sum }_{i=1}^N{w}_i\left({\mathit{g}}_{i,k}-\mathit{\mu }\right){\left({\mathit{g}}_{i,k}-{\mathit{\mu }}_k\right)}^T}{{\sum }_{i=1}^N{w}_i}.\end{array}$

(19)

After updating distributions parameters with ${\mathit{\mu }}_k^{new}$ and ${\mathbf{\Sigma }}_k^{new}$ , each parameter g _k is chosen either as the one with lowest corresponding cost c _i , or as a weighted sum (last term in (18)), or as ${\mathit{\mu }}_k^{new}$ , and the system is propagated forward in time for one timestep, and the process is repeated.

In (18)-(19), α _μ and α_Σ are the learning rates for the mean and covariance matrix, respectively. The parameter β > 0 is a temperature parameter that controls the amount of exploration. The higher the temperature, the more the distribution is spread out, and the more the exploration is performed. Williams et al. (2017) prove that such process iteratively converges to the optimal parameters that minimize the cost function.

6.2. MPPI application

Navigation vector field g ( q ) is defined as sum of locally active navigation kernels (14), and each kernel is defined by three parameters: local deflection direction ${\widehat{\mathit{g}}}_k$ , kernel placement ${\widehat{\mathit{q}}}_k$ and kernel width γ _k .

We propose to utilize the MPPI framework to determine the local navigation direction ${\widehat{\mathit{g}}}_k$ of each kernel. Additionally, numerous exploration trajectories produced by the MPPI algorithm at each iteration may be used to determine the placement of the navigation kernels, that is, values of ${\widehat{\mathit{q}}}_k$ .

While kernel widths γ _k can also be optimized via MPPI, for simplicity we fix ${\gamma }_k=\widehat{\gamma },\forall k$ as a hyperparameter. Kernel placement ${\widehat{\mathit{q}}}_k$ is determined during exploration using the roll-out states. The only parameter set to find via MPPI is then ${\left\{{\widehat{\mathit{g}}}_k\right\}}_{k=1..K}$ . Such approach enables exploration of a large range of potential navigation strategies in the vicinity of the obstacle.

At each iteration of the MPPI algorithm, parameter set ${\left\{{\widehat{\mathit{g}}}_{i,k}\right\}}_{i=1..N}^{k=1..K}$ is sampled from K multivariate Gaussian distributions that are parameterized by ${\left\{{\mathit{\mu }}_k,{\mathbf{\Sigma }}_k\right\}}_{k=1..K}$ . We then use the sampled parameters to generate N roll-outs ${\left\{{\mathit{q}}_{i,h},{\stackrel{.}{\mathit{q}}}_{i,h}\right\}}_{i=1..N}^{h=1..H}$ by propagating the system dynamics H timesteps forward in time.

Next, the cost of each trajectory is computed, which is then used to bias the sampling procedure to achieve a lower cost. The weights for each sample are calculated using equation (17), and the mean of the parameter distributions is updated using equation (18). Once the new sampling distribution has been determined, we update the system state, sample new sets of parameters, and the process repeats.

An example of a placed navigation kernel with parameters optimized using MPPI is demonstrated in Figure 4. Notably, in this two-dimensional toy example, the navigation strategy is relatively straightforward—track the obstacle boundary in either the left or right direction. However, in three dimensions, the tangential plane consists of an infinite number of directions to track the obstacle boundary. As dimensionality increases, it becomes exponentially more challenging to find valid navigation strategies. We apply the MPPI algorithm to a 7-DoF robot arm, where an infinite number of navigation strategies can be explored. Examples of successful navigation strategies for such cases are illustrated in Figures 1 and 11.

6.3. Cost function

At each iteration of the MPPI algorithm, a cost for each roll-out ${\left\{{\mathit{q}}_{i,h},{\stackrel{.}{\mathit{q}}}_{i,h}\right\}}_{i=1..N}^{h=1..H}$ is computed. The cost function encodes desired robot behavior, and is used to bias the sampling procedure towards the parameters that minimize the cost. Cost function can be defined as a weighted sum of several cost terms. In this work, we consider the following cost terms:

6.3.1. Goal reaching

The first cost term is a goal reaching cost, which is defined as follows:

$c_i^{goal}={\Vert {\mathit{q}}^{*}-{\mathit{q}}_{i,H}\Vert }_2,$

(20)where q * is the attractor of the nominal DS (1), and q _i,H is the position of the robot at the end of the i-th roll-out.

We only consider the final position of the roll-out, as sampled trajectory may temporarily move away from the goal while navigating around the obstacle. This cost penalizes trajectories that do not approach to the goal in the integration horizon H.

6.3.2. (Self-)Collision avoidance

Distance estimator Γ( q ) provides true distance between the robot and the closest obstacle. As the intended behavior of the motion planner is to navigate around the obstacles, a continuous function penalizing close proximity to the obstacles may restrict the exploration of the space of possible navigation strategies. Therefore, we use a binary collision detection function that penalizes only trajectories that collide with the obstacle. The collision avoidance cost is defined as follows:

$c_i^{coll}={\displaystyle \sum }_{h=1}^H{c}_{i,h}^{coll},$

(21)where

$c_{i,h}^{coll}=\{\begin{array}{ll}0,& \text{if} \mathrm{\Gamma }\left({\mathit{q}}_{i,h}\right)>0\\ 1,& \text{otherwise}.\end{array}$

(22)

For self-collision avoidance cost $c_i^{self-coll}$ , we use the same cost function, but with the distance estimator Γ( q ) replaced by Γ _self ( q ).

6.3.3. Joint limits avoidance

We treat joint limits violation in the same way as collisions. Each state is penalized for violation of the joint limits, and the cost is defined as follows:

$c_i^{\lim }={\displaystyle \sum }_{h=1}^H{c}_{i,h}^{\lim },$

(23)where

$c_{i,h}^{\lim }=\{\begin{array}{ll}0,& \text{if} {\mathit{q}}_{i,h}\in \left[{\mathit{q}}_{\mathit{min}},{\mathit{q}}_{\mathit{max}}\right]\\ 1,& \text{otherwise}.\end{array}$

(24)

Since we assume the DS control in the joint space, we are not concerned by low-manipulability issues, thus do not dampen the joints close to joint-limits.

6.3.4. Stagnation avoidance

The cost function also includes a term that penalizes trajectories that do not move with time. This cost is defined as follows:

$c_i^{stay}=\frac{c_i^{goal}}{\max \left(\epsilon ,{\Vert {\mathit{q}}_{i,1}-{\mathit{q}}_{i,H}\Vert }_2\right)}.$

(25)

This cost encourages the exploration, while penalizing the stagnant trajectories away from the attractor, thus helping to avoid getting stuck in local minima. To some extent, this cost also acts against appearance of limit cycles, that are theoretically possible for the DS modulation approach. However, the length of a cycle should correspond to the horizon of the MPC path prediction. As the trajectories converge to q *, this cost becomes zero.

6.3.5. Nominal DS similarity

Another cost component we propose to use measures the difference between the nominal DS and the actual trajectory. This cost is defined as follows:

$c_i^{DS}={\displaystyle \sum }_{h=1}^H\mathrm{\Gamma }\left({\mathit{q}}_{i,h}\right){\Vert {\stackrel{.}{\mathit{q}}}_{i,h}-f\left({\mathit{q}}_{i,h}\right)\Vert }_2,$

(26)and allows the robot to deviate from the nominal vector field when close to the obstacle.

6.3.5.1. Total cost

The total cost for each trajectory is defined as a weighted sum of the cost terms defined above:

$c_i={\displaystyle \sum }_{t\in T}{w}_t{c}_i^t,$

(27)where w _t is the weight of the cost term t, and T is the set of cost terms T = {goal, coll, self − coll, lim, stay, DS}.

6.4. New kernel placement

MPPI algorithm is essentially a sampling-based motion planner generating new explorative trajectories at each iteration. For each point q _i,h at runtime the distance-to-collision Γ( q _i,h), local obstacle repulsion n and the distance-to-goal ‖ q * − q _i,h‖₂ are evaluated. We may use this exploration to better place the navigation kernels, and add them dynamically as new obstacles are detected along the sampled trajectories.

If stable region of the nominal DS attractor is not reached yet, the distance-to-collision is less than a threshold parameter, and system is within the region of possible local minima a new navigation kernel can be placed. Local minima detection can be characterized as scalar product value $〈\mathit{n}\left(\mathit{q}\right),\widehat{f}\left(\mathit{q}\right)〉$ being close to −1, where $\widehat{f}\left(\mathit{q}\right)=\mathit{f}\left(\mathit{q}\right)/\Vert \mathit{f}\left(\mathit{q}\right)\Vert$ is a normalized direction of nominal DS, and n ( q ) is obstacle normal. Additionally we consider the proximity to the existing set of K navigation kernels. Overall, the criteria for placing a new navigation kernel are

$\begin{array}{l}\begin{array}{ll}{\left\{{\widehat{\mathit{q}}}_k\right\}}_{k=1}^{K+1}& ={\mathit{q}}_{i,h}\cup {\left\{{\widehat{\mathit{q}}}_k\right\}}_{k=1}^K\end{array}\\ \Updownarrow \end{array}$

(28a)

$\{\begin{array}{lll}{\Vert {\mathit{q}}^{*}-{\mathit{q}}_{i,h}\Vert }_2>{\delta }_{*},& \iff & \text{Far} \text{from} \text{the} \text{nominal} \text{attractor}.\\ \mathrm{\Gamma }\left({\mathit{q}}_{i,h}\right)<{\delta }_{\mathrm{\Gamma }},& \iff & \text{Close} \text{to} \text{collision} \text{with} \text{obstacle}.\\ 〈\mathit{n}\left(\mathit{q}\right),\widehat{f}\left(\mathit{q}\right)〉<-1+{\delta }_n,& \iff & \text{Possible} \text{local} \text{minima} \text{for} \text{standard} \text{modulation}.\\ {\min }_{k=1..K}\hspace{0.17em}{\Vert {\mathit{q}}_{i,h}-{\widehat{\mathit{q}}}_k\Vert }_2>{\delta }_k.& \iff & \text{Far} \text{from} \text{existing} \text{navigation} \text{kernels}.\end{array}$

(28b)Parameters δ_∗, δ_Γ, δ _n , δ _k are strictly positive and their values determine the density of the navigation kernels placed during exploration. Notably, some conditions of kernel placing duplicate the mechanisms of kernel activations α_Γ, α _n and α _f . In other words, even if a kernel is placed close to attractor q *, it would not get activated, because α _f = 0. However, such redundancy provides more tunability for the system, and reduces the overall amount of navigation kernels placed.

After the new candidate for a navigation kernel is found, it is added to the existing set of kernels, centered at ${\widehat{\mathit{q}}}_{k+1}={\mathit{q}}_{i,h}$ , has kernel width ${\gamma }_k=\widehat{\gamma }$ , and tangential direction ${\mathit{g}}_{k+1}={\mathit{\mu }}_{k^{*}},$ where k* stands for the index of closest existing kernel: $k^{*}={\min }_k\hspace{0.17em}{\Vert {\mathit{q}}_{i,h}-{\widehat{\mathit{q}}}_k\Vert }_2$ . This efficiently warmstarts the optimization of kernel parameters with the parameters of the closest existing kernel.

The sampling policy is also changed to include the new mean ${\mathit{\mu }}_{k+1}={\mathit{\mu }}_{k^{*}}$ and covariance ${\mathbf{\Sigma }}_{k+1}={\mathbf{\Sigma }}_{k^{*}}$ . We preserve the similar parameters between closest navigation kernels to avoid undesired oscillatory trajectories. The described MPPI method is detailed in Algorithm 1. The two-dimensional planar robot application is shown in Figure 5.

Figure 5.

Progression of three states of a planar 2-DoF robot with our algorithm applied. The task space motion is in the top row, while the joint space is visualized at the bottom. By means of sampling of the tangential deflection, a local policy (in green) is generated, allowing the robot to avoid both obstacles and reach the goal. Light blue trajectories show the horizon of MPPI sampling. Figures 2 and 3 demonstrate the corresponding nominal and modulated motions, respectively.

7. Implementation details

7.1. Tail effect compensation

Modulation M ( q ) defined in equation (5) reshapes the vector field according to defined obstacle basis E ( q ) and weights matrix D ( q ). This modulation only depends on the distance-to-collision Γ( q ) and does not take into account the direction of the vector field. This can lead to a situation where the robot is slowed down by the modulation even if it is moving away from the obstacle. This effect is called the tail effect (Khansari-Zadeh and Billard, 2012). In order to compensate for this effect, we redefine normal direction gain λ _n ( q ) as follows:

${\lambda }_n^{\prime }\left(\mathit{q}\right)={\lambda }_v\left(\mathit{q}\right)+\left(1-{\lambda }_v\left(\mathit{q}\right)\right){\lambda }_n\left(\mathit{q}\right),$

(29)where λ _v ( q ) is a sigmoid function that is defined as

${\lambda }_v\left(\mathit{q}\right)=\frac{1}{1+\exp \left(-100〈\mathit{n}\left(\mathit{q}\right),\frac{\mathit{f}\left(\mathit{q}\right)}{\Vert \mathit{f}\left(\mathit{q}\right)\Vert }〉\right)},$

(30)such that λ _v ( q ) continuously indicates whether the nominal vector field is pointing towards the obstacle (λ _v ( q ) = 0) or away from it (λ _v ( q ) = 1). Thus, ${\lambda }_n^{\prime }\left(\mathit{q}\right)$ is equal to λ _n ( q ) if the nominal vector field is pointing towards the obstacle, and is equal to 1 if the nominal vector field is pointing away from the obstacle, even if the distance-to-collision is small. Figure 6 shows the tail compensation effect.

Figure 6.

Tail effect visualization: On top is the modulation without tail compensation, that is, using the default λ _n from equation (13). This results in the trajectory “sticking” to the obstacle. Shown below is the modulation with ${\lambda }_n^{\prime }$ introduced in equation (29), which mitigates the “sticking” effect.

7.2. Navigation kernel activation implementation

For the local activation of navigation kernels, we define parameters α_Γ( q ), α _n ( q ) and α _f ( q ) from equation (15) using the λ _n and λ _v .

$\begin{array}{l}{\alpha }_{\mathrm{\Gamma }}\left(\mathit{q}\right)=1-{\lambda }_n\left(\mathit{q}\right),\\ {\alpha }_n\left(\mathit{q}\right)=1-{\lambda }_v\left(\mathit{q}\right),\\ {\alpha }_f\left(\mathit{q}\right)=\max \left(1,\Vert \mathit{q}-{\mathit{q}}^{*}\Vert \right).\end{array}$

(31)With such definition, even though navigation kernels are primarily activated by RBFs, they are disabled for situations where distance-to-collision is large, essentially compressing RBFs closer to the obstacle. Additionally, the tail effect is compensated, as α _n ( q ) is equal to 0 if the nominal vector field drives the robot away from the obstacle. Note, that α_Γ( q ) and α _n ( q ) could be merged into a single function using previously defined ${\lambda }_n^{\prime }\left(\mathit{q}\right)$ .

7.3. Navigation kernel tangentiality

As stated in Section 5, we define navigation kernel dynamics to be locally tangential to the obstacle boundary. While parameters g _k are sampled from a full d-dimensional Gaussian distribution, we may impose the following transformation on the final policy:

$\mathit{g}\left(\mathit{q}\right):={\mathit{M}}^{\perp }\left(\mathit{q}\right)\mathit{g}\left(\mathit{q}\right),$

(32)where M ^⊥( q ) is constructed as M ^⊥ = ED ^.⊥ E ^T , and D ^⊥ is an identity matrix with zero as the first element of the first column. With such transformation it is guaranteed that g ( q ) ⊥ n ( q ). While this orthogonality is not crucial for obstacle avoidance, as by design any vector field g ( q ) is modulated by M ( q ), it is still a nice property that restricts navigation kernels to only provide meaningful tangential deflection, and not modulate the DS motion in undesired directions.

7.4. Discrete system obstacle impenetrability

Proposition 1 ensures that continuous dynamics defined by (11) do not penetrate the obstacle boundary Γ( q ) = 0. However, the Neumann condition is insufficient to guarantee impenetrability for discrete-time dynamics, especially when the integration step is large in comparison to the speed of displacement of the robot, as this can often be the case in real-world robotics applications. Specifically, for convex obstacles, $\mathit{n}{\left(\mathit{q}\right)}^T\stackrel{.}{\mathit{q}}$ on the obstacle boundary does not guarantee impenetrability, as the system can be brought through the obstacle boundary if the timestep δt is large and the previous state is not on the boundary (thus possibly having a nonzero velocity component along the obstacle normal). For concave obstacles, any non-infinitesimal displacement in a tangential plane while on the obstacle boundary within the concavity will also violate the obstacle boundary.

In practical applications, ensuring the non-penetrability of obstacles requires additional considerations. Apart from issues arising from numerical integration, the obstacle’s normal is provided by a learned network, which only approximates the normal, thus not guaranteeing impenetrability. To mitigate that, a combination of safety threshold ɛ, local obstacle repulsion field f _rep, and a sufficiently small numerical integration step δt is necessary.

By design, for system (11), $\stackrel{.}{\mathit{q}}\perp \mathit{n}\left(\mathit{q}\right)$ for all q : {Γ( q ) ≤ 1 cm}. In applications with discretized system integration, the robot state may still penetrate the safety threshold Γ( q ) = ɛ = 1 cm. When this occurs, a small repulsive force, f _rep( q ) = k_rep n ( q ), is added to the right-hand side of (11) to move the state away from the obstacle boundary and maintain the safety threshold. Note that f _rep( q ) = 0 for all q : {Γ( q ) ≥ 1 cm}.

Taking these factors into account, impenetrability for obstacles in discrete system integration can only be violated if a single integration step results in Γ( q _t ) ≥ɛ transitioning to Γ( q _t+1) < 0, or if the repulsion magnitude k_rep is insufficient. The first case can be addressed by reducing the numerical integration step δt to an adequately small value. As our algorithm operates at approximately 500 Hz, the value of δt is set to 0.002, ensuring that the integration steps are small enough to prevent overcoming the safety threshold in a single step.

Assuming that the system integration is performed using the Euler method, the magnitude k_rep can be estimated by calculating the current undesired penetration through the threshold: ɛ − Γ( q ) and introducing the offset with a timestep correction: $k_{\text{rep}}=\frac{\epsilon -\mathrm{\Gamma }\left(\mathit{q}\right)}{\delta t}$ . As a result, the repulsion force added to offset the threshold penetration is defined as

${\mathit{f}}_{\text{rep}}\left(\mathit{q}\right)=\{\begin{array}{ll}\frac{\epsilon -\mathrm{\Gamma }\left(\mathit{q}\right)}{\delta t}\mathit{n}\left(\mathit{q}\right),& \forall \mathit{q}:\mathrm{\Gamma }\left(\mathit{q}\right)<\epsilon \\ 0,& \text{otherwise}.\end{array}$

(33)The threshold ɛ = 1 cm (defined in (13)) in combination with a small timestep δt = 0.002 ensures impenetrability of the obstacle boundary Γ( q ) = 0 in our practical application.

Overall, the continuous dynamics (11) take the following discrete form:

${\stackrel{.}{\mathit{q}}}_t=\mathit{M}\left({\mathit{q}}_t\right)\left(\mathit{f}\left({\mathit{q}}_t\right)+\alpha \left({\mathit{q}}_t\right){\mathit{M}}^{\perp }\left({\mathit{q}}_t\right)\mathit{g}\left({\mathit{q}}_t\right)\right)+{\mathit{f}}_{\text{rep}}\left({\mathit{q}}_t\right)$

(34)

${\mathit{q}}_{t+1}={\mathit{q}}_t+{\stackrel{.}{\mathit{q}}}_t\delta t.$

(35)

7.5. Algorithm implementation

Bhardwaj et al. (2022) report frequencies of up to 125 Hz for sampling-based MPC scheme similar to ours; however, it is only possible due to simple integration of the roll-outs, where the state is linear function of the control input. That enables the evaluation of the state sequence by means of lower-triangular integration tensor, achieving parallelization both across multiple timesteps and multiple samples. However, we rely on Γ( q ) evaluation for each timestep for modulation matrix calculation, making the system nonlinear, and restricting parallel computation in time domain. Mainly because of that our MPC is limited to 10-30 Hz depending on number of samples, obstacles and horizon length. The main computation bottleneck of our algorithm is the evaluation of Γ( q ) and ΔΓ( q ), followed by QR decomposition of obstacle normal to construct the tangential space basis. The latter is not comparable in amount of operations with MLP evaluation; however, it restricts the use of algorithm to CPU.

While the method leverages the parallel execution for multiple exploration samples, and is fully suitable for GPU implementation, we found that QR decomposition of obstacle bases can only be efficient on CPU, thus all setup runs exclusively on CPU. Newer generations of processors with relatively large cache allow quick computation of the MLP, and overall performance is satisfactory. Notably, more traditional methods to evaluate distance-to-collision and repulsive gradient would lead to even more significant slowdowns.

As such frequencies may still not be sufficient for environments where obstacles are not static, we leverage the modular structure and concurrent execution to improve the performance. A simple one-sample one-timestep integration of modulated DS is not as computationally expensive and can be performed with frequencies up to 500 Hz. We asynchronously compute the modulated DS with latest known Modulation Policy, and stream the data to the low-level impedance controller that is executed at 1 kHz. This controller also mitigates potential abrupt changes in the DS-generated commands that may occur due to discontinuities in the distance function between the robot’s links and the obstacles represented by spherical primitives. This allows us to achieve real-time performance in dynamic environments.

Importantly, the MPC does not need to operate continuously in the background, using up computational resources. The MPC sampling is activated only if the predicted robot state comes close to navigation kernels, and it is not engaged in situations where there is no risk of local minima induced by obstacles. In practice, the MPC can run asynchronously at all times, but the number of samples can be varied dynamically. Generally, a single roll-out is required to predict the future trajectory and identify local minima. Once the minima is detected and a navigation kernel is placed, the number of samples increases to determine the optimal deflection direction. When the nominal propagated motion encounters no local minima (or navigation kernels), the sample complexity can be reduced back to a single sample for trajectory prediction. This pattern is further explored in Section 8.

Nominal DS is a parameter to both Modulated DS module and MPC module, and obstacles positions are streamed using Optitrack at 120 Hz. Notably, we do not use ROS for streaming, instead we opt for a lightweight setup based on ZeroMQ publisher-subscriber sockets (Hintjens, 2013).

Overall flowchart of the implemented algorithm is shown in Figure 7. All frequencies are reported for Apple Silicon M2 3.7 GHz CPU. The source code for running the presented algorithm in simulation and on a real robot is available online. ³ The algorithm contains a large set of hyperparameters, all of which are introduced and explained in the text. For clarity, we have compiled all meaningful parameters of our method in Table 4 located in Appendix D.

Figure 7.

Flowchart of the implemented algorithm. Message passing between modules is performed asynchronously. Approximate operating frequencies for each module (shown in red boxes) are estimated for execution on Apple Silicon M2 3.7 GHz CPU.

7.6. Computational complexity

The proposed hybrid controller combines two underlying algorithms—DS and MPC. For both algorithms, the major part of computations is related to state propagation, particularly the computation of the Modulation matrix, which depends on the implicit distance function. This function is represented by a Multi-Layer Perceptron (MLP) with analytical computational complexity O (s⋅d⋅n + m⋅n²), where s is the number of input queries; d is the input dimension (robot DoFs); m is the network depth; and n is the number of neurons per layer. Additionally, the number of inputs s = N⋅p can be expressed as the product of the number of robot states N and the number p of collision spheres (or points) in the robot’s environment. The MPC algorithm performs these computations sequentially for H steps along the horizon, resulting in a total computational complexity for the sampling-based MPC of O(H(s⋅d⋅n + m⋅n²)). Although the integration steps in MPC can be parallelized for multiple states and obstacles, the nonlinear integration procedure requires sequential evaluation of the time dimension. Consequently, the MPC evaluation frequency does not exceed 30 Hz in our experiments.

The DS can be considered as a single-step, single-sample MPC, and its computational complexity can then be expressed as O (d⋅n + m⋅n²). Given the relatively small size of the MLP used (n = 256, m = 4), the DS can be evaluated at frequencies up to 500–1000 Hz.

8. Evaluation

We systematically evaluate the proposed method in a simulated environment on a 7-DoF Franka Panda robot. We aim to compare the performance of our approach with two state-of-the-art methods that are capable of reactive robot motion towards the given goal configuration while avoiding collisions with obstacles in the robot’s workspace. Specifically, we compare the methods based on their ability to avoid collisions, achieve the goal and run at a high frequency. Additionally, we demonstrate the application of our method for a nonlinear joint space DS both in simulation and on a real robot.

8.1. Experimental setup

We consider a reaching task, in which the robot has to perform a reaching motion towards a goal configuration while avoiding obstacles in the workspace. We compare our method with a standard DS modulation framework introduced by Khansari-Zadeh and Billard (2012), and with a sampling-based MPC method (STORM) introduced by Bhardwaj et al. (2022). We define a single desired joint state q * and use a simple linear dynamical system as a nominal DS:

$\stackrel{.}{\mathit{q}}=-\frac{\mathit{q}-{\mathit{q}}^{*}}{\Vert \mathit{q}-{\mathit{q}}^{*}\Vert },$

(36)that is normalized to achieve uniform velocity profile during the task execution. The normalization is not performed when the system is close to the attractor, to avoid numerical instabilities.

Standard modulation and our method are designed to act in the joint space given some nominal DS, however the STORM implementation considers costs defined in task space (i.e., end-effector position and orientation). To enable a fair comparison, we redefine the goal reaching and orientation costs as a quadratic cost similar to (20). This emulates the linear DS motion in the joint space, and allows us to compare the performance of methods on the same task. We use the same cost weights and hyperparameters as provided in the publicly available implementation ⁴ of STORM. Additionally, we leverage our previous work (Koptev et al., 2023) that introduced a Neural Network based Γ-function for collision checking, which improves the performance (in terms of frequency) of the method.

To make meaningful comparison in the reaching scenario, we design the experiment such that final goal state q * describes position in the left part of robot’s workspace, and initial position q _init is located in the right. To move between these two positions robot has to traverse through the workspace in front of it, as shown in Figure 8.

Figure 8.

Reaching trajectory used in the benchmark. Robot is driven from the initial position (in blue) to the goal position (green) by linear DS defined in joint space. Concave obstacles are placed in the swept area in front of the robot to perform collision avoidance benchmark.

For the benchmark, we consider a static cross-shaped sphere structure placed in front of the robot. This arrangement of obstacle primitives effectively segments the robot’s workspace into four distinct quarters, a configuration that is representative of typical static environments or shelving scenarios encountered in robotic navigation. We investigate methods’ performance for various sizes of the obstacle. Some of the sizes are shown in Figure 9. In general, as the size of the obstacle increases, the robot’s workspace becomes more constrained. For each obstacle size we vary the height of the cross center and its distance from the robot across 100 reaching motions. Benchmark results are presented in Table 1. We consider reaching successful if it is performed within 10 s. Otherwise, we do not consider it in calculations of average number of iterations and trajectory time.

Figure 9.

Two-, three-, and four-spheres long obstacle cross configurations used in the benchmark.

Table 1.

Performance comparison of three methods for robot motion in obstructed environments with varying obstacle sizes. Values represent the average of 100 runs, with means (and standard deviations) reported. All parameters, except success rate, are averaged only for successful reaching motions.

Obstacle size	Success rate			Iterations			Trajectory time, s			Frequency, Hz
	Ours	ModDS	STORM	Ours	ModDS	STORM	Ours	ModDS	STORM	Ours (MPC)	Ours (DS)	ModDS	STORM
2	1.00	1.00	1.00	446 (23)	451 (39)	416 (73)	0.82 (0.06)	0.74 (0.06)	4.85 (0.98)	22 (1)	548 (16)	613 (5)	86 (7)
3	1.00	1.00	0.98	476 (47)	481 (51)	452 (89)	0.96 (0.12)	0.86 (0.09)	5.34 (1.08)	22 (3)	498 (14)	562 (5)	84 (8)
4	1.00	0.86	0.82	524 (83)	534 (113)	477 (75)	0.97 (0.19)	0.86 (0.19)	6.46 (1.04)	21 (2)	546 (47)	622 (17)	74 (3)
5	1.00	0.72	0.81	563 (144)	535 (79)	467 (86)	1.18 (0.37)	0.88 (0.12)	6.05 (1.22)	22 (2)	485 (26)	607 (9)	76 (4)
6	0.99	0.65	0.80	571 (154)	554 (102)	463 (119)	1.21 (0.37)	0.98 (0.18)	5.54 (1.48)	20 (1)	473 (19)	567 (7)	75 (3)
7	0.98	0.62	0.79	626 (391)	556 (104)	454 (95)	1.36 (0.94)	0.93 (0.18)	6.26 (1.27)	19 (2)	468 (20)	598 (3)	74 (7)

8.2. Discussion

The effectiveness of our proposed method in navigating in the presence of obstacles is demonstrated in Table 1, where it outperforms two other methods with consistently higher success rates. While the planning part of our algorithm is slower than STORM, the running frequency is comparable to that of a standard DS approach. It is worth noting that our algorithm runs on a CPU, while STORM efficiently leverages GPUs. However, the slow planning loop is not crucial for our method, as the primary modulated DS achieves motion reactivity at a high frequency. We should also note that this benchmark only evaluates the algorithms in quasi-static environments and does not consider their performance in dynamic scenarios. Future work could address this limitation by incorporating obstacle velocities into collision avoidance algorithms. Nonetheless, our method is capable of reacting to dynamic changes in the environment due to its high frequency of operation, as demonstrated in experiments with a real robot.

The performance parameters of the MPC component are displayed in Table 2. As mentioned earlier, the MPPI-based sampling policy optimization is only necessary when the robot trajectory comes close to possible local minima induced by obstacles. The number of trajectories where the MPC is invoked to explore exit policies increases with environmental complexity. However, in certain situations (e.g., when the obstacle is not very close to the robot), the MPC might be unnecessary as the nominal DS delivers required collision-free reaching motion. Furthermore, for trajectories utilizing the MPC, it does not have to be employed throughout the entire trajectory but can be applied only when the robot passes by the obstacle. The corresponding MPC activation rate parameter grows with the amount of obstacles in the robot’s workspace. Lastly, Table 2 reveals that an average of 2–5 navigation kernels is required to complete the reaching task in the proposed benchmark scenario. This value can be adjusted by configuring the hyperparameters such as kernel width $\widehat{\gamma }$ and kernel placement thresholds ${\delta }_{\{\Gamma ,n,k\}}$ .

Table 2.

MPC activation metrics for the benchmark experiments. The columns indicate obstacle size, the number of trajectories where more than one navigation kernel was placed (i.e., MPC was required), and the corresponding proportion of iterations where the path passed by the navigation kernels along with number of kernels placed. Values are averaged over 100 runs, with means (and standard deviations) reported. MPC activation rate and number of kernels is averaged only for trajectories where MPC was active.

Obstacle size	Trajectories requiring MPC, rate	MPC activation rate	Number of kernels
2	0.11	0.42 (0.16)	1.8 (0.8)
3	0.11	0.53 (0.18)	2.7 (0.8)
4	0.28	0.64 (0.19)	2.8 (1.5)
5	0.41	0.72 (0.16)	2.6 (1.9)
6	0.51	0.72 (0.15)	2.7 (1.9)
7	0.56	0.73 (0.15)	2.7 (2.5)

In the case of a dynamic unstructured environment, it is possible that previously placed navigation kernels may become irrelevant after obstacles have moved. This issue is addressed in our method through the coefficient α_Γ (as defined in equation (31)) that deactivates the deflection as obstacle moves away. If an obstacle once again comes close to such a kernel, MPPI will automatically begin adjusting the kernel’s parameters.

8.3. Real robot experiments

We demonstrate the reactive collision avoidance properties of our method on a setup involving Franka Emika. We use a simple reaching trajectory similar to the one used in simulated benchmark. We then command the robot to alternate between these nominal dynamics to perform cyclic motion between two attractors following the reaching pattern. We fit a human shape with 70 spheres (see Figure 10) with variable radii, and randomly obstruct the robot workspace during the task execution. The keypoints on the human are tracked with OptiTrack at a 120 Hz rate. Modulated DS with latest available policy is evaluated at frequency of at least 500 Hz, and MPPI asynchronously updates the navigation policy at approximately 20 Hz. The robot is then controlled at 1 kHz by a custom low-level torque controller. Figure 11 demonstrates the snapshots of the experiment in which human dynamically appears in the robot workspace and obstructs the motion. Multimedia attachment shows the full video of the experiment.

Figure 10.

Spherical approximation of human upper body. 70 spheres of variable radii represent head, torso, and arms. Optitrack markers are used to determine six keypoints located on the human body.

Figure 11.

Two experiments in which human swiftly obstructs the robot motion with (a) raised arm, and (b) concave arm trap. Robot reactively avoids the collision and navigates the concavity, continuing the reaching task execution. Time difference between subsequent images is approximately 700 milliseconds. For more experiments please refer to the supplemental video.

9. Conclusion and future work

We have presented a method to introduce deflections into a Modulated Dynamical System to enhance the navigation capabilities of the original approach proposed by Khansari-Zadeh and Billard (2012). Our method retains the properties of the Modulated DS, such as local stability and non-penetrability of obstacle boundaries.

We utilize Sampling-based Model Predictive Control to optimize the deflection parameters and leverage the Neural Signed Distance Function for real-time performance in the 7-dimensional joint space of a robotic manipulator.

Our proposed hybrid controller enables real-time, collision-free motion generation for any nominal DS motion. The underlying modulated DS can effectively control collision-free robot movement at frequencies up to 500 Hz, while the navigation policy updates at 20 Hz, allowing for path-planning in non-static and rapidly changing environments.

Future work could address some limitations of our approach, such as the generation of motion exclusively in joint-space. While this is natural for robots, it may not be ideal for real-world tasks. The hybrid controller could be enhanced by adding an Inverse Kinematics layer that calculates the desired final joint positions for each robotic task. Additionally, considering multiple DS attractors could fully exploit the redundancy of robot kinematics.

Another potential improvement involves developing a fully dynamic controller that considers not only obstacle positions but also their velocities, adding a new level of reactivity to the generated motions. This approach could be further refined by incorporating filtering and prediction of obstacle movements, enhancing the MPC policy generation.

Future work will explore advanced sampling strategies for MPPI optimization beyond standard Gaussian distributions Lambert et al. (2021); Barcelos et al. (2021). Tailoring these distributions to dynamic environments could yield quicker convergence and more nuanced motion planning, particularly in human-interactive settings. This refinement aims to bolster our method’s adaptability and performance in real-world applications.

Supplemental Material

Supplemental Material - Reactive collision-free motion generation in joint space via dynamical systems and sampling-based MPC

Supplemental Material for Reactive collision-free motion generation in joint space via dynamical systems and sampling-based MPC by Mikhail Koptev, Nadia Figueroa and Aude Billard in The International Journal of Robotics Research.

Supplemental Material

Supplemental Material