Sign inGet started
Paper · arXiv

GRID-Planner: Graph-Structured Relational Reward Shaping for Diffusion Planning

Autonomous driving planning requires selecting trajectories that remain safe, rule-compliant, and comfortable under complex multi-agent interactions, yet robust closed-loop decision making in planning-critical scenes remains challenging. Existing diffusion- and RL-based planners often rely on generic rewards and use relational structure mainly for representation, limiting how planning-critical rollouts shape policy improvement. We present GRID-Planner, a graph--reward integrated diffusion planning framework that aligns generative planning with structured relational signals. Specifically, GRID-Planner combines graph-aware importance weighting, a time-indexed relational reward surrogate, an...

AuthorsZhao Yang, Zezhong Qian, Yinan Shi et al.
Primary categorycs.RO
Published15 October 2026
Last updated at source15 October 2026
cs.ROcs.CV
Embed this entry
<iframe src="https://silytics.si/embed/item/12cd8b79-bc67-4193-87ec-82483add0dd5" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Popularity, last 3 days

0 now. Counts as reported by the source, snapshotted daily by Silytics.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 18 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.