Metraipolis › archive › dc_fec969de4cfd

Diffusion Policies for Short-Horizon Planning in Robot Crowd Navigation — arXiv:2608.27158

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.27158
License (as archived)
CC0-1.0
Archived
2026-10-17T16:12:31.327Z
SHA-256 of the archived text
0bad0487cf8bd6b6392406e24096315456b8f427133377b0fd0683636e11b02c
Stable URL of this page
https://metraipolis.com/documento/dc_fec969de4cfd

How to cite

Diffusion Policies for Short-Horizon Planning in Robot Crowd Navigation — arXiv:2608.27158 — arXiv (en), https://arxiv.org/abs/2608.27158 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fec969de4cfd (Metraipolis archive dc_fec969de4cfd, sha256 0bad0487cf8bd6b6392406e24096315456b8f427133377b0fd0683636e11b02c)
BibTeX
@misc{dcfec969de4cfd,
  title = {Diffusion Policies for Short-Horizon Planning in Robot Crowd Navigation — arXiv:2608.27158},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.27158},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fec969de4cfd; sha256 0bad0487cf8bd6b6392406e24096315456b8f427133377b0fd0683636e11b02c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.27158. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Robot crowd navigation requires safe and efficient decision-making under dense, dynamic, and multimodal human--robot interactions. Existing reinforcement-learning methods typically output a single reactive action at each timestep, which limits their ability to represent diverse short-term avoidance strategies. We propose Planning Diffusion Policy Optimization (PDPO), an offline-to-online reinforcement-learning framework that uses a diffusion policy to generate short-horizon action chunks for crowd navigation. PDPO is first pretrained on collision-avoidance demonstrations and then fine-tuned online with PPO by treating the denoising process as an internal decision process. During execution, the policy generates a five-step action chunk and applies it in a receding-horizon manner. Furthermore, we observe an evaluation artifact in common crowd-navigation benchmarks: without explicit boundary constraints, learned agents may leave the valid domain and bypass dense crowds. To address this, we introduce a setting in which boundary violations are treated as collisions. Experiments show that PDPO obtains an improved success rate over strong baselines, and ablations demonstrate that action chunks are especially important for the modified bounded benchmark.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-28 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2608.27158 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T15:34:49.953Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).