Conditional Trajectory Peaks: Single-Pass Multimodal Policies over Action Chunks

Di Wu, Rongtian Shen, Ping Liu, Xuhua Chen, He Zheng, Lingfeng Zhang, Tao Zhang

Magiclab Robotics Technology Co., Ltd. · Southeast University

Published October 5, 2026 · on the feed October 7, 2026 · ▲ 2 · arXiv 2610.06104

Vision & multimodal No code arXiv ↗Hugging Face ↗

The abstract

Multimodal imitation learning requires diverse executable futures under the same observation and consistent behavior across replanning cycles. We present Conditional Trajectory Peaks (CTP), a single-pass policy framework that jointly predicts complete action-chunk candidates, probability masses, and trajectory scales. Distribution-Aware Peak Specialization (DAPS) specializes trajectory peaks using trajectory-level posterior responsibilities and mass- and scale-modulated overlap constraints. Evidence-Gated Trajectory Belief Transport (ETBT) maintains cross-chunk consistency through geometric correspondence between exchangeable candidate sets, while allowing current policy evidence to override historical constraints. CTP achieves a coverage score of 91.40% on Push-T; success rates of 100.0%, 79.72%, and 84.44% on D3IL Avoiding, Aligning, and Sorting-2, respectively. On LIBERO, CTP achieves an average success rate of 97.25%. In real-world dual-arm experiments, CTP preserves both placement modes in a two-plate task, succeeding in all 50 trials. On bottle uprighting and pen placement into a holder, it maintains success rates comparable to π_{0.5} while reducing policy inference latency from 218.24 ms to 75.80 ms. These results demonstrate that single-pass trajectory modeling can combine multimodal behavior, closed-loop consistency, and efficient inference.

The Brief

2:25

A short podcast summary of the paper. Written and voiced by AI.

Transcript

Conditional Trajectory Peaks. Single-Pass Multimodal Policies over Action Chunks. By Di Wu and six others, from Magiclab Robotics and Southeast University. Published on the fifth of October. No code repository is linked to it.

Multimodal imitation learning asks two things of a policy at once. Given the same observation, it should be able to produce diverse futures that can all be executed. And across replanning cycles, its behaviour should stay consistent, not hop between those futures from one cycle to the next. Doing both, and doing it quickly, is the challenge this work addresses.

Conditional Trajectory Peaks, or CTP, is a single-pass policy framework. In one pass it jointly predicts a set of complete action-chunk candidates, a probability mass for each, and a scale for each trajectory. Each candidate is a peak: one possible future, with a weight attached.

Two components shape those peaks. Distribution-Aware Peak Specialization, or DAPS, makes the peaks specialize, using posterior responsibilities computed at the level of whole trajectories, together with overlap constraints modulated by mass and scale. Evidence-Gated Trajectory Belief Transport, or ETBT, handles consistency across chunks. It matches one candidate set to the next through geometric correspondence, treating the candidates as exchangeable, and still lets current policy evidence override the constraints inherited from history.

On Push-T, CTP reaches a coverage score of ninety-one point four percent. On D3IL, its success rates are one hundred percent on Avoiding, seventy-nine point seven two percent on Aligning, and eighty-four point four four percent on Sorting-2. On LIBERO it averages ninety-seven point two five percent.

In real-world dual-arm experiments, CTP keeps both placement modes alive in a two-plate task and succeeds in all fifty trials. On bottle uprighting and on placing a pen into a holder, its success rates are comparable to pi zero point five, while policy inference latency falls from two hundred eighteen point two four milliseconds to seventy-five point eight milliseconds.

The authors' conclusion is that single-pass trajectory modeling can deliver three properties together: multimodal behaviour, consistency in closed loop, and efficient inference. All three rest on one design choice. The policy lays out several weighted futures in a single pass, and then decides, chunk by chunk, how far the past should constrain which of them it carries forward.

More with an account

Listen to every day’s papers

Daily playlists, deep dives, quests for the papers, and quizzes on their key terms.

Join free
KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.