---
title: Multi-Modal Reeds-Shepp Curves
url: https://www.emergentmind.com/topics/multi-modal-reeds-shepp-curves
type: topic
---

# Multi-Modal Reeds-Shepp Curves

Multi-modal Reeds-Shepp curves are Reeds-Shepp-type trajectories whose segments are selected from more than one motion mode. In the most explicit recent usage, the state is extended from \((x,y,\theta)\) to \((x,y,\theta,m)\), where \(m\) is a discrete steering mode, and path planning combines per-mode Reeds-Shepp connectors with explicit mode-switch costs. Closely related work treats the same idea more broadly: as concatenations of forward/backward, left/right, straight, wait, or greedy Reeds-Shepp primitives for Ackermann robots; as a partition of classical Reeds-Shepp path families into analytically selected modes; as joint geodesics for fleets of Reeds-Shepp vehicles under an \(L^p\)-type coupling; and as generalized Reeds-Shepp geometries on spheres or lifted position-orientation spaces [2509.06115][2506.09914][2504.05921][2108.03191].

## 1. Terminological scope and principal meanings

The classical Reeds-Shepp car is posed on \(\mathrm{SE}(2)\) with six primitive motions: \(s^{+}\), \(s^{-}\), \(l^{+}\), \(l^{-}\), \(r^{+}\), and \(r^{-}\), corresponding to forward/backward straight motion and forward/backward maximal left/right turns. Reeds-Shepp paths are concatenations of these primitive segments, and cusps are the points where the sign of velocity changes [2504.05921]. In that classical setting, “mode” may denote a path family such as \(CSC\), \(CCC\), \(CCSC\), \(CCSCC\), or \(CCCC\), or a specific pattern such as \(l_T^+ s_U^+ r_V^+\) [2504.05921].

In multi-robot Ackermann planning, the same notion is instantiated at the primitive level. The primitive set \(\mathcal M\) contains up to eight actions: Forward max-left, Forward straight, Forward max-right, Backward max-left, Backward straight, Backward max-right, Wait, and a Greedy motion primitive derived from the first segment of a shortest single-robot path, which is the optimal Reeds-Shepp path in obstacle-free space and a hybrid A* path in clutter [2506.09914]. In four-wheel independent steering planning, the mode variable is explicit and discrete: Ackermann steering, lateral steering, and parallel movement, each with distinct kinematics and a dedicated Reeds-Shepp-like connector [2509.06115].

| Formulation | Mode set | Role |
|---|---|---|
| Classical planar Reeds-Shepp | 46 patterns, or 20 canonical types \(P_1,\dots,P_{20}\) after partitioning | Analytic path-family selection |
| Ackermann MRPP | FL, FS, FR, BL, BS, BR, Wait, GM | Discrete primitive library in configuration-time |
| 4WIS Hybrid A* | Ackermann, lateral, parallel | Explicit hybrid state \((x,y,\theta,m)\) |
| Fleet planning in product spaces | \(p \in [1,\infty]\) | Coupling mode for joint cost |
| Spherical convexified Reeds-Shepp | \(C\), \(G\), \(T\) | Time-optimal multimode concatenation |
| Lifted data-driven Reeds-Shepp | Modality-dependent costs | Geometry adapted to data modalities |

This suggests that “multi-modal Reeds-Shepp curve” is not a single standardized object. In current literature it can denote a path assembled from distinct steering regimes, a selector over analytic Reeds-Shepp families, a joint cost mode for multiple vehicles, or a Reeds-Shepp geometry adapted to data or manifold structure [2509.06115][2504.05921][2108.03191].

## 2. Classical Reeds-Shepp families as a modal partition

Classical shortest Reeds-Shepp paths lie within a finite family of sequences of at most five segments, built from constant-curvature arcs \(C\) and straight segments \(S\). After reductions, the minimal family has 46 distinct patterns grouped as \(CSC\), \(CCC\), \(CCSC\), \(CCSCC\), and \(CCCC\), each with closed-form formulas for segment lengths and feasibility conditions [2504.05921]. From a modal viewpoint, these 46 patterns are already a discrete mode library.

The state-space partitioning in the accelerated Reeds-Shepp algorithm makes this modal structure explicit. After transforming the terminal pose into a mirrored first-quadrant local frame, the method computes distances between left-hand and right-hand circle centers and applies a Boolean test based on \(\mathcal K = 2r\sqrt{2}\). This separates the query into Set A, containing \(CSC\), \(CCSC\), and related variants, and Set B, containing \(CCC\), \(CCCC\), and \(CCSCC\) variants. Within those two sets, additional geometric predicates reduce the effective candidate library from 46 patterns to 20 canonical path types \(P_1,\dots,P_{20}\), with mutually exclusive and exhaustive regions in \((x_m^l,y_m^l,\theta_m^l)\)-space [2504.05921].

Algorithmically, the method performs one analytic mode decision per query rather than evaluating every candidate family. OMPL evaluates 46 types per query with average runtime about \(1.25\,\mu s\); the Desaulniers reimplementation runs in about \(0.216\,\mu s\); the proposed partition-based method runs in about \(0.0827\,\mu s\), with path-length differences at machine precision relative to OMPL [2504.05921]. The same paper also treats the under-specified terminal-orientation problem by showing that the minimizing orientation lies on boundaries between path-type regions, yielding three geometric regions \(R_1,R_2,R_3\) and corresponding closed-form solutions \(\Omega_1,\Omega_2,\Omega_3\) [2504.05921].

This suggests that multimodality need not begin with heterogeneous vehicle hardware. Even the standard planar Reeds-Shepp problem already has a modal interpretation: the optimal trajectory is selected from a finite set of analytically characterized motion families, and mode transitions correspond to region boundaries in configuration space [2504.05921].

## 3. Hybrid and steering-mode constructions

For Ackermann robots in continuous state space, multi-modal Reeds-Shepp behavior is realized by discretizing the kinematics
\[
\dot{x} = u \cos\theta,\quad \dot{y} = u \sin\theta,\quad \dot{\theta} = \frac{u}{\ell_b \tan\phi},
\]
with \(u \in [-u_m,u_m]\), \(\phi \in [-\phi_m,\phi_m]\), and minimal turning radius \(r_m = \ell_b/\tan\phi_m\). The primitive library contains six core Reeds-Shepp actions—FL, FS, FR, BL, BS, BR—plus Wait and Greedy motion primitive. Each primitive is one time step of constant control: a constant-curvature arc of radius \(r_m\) or a straight segment of length \(u_m\Delta t\). The Greedy motion primitive is obtained by truncating the first segment of length \(u_m\Delta t\) from the shortest single-robot path to the goal, which is the optimal Reeds-Shepp path in obstacle-free space and a hybrid A* path in clutter. Low-level search uses hybrid A* over discretized \((x,y,\theta)\) with a heuristic equal to the maximum of holonomic cost with obstacles, shortest Reeds-Shepp path length, and Euclidean distance; this heuristic is stated to be admissible [2506.09914].

The dissertation does not introduce a separate curvature-optimization smoothing stage. Instead, smoothness is induced by continuous-time kinematics for each primitive, yielding \(G^1\) continuity with piecewise constant curvature; each online step remains curvature-bounded and nonholonomic by construction [2506.09914]. In that setting, a robot trajectory is a concatenation of forward/backward arcs, straight segments, waits, and Greedy motion segments. The dissertation explicitly states that it does not coin the term “multi-modal Reeds-Shepp curves,” but that it effectively constructs them [2506.09914].

The 4WIS formulation makes the hybrid interpretation explicit. The state is \((x,y,\theta,m)\) with \(m \in \{1,2,3\}\) for Ackermann steering, lateral steering, and parallel movement. For Ackermann mode, the effective curvature bound is
\[
\kappa^{(1)} = \frac{2 \tan(\delta_{\max})}{L},
\]
while in lateral mode the same construction is carried out in a rotated coordinate frame with
\[
\kappa^{(2)} = \frac{2 \tan(\delta_{\max})}{W}.
\]
Parallel mode keeps the body orientation constant and uses
\[
\kappa^{(3)}(t) = \frac{\dot{\phi}(t)}{v(t)}.
\]
The planner does not define a single closed-form Reeds-Shepp solution in the full hybrid space. Instead, it uses per-mode Reeds-Shepp connectors, discrete zero-length mode-switch edges, and a switch penalty
\[
C_{\text{switch}} = v_{\text{ref}}\, t_{\text{switch}}.
\]
Its heuristic is
\[
h(n) = \max\left\{h_{\text{euc}},\ \min_{m' \in M} \left[h_{\text{RS}^{(m')}} + C_{\text{switch}} \cdot \mathbb{I}_{\{m \neq m'\}}\right]\right\},
\]
and near the goal it attempts terminal connections in every mode, sorts them by cost, and accepts the first collision-free candidate [2509.06115].

A recurring structural point is that multi-modal Reeds-Shepp planning typically preserves the classical within-mode Reeds-Shepp grammar while placing discrete switching logic above it. In explicit hybrid formulations, mode changes are graph edges; in implicit lattice formulations, they are primitive choices in configuration-time [2509.06115][2506.09914].

## 4. Joint-space and multi-robot generalizations

For multiple Reeds-Shepp vehicles, the most rigorous generalization is the product-space metric construction. A single Reeds-Shepp vehicle is modeled as a sub-Finsler metric space \((\widetilde{RT},d,\mu)\) with \(\widetilde{RT}=\mathbb{R}^3\), dynamics
\[
\dot{x}=v\cos\theta,\quad \dot{y}=v\sin\theta,\quad \dot{\theta}=uv,
\]
\(|u|\le |v|/\rho\), and \(|v|\le 1\). The induced distance is the infimum of the corresponding trajectory length and is interpreted as the shortest possible transition time between poses. Small balls satisfy \(Q\)-Ahlfors regularity with \(Q=4\), and this dimension controls sampling-based convergence rates [2108.03191].

For a fleet of \(n\) vehicles, the joint space is \(X=X_1\times\cdots\times X_n\), and the joint metric is the \(L^p\) combination
\[
d_p\bigl((x_1,\dots,x_n),(x'_1,\dots,x'_n)\bigr)
=
\bigl\|(d_1(x_1,x'_1),\dots,d_n(x_n,x'_n))\bigr\|_p.
\]
The parameter \(p\) interpolates between a preference for minimizing total energy and a preference for minimizing travel time. For Reeds-Shepp fleets, \(p=1\) gives an additive cost over vehicles, while \(p=\infty\) gives the completion time of the fleet motion. The joint extend operator is built by time-rescaling the single-vehicle geodesics to a common horizon \(T_p=\|(T_1,\dots,T_n)\|_p\), producing a joint unit-speed geodesic in the product metric. The product space remains \(Q\)-Ahlfors regular with \(Q=4n\), so PRM*, RRT, and RRT* retain probabilistic completeness or asymptotic optimality under the paper’s radius conditions [2108.03191].

In multi-robot Ackermann planning, joint-space coupling appears in configuration-time rather than as a closed-form product metric. Collision avoidance is enforced at each discrete step by non-overlap of robot footprints, and multi-robot interaction constrains which primitive or mode sequence remains admissible for each robot. The centralized methods use Conflict-Based Search with hybrid A* at the low level, while the decentralized method resolves conflicts by priority inheritance and backtracking. The dissertation states that, from a “multi-modal Reeds-Shepp curve” perspective, this becomes a constrained mode-switching problem in joint configuration-time space. Empirically, the count-based CL-PIBT variant attains success rate above \(90\%\) for 60 car-like robots in a \(100\times100\) environment with obstacles, within 4 seconds per instance; ECCR improves path quality but is less scalable [2506.09914].

This suggests two distinct but compatible meanings of multimodality in fleet settings: one at the level of individual vehicle primitives or steering regimes, and another at the level of the fleet coupling norm or conflict structure that determines how those per-vehicle modes can be synchronized [2108.03191][2506.09914].

## 5. Continuous-curvature, spherical, and lifted variants

A major extension replaces discontinuous-curvature Reeds-Shepp arcs with continuous-curvature surrogates while preserving the same driving patterns. In continuous-curvature steering, the planning state is \(q=(x,y,\theta,\kappa)^\top\) with controls \(u_q=(v,\sigma)^\top\), where \(\sigma=\dot{\kappa}\) is sharpness. The paper derives a special class of continuous-curvature paths that admit the same driving patterns as Reeds-Shepp paths but consist of cusp-free clothoid turns. Its geometric machinery is organized around clothoid turns, CC circles, and \(\mu\)-tangency, leading to explicit existence conditions for classes such as \(C|C_uC_u|C\) and \(C|C_{\pi/2}SC_{\pi/2}|C\). When \(\sigma_{\max}\to\infty\), the shortest continuous-curvature steering problem reduces to Reeds-Shepp steering. In closed-loop parking experiments, using exactly the same NMPC, continuous-curvature references substantially outperform Reeds-Shepp references [2405.06290].

A different non-Euclidean generalization appears on the unit sphere. There the configuration is a rotation matrix in \(SO(3)\), the cost is minimum time, and the primitive modes are \(C\) for tight turning, \(G\) for great-circle motion, and \(T\) for turn-in-place. For \(U_{\max}\ge 1\), every time-optimal path belongs to a sufficient list of 23 path types, each with at most six segments from \(\{C,G,T\}\). The resulting spherical convexified Reeds-Shepp problem is an explicit three-mode optimal-control system in which switching between motion primitives is part of the optimal structure [2504.00966].

Lifted and relaxed Reeds-Shepp geometries provide another axis of generalization. In image analysis, optimal paths are computed on \(\mathbb{R}^d\times\mathbb{S}^{d-1}\) with data-driven Finsler metrics that penalize both longitudinal motion and orientation change, optionally without reverse gear. The paper explicitly frames such constructions as a natural setting for “multi-modal Reeds-Shepp curves,” because the costs \(\mathcal C_1,\mathcal C_2\) can be adapted to 2D retina, 3D diffusion MRI, and, in principle, several modalities simultaneously [1612.06137]. In dynamic off-the-grid tracking, the problem is lifted to the roto-translation space \(\mathrm{RT}^d=\mathbb{R}^d\times\mathbb{S}^{d-1}\), regularized by a relaxed Reeds-Shepp metric, and used to untangle crossing trajectories that are ambiguous in \(\mathbb{R}^2\). The work derives properties of polygonal, Bézier, and piecewise-geodesic discretizations and proves a \(\Gamma\)-convergence result for the discretized energies [2507.10359].

These variants show that multimodality can arise from steering hardware, from continuity constraints on curvature, from non-Euclidean manifold geometry, or from modality-dependent costs on lifted state spaces [2405.06290][2504.00966][1612.06137][2507.10359].

## 6. Interpretation, limitations, and recurrent design principles

A common misconception is that multi-modal Reeds-Shepp curves refer to a single universally accepted model. The literature does not support that interpretation. The term is explicit in four-wheel independent steering, where it denotes a hybrid state \((x,y,\theta,m)\) and per-mode Reeds-Shepp planning. In other settings, the same phrase is interpretive: it may denote a primitive library for Ackermann robots, a selector over classical path families, a fleet coupling parameter, or a geometry adapted to sensing modalities. This suggests that “multimodal” is best understood as a structural property of the path model rather than a fixed canonical formalism [2509.06115][2506.09914][2504.05921][1612.06137].

A second misconception is that multimodality requires abandoning Reeds-Shepp structure. Recent work generally does the opposite. Per-mode or per-family Reeds-Shepp solutions are retained as local connectors or analytic primitives, while the higher-level planner adds a small number of switching mechanisms: mode-switch edges, focal search constraints, priority inheritance, or \(L^p\) joint metrics. In the 4WIS planner, no single closed-form distance is written for the full hybrid space; in the Ackermann multi-robot dissertation, the implicit lattice uses motion primitives and hybrid A* rather than a fully explicit augmented-state geodesic. Multimodality is therefore usually layered on top of classical Reeds-Shepp geometry rather than replacing it [2509.06115][2506.09914].

The main limitations are likewise mode-specific. The 4WIS formulation does not give a full Reeds-Shepp family for parallel mode, ignores obstacles during Reeds-Shepp computation, and is not globally optimal in continuous \(\mathrm{SE}(2)\times M\) [2509.06115]. The multi-robot Ackermann methods guarantee kinematic feasibility by construction and collision avoidance at discrete time steps, but the dissertation does not provide a closed-form bound for the full multi-robot problem under Ackermann kinematics [2506.09914]. The non-Euclidean sampling theory assumes metric-based cost, geodesic Extend, and static free space [2108.03191]. The continuous-curvature construction is restricted to a special class of valid CC paths and zero-curvature boundary conditions [2405.06290]. The spherical classification is stated for \(U_{\max}\ge 1\) [2504.00966]. The lifted imaging and trajectory-untangling formulations are relaxed or approximating geometries rather than exact classical Reeds-Shepp boundary-value solvers [1612.06137][2507.10359].

Across these formulations, three design principles recur. First, define a finite mode library whose elements retain clear kinematic meaning. Second, attach an analytic or efficiently computable local connector to each mode or path family. Third, make switching explicit, either as a geometric partition, a graph edge with penalty, or a joint metric coupling. That pattern underlies classical path-family partitioning, hybrid A* with steering modes, multi-robot primitive planning, fleet product metrics, continuous-curvature surrogates, and non-Euclidean generalizations alike [2504.05921][2509.06115][2108.03191].

Source: https://www.emergentmind.com/topics/multi-modal-reeds-shepp-curves