---
title: Dual-Stage Cost Modeling Mechanism (DCMM)
url: https://www.emergentmind.com/topics/dual-stage-cost-modeling-mechanism-dcmm
type: topic
---

# Dual-Stage Cost Modeling Mechanism (DCMM)

Searching arXiv for the cited DCMM and related framework papers to ground the article in the referenced literature.
The Dual-Stage Cost Modeling Mechanism (DCMM) is a two-stage cost framework introduced within the Momentum-constrained Hybrid Heuristic Trajectory Optimization Framework (MHHTOF) for assistive navigation in visually impaired scenarios. In this formulation, trajectory planning is divided into a Frenet-frame stage for generating feasible and smooth candidates and a Cartesian-frame stage for reward-driven adaptive evaluation and selection. The mechanism is intended to reconcile a stated tension between “Frenet-only optimization,” which is efficient and geometrically convenient but often too rigid for semantic and user-centric preferences, and “Cartesian-only learning / DRL,” which can encode richer context and interpretability but may lose geometric consistency and behave unstably or opaquely [2604.14986]. A closely related but differently named two-stage architecture appears in a separate system-modeling context, where interface-based structural complexity is first bounded and then translated into cost through cost factors; that framework does not use the term DCMM, but it exhibits a comparable “structure → complexity bound → cost bound” pipeline [2607.00054].

## 1. Conceptual definition and problem setting

DCMM is presented as the bridge between heuristic trajectory generation and learning-based trajectory refinement inside MHHTOF. Its stated role is to make planning both “physically feasible and smooth” in structured path space and “semantically adaptive, interpretable, and user-centered” in decision space [2604.14986]. In the 2025 presentation of MHHTOF, DCMM is described as a “dual-stage cost modeling mechanism (DCMM) with weight transfer” that aligns semantic priorities across stages and supports human-centered optimization [2509.15582].

The mechanism is motivated by a planning problem specific to visually impaired scenarios. The cited work states that existing assistive trajectory planners struggle with multi-objective optimization, generalization, and interpretability, and that neither purely heuristic Frenet optimization nor purely Cartesian learning is sufficient by itself [2604.14986]. The first is described as efficient and geometrically consistent but limited in global semantic awareness and social or contextual adaptability; the second is described as semantically expressive but weaker at preserving geometric consistency and stable motion generation [2509.15582].

Within that problem setting, DCMM is not merely a scalar objective function. It is a coupled two-stage scheme in which the first stage secures feasible and smooth motion in structured environments, while the second stage incorporates adaptive semantic evaluation [2604.14986]. The 2025 version makes this coupling explicit by characterizing DCMM as a cross-stage cost alignment scheme through “weight transfer,” so that the heuristic generator and the DRL policy remain organized around the same human-centered objective family rather than optimizing unrelated criteria [2509.15582].

## 2. First stage: Frenet-space cost modeling

The first stage of DCMM operates during trajectory sampling and generation in the Frenet coordinate system. The cost is given as
$$
J[d, s]=J_{d}[d]+k_{s} J_{s}[s], \quad k_{s}>0
$$
where \(J_d[d]\) penalizes lateral irregularity, such as abrupt curvature changes or deviation from navigable boundaries, and \(J_s[s]\) evaluates longitudinal consistency, emphasizing smooth velocity and feasible deceleration [2604.14986]. In the 2025 formulation, this same stage is described as a Frenet-frame multi-objective cost used during heuristic trajectory sampling cluster generation [2509.15582].

The Frenet state is defined as
$$
\left[s, \dot{s}, \ddot{s} ; d, \dot{d}, \ddot{d}, d^{\prime}, d^{\prime \prime}\right],
$$
with \(s\) denoting longitudinal arc length, \(d\) denoting lateral deviation, \(\dot{s}\) and \(\ddot{s}\) denoting longitudinal velocity and acceleration, \(\dot{d}\) and \(\ddot{d}\) denoting lateral velocity and acceleration, and \(d'\) and \(d''\) denoting lateral variation or curvature smoothness terms [2604.14986]. The spatial conversion is written as
$$
\boldsymbol{x}(s(t), d(t))= \boldsymbol{r}(s(t))+d(t) \boldsymbol{n}_{c}(s(t)),
$$
and the Cartesian back-mapping is given by
$$
\boldsymbol{x}(t)=\boldsymbol{Q}(x(t), y(t))=\mathbf{F}(s, d).
$$
The cited paper explicitly states that these transformations “guarantee geometric consistency and serve as the basis for dynamic feasibility and constraint enforcement in planning” [2604.14986].

Trajectory generation in this stage uses polynomial interpolation. The 2026 account states that candidate segments are generated with “third-/fifth-order polynomial interpolation” and endpoint constraints, while the 2025 account specifies generation by fifth-order polynomial parameterization with third-order endpoint smoothing [2604.14986; 2509.15582]. The polynomial form is written as
$$
\left\{\begin{array}{l}
s(t)=\sum_{i=0}^{5} a_{i} \times t^{i} \\
d(s)=\sum_{i=0}^{5} b_{i} \times s^{i}
\end{array}\right.
$$
with coefficients solved from boundary conditions [2604.14986]. The 2025 paper also gives the third-order endpoint smoothing construction to ensure continuity of position, velocity, and acceleration across sampled segments [2509.15582].

A further continuity constraint is specified in the 2026 presentation:
$$
Z(\boldsymbol{\xi}(t_\tau)) =
\begin{bmatrix}
\dot{s}_i(t_\tau) - \dot{s}_{\mathrm{center}(t_\tau)} \\
\ddot{s}_i(t_\tau) - \ddot{s}_{\mathrm{center}(t_\tau)} \\
\dot{d}_i(t_\tau) - \dot{d}_{\mathrm{center}(t_\tau)} \\
\ddot{d}_i(t_\tau) - \ddot{d}_{\mathrm{center}(t_\tau)} \\
\alpha_p \Delta_0 - \|\boldsymbol{\xi}_i(t_\tau) - \boldsymbol{\xi}_{i-1}(t_\tau)\|
\end{bmatrix}
= \boldsymbol{0},
$$
where \(\boldsymbol{\xi}(t) = [ s(t), \dot{s}(t), \ddot{s}(t), d(t), \dot{d}(t), \ddot{d}(t) ]\), \(\Delta_0\) is the nominal spacing, and \(\alpha_p \in [0.8, 1.2]\) scales spacing based on perception or environmental complexity [2604.14986]. This stage therefore produces a trajectory cluster that is already smooth, dynamically plausible, and structured enough for subsequent evaluation.

## 3. Second stage: Cartesian-space adaptive evaluation

After candidate trajectories \(\mathcal{T}\) are projected into Cartesian space, DCMM re-evaluates them using a DRL-guided adaptive cost. The 2026 presentation gives
$$
J_{\text{eval}^{\text{DRL}(x^{(i)}(t)) = \sum_{j=1}^{n} \lambda_j^{\text{DRL} \cdot \phi_j(x^{(i)}(t)), \quad x^{(i)}(t) \in \mathcal{T}
$$
and the final selection rule
$$
x^*(t) = \arg\min_{x^{(i)}(t) \in \mathcal{T} J_{\text{eval}^{\text{DRL}(x^{(i)}(t)).
$$
The 2025 version presents the same structure, describing \(\phi_j(\cdot)\) as interpretable Cartesian-space metrics and \(\lambda_j^{\text{DRL}}\) as adaptive weights predicted or adjusted by the policy network according to environment context and user preference [2509.15582].

The 2025 paper instantiates the stage-2 cost with seven interpretable terms:
$$
J_s = \sum_{i=1}^{n} \lambda_i^{\text{DRL} \phi_i(x(t))
$$
with
$$
\left\{
\begin{array}{ll}
\phi_1(x) = \int a_x^2(t)\,dt & \text{(AE)} \\
\phi_2(x) = \int j^2(t)\,dt & \text{(JM)} \\
\phi_3(x) = \int \left| v_x(t) - v_{\text{desire}(t)} \right|\,dt + \left(v_x(t_f)-v_{\text{desire}(t_f)}\right)^2 & \text{(VO)} \\
\phi_4(x) = \int d^2(t)\,dt & \text{(PD)} \\
\phi_5(x) = \int \frac{1}{\Delta x_{\text{obs}}^2(t)}\,dt & \text{(OPP)} \\
\phi_6(x) = \int f(x,0,\Sigma_{\text{rot}})\,dx\,dt & \text{(RFP)} \\
\phi_7(x) = \int \frac{1-t/T}{d_{\mathrm{M}(v_j(t),v_x(t),\Sigma(t))}}\,dt & \text{(SC)}
\end{array}
\right.
$$
corresponding to acceleration energy, jerk minimization, velocity optimality, path deviation, obstacle proximity penalty, risk field penalty, and social compliance [2509.15582].

This second stage is the semantically adaptive component of DCMM. The 2026 description characterizes the evaluation metrics as including curvature continuity, obstacle clearance, and social compliance, with adaptive weights learned by the policy [2604.14986]. The 2025 description emphasizes that the stage explicitly evaluates safety margin, social behavior, and risk awareness rather than only geometric smoothness [2509.15582]. The decision mechanism is therefore not direct motor control, but candidate re-ranking under a learned, interpretable cost structure.

## 4. Weight transfer, adaptive weighting, and human-centered optimization

A central feature of DCMM is that the priorities used in the first and second stages are aligned rather than isolated. The 2025 paper names this explicitly as “weight transfer,” stating that heuristic sampling in the Frenet frame ensures feasibility and comfort via a multi-objective cost function, while reward-driven refinement in the Cartesian frame enhances trajectory quality, and that “A weight transfer mechanism aligns both stages” [2509.15582]. In practical terms, the first stage emphasizes smoothness, feasibility, comfort, and boundary adherence, while the second stage evaluates smoothness, obstacle clearance, social compliance, and risk, yielding continuity of semantic priorities across stages rather than a reset between heuristic planning and learning [2509.15582].

The adaptive update rule for the DRL-controlled weights is given as
$$
\lambda_i^{t} = \text{clip}\left(\lambda_i^{t-1} + \Delta \lambda_i^{\text{DRL}, \lambda_i^{\min}, \lambda_i^{\max}\right).
$$
Both versions stress that the policy does not output low-level control directly. Instead, it adjusts the importance of each cost term, and the clipped update preserves interpretability and stability [2604.14986; 2509.15582]. The 2026 account specifically notes that this is crucial because the agent’s action is interpretable as a change in cost priorities rather than an opaque motor command [2604.14986].

The observation used for weight adaptation is described as a cognitive state,
$$
o_{t}^{\operatorname{cog}=\{ \hat{v}_{t}, \hat{a}_{t}, \hat{\omega}_{t}, \theta_{t}, \ d_{\text {goal }, t_{\text {remain }, \mathbf{1}_{\text {goal }, \ \phi_{\text {lane }^{L}, \phi_{\text {lane }^{R}, \rho_{\text {obs }, \ \left.\eta_{\text {valid }, F_{\text {feas }, \mu_{F}, \sigma_{F}, p_{\text {risk }^{\operatorname{cog}\right\} \end{aligned}
$$
which the paper explains includes estimated motion states, obstacle proximity, perceived collision risk, feasibility indicators, and lane semantic cues [2604.14986]. Reward shaping is hierarchical:
$$
r_{t}=\sum_{l \in\{\text { task }, \text { behav, risk }\} \lambda_{l} \cdot \sum_{k} r_{t}^{(l, k)},
$$
with Task Guidance Layer, Behavior Guidance Layer, and Risk Avoidance Layer, and subrewards including task completion feedback, completion timing, reference alignment deviation, speed deviation penalty, goal distance reduction, cost-optimality bias, self-action risk, and environmental risk [2604.14986].

On that basis, DCMM is described as human-centered. The cited material states that it lets the planner adaptively trade off safety, comfort, efficiency, and social compliance in real time [2604.14986]. For visually impaired users, the paper gives examples such as slowing down near dense obstacles, prioritizing smoother motion in complex geometry, and favoring safer, more conservative paths in uncertain environments [2604.14986]. The 2025 account further associates this with perceptual alignment, emphasizing structured motion cues, boundaries, and lane semantics [2509.15582]. A plausible implication is that human-centeredness in DCMM arises not from replacing analytical planning with learned control, but from constraining learned adaptation to occur through interpretable cost priorities.

## 5. Integration with HTSC, MTO, and residual-enhanced DRL

DCMM is embedded in MHHTOF together with the Heuristic Trajectory Sampling Cluster (HTSC), Momentum-Constrained Trajectory Optimization (MTO), and residual-enhanced DRL. HTSC generates a compact set of candidate trajectories in the Frenet frame using quintic polynomials and endpoint smoothing [2604.14986]. In the 2025 abstract, the framework is summarized as integrating “trajectory sampling generation, optimization and evaluation with residual-enhanced deep reinforcement learning (DRL),” with HTSC generated in the Frenet coordinate system using third-order interpolation with fifth-order polynomials and MTO constraints to ensure smoothness and feasibility [2509.15582].

MTO refines these candidates using a physically motivated cost. The 2026 paper gives the Lagrangian
$$
L_i(t) = E_{\text{motion},i}(t)-E_{\text{guidance},i}(t)
$$
expanded as
$$
\begin{aligned}
L_{i}(t)= & \frac{1}{2} m_{i}\left\|v_{i}(t)\right\|^{2} - F_{\text {asst}}(t) \cdot v_{i}(t) - F_{\text {obs}}(t) \cdot\left(v_{i}(t)-v_{j}(t)\right) \\
& + \lambda_{s}\left\|\dot{v}_{i}(t)\right\|^{2} + \lambda_{u} \cdot \operatorname{Tr}\left[\Sigma_{i}^{\text {perception}}(t)\right]
\end{aligned}
$$
and the optimization objective
$$
\boldsymbol{u}^* = \arg \min_{\boldsymbol{u}_{0:N} \Bigg[ \int_{t_0}^{t_0 + N\Delta t} L_i\left(\boldsymbol{u}(t), \boldsymbol{\xi}(t), \mathcal{T} \right) \, dt  + Z\left(\boldsymbol{\xi}(t_0 + N\Delta t), \mathcal{T} \right) \Bigg].
$$
The 2025 paper presents an analogous formulation in terms of motion energy, guidance forces, crowd interaction, smoothness regularization, and perceptual uncertainty [2509.15582].

The residual-enhanced DRL module receives the DCMM-generated candidates and the cognitive observation vector, then learns adaptive weights \(\lambda_i^{\text{DRL}}\) using PPO with residual blocks and LSTM temporal modeling [2604.14986]. The 2026 paper specifies the architecture as a policy network \(4 \rightarrow 32\), two ResBlocks, LSTM \(100 \rightarrow 8\), output \(8 \rightarrow 2\), with a value or reward network of the same pattern and output \(8 \rightarrow 1\) [2604.14986]. Both versions emphasize that DCMM is the bridge between deterministic heuristic optimization and adaptive policy learning: the first stage supplies the feasible candidate set, and the second stage supplies semantic ranking and dense learning signals [2604.14986; 2509.15582].

## 6. Empirical results, interpretation, and relation to adjacent frameworks

The experimental evidence reported for MHHTOF supports the effectiveness of the combined mechanism that DCMM enables, although the papers also state that DCMM is not isolated in a standalone ablation [2604.14986; 2509.15582]. The 2026 paper reports that the proposed LSTM-ResB-PPO converges in about 520,000 steps, whereas baseline PPO needs about 1,000,000 steps to reach comparable stability [2604.14986]. The 2025 abstract summarizes this as stable policy performance in approximately half the training iterations required by the PPO baseline [2509.15582].

Reported reward metrics in the 2026 account are Final performance (FP) 861.138 vs 822.301, Peak reward (PR) 877.502 vs 869.986, Converged performance (CP) 861.055 vs 855.022, and Minimum reward (MR) 851.776 vs 841.548 [2604.14986]. Stability is described as only 1 fluctuation for the proposed model, compared with 5 and 7 fluctuations for GRU and bi-GRU variants, and a stable episode length of 147 at about 520,000 steps [2604.14986]. The cost metrics reported are an average cost reduction from 0.166472 to 0.116065, corresponding to a 30.3% reduction, and a cost variance reduction from 0.102921 to 0.048067, corresponding to a 53.3% improvement [2604.14986]. Risk metrics include a reduction in ego risk from \(4.848913 \times 10^{-4}\) to \(1.053492 \times 10^{-4}\) and in obstacle risk from \(1.716621 \times 10^{-4}\) to \(3.336874 \times 10^{-5}\) [2604.14986]. The 2025 abstract summarizes the latter as lowering ego and obstacle risks by over 77% [2509.15582].

Scenario-level evidence is also reported. The 2026 paper states that baseline trajectories may violate lane semantics or fail task completion, while the proposed method preserves lane adherence, yields smoother velocity and acceleration, lowers cumulative weighted cost, and stabilizes predicted action deviation [2604.14986]. The 2025 paper provides the example of DEU_Lengede-21_1_T-15, where the baseline failed to complete the goal and moved into oncoming traffic, while LSTM-ResB-PPO completed the task correctly with lower cumulative cost, 5.4286 vs 6.6384, and lower ego risk [2509.15582].

These results support the claim that DCMM improves robustness and interpretability by splitting planning into two complementary layers: a Frenet-space cost model for geometric consistency, smoothness, and physical feasibility, and a Cartesian-space adaptive evaluation layer for semantically meaningful, user-centered re-ranking [2604.14986]. At the same time, the papers are careful about scope. The evidence is for the overall MHHTOF system rather than an isolated DCMM-only comparison [2604.14986; 2509.15582].

A related but distinct perspective is offered by the system-architecture framework in “A Quantitative Framework for Estimating System Complexity and Cost via Component Interface Analysis” [2607.00054]. That paper is not named “Dual-Stage Cost Modeling Mechanism,” but it presents a structurally similar two-layer pipeline in which complexity is estimated first from observable structure and interfaces through SCCM and cost is estimated second from that complexity plus cost factors through SCEM, supported by CCM and CCSM as the structural representation [2607.00054]. A plausible comparative interpretation is that both uses of dual-stage modeling exploit a common methodological principle: a first stage imposes a structured, bounded representation of feasibility or complexity, and a second stage converts that structure into decision-relevant cost. The domains, however, are different. In MHHTOF, the stages operate across Frenet and Cartesian spaces for assistive trajectory planning; in the component-interface framework, the stages operate from architectural structure to bounded system cost estimation [2604.14986; 2607.00054].

In summary, DCMM denotes, in the MHHTOF literature, a two-stage and cross-space cost mechanism that aligns heuristic generation with DRL-guided selection through adaptive, interpretable weighting. Its defining characteristics are the use of a Frenet-frame multi-objective cost for feasible and smooth trajectory generation, a Cartesian-frame semantic evaluation cost for candidate selection, and a weight-transfer or weight-alignment process that preserves human-centered priorities across both stages [2509.15582].

Source: https://www.emergentmind.com/topics/dual-stage-cost-modeling-mechanism-dcmm