Papers › Planning-oriented Autonomous Driving

Planning-oriented Autonomous Driving

20 Dec 2022CVPR 2023 1arXiv:2212.10156archive 2025-07-28

Yihan Hu, Jiazhi Yang, Li Chen, Keyu Li, Chonghao Sima, Xizhou Zhu, Siqi Chai, Senyao Du, Tianwei Lin, Wenhai Wang, Lewei Lu, Xiaosong Jia, Qiang Liu, Jifeng Dai, Yu Qiao, Hongyang Li

Modern autonomous driving system is characterized as modular tasks in sequential order, i.e., perception, prediction, and planning. In order to perform a wide diversity of tasks and achieve advanced-level intelligence, contemporary approaches either deploy standalone models for individual tasks, or design a multi-task paradigm with separate heads. However, they might suffer from accumulative errors or deficient task coordination. Instead, we argue that a favorable framework should be devised and optimized in pursuit of the ultimate goal, i.e., planning of the self-driving car. Oriented at this, we revisit the key components within perception and prediction, and prioritize the tasks such that all these tasks contribute to planning. We introduce Unified Autonomous Driving (UniAD), a comprehensive framework up-to-date that incorporates full-stack driving tasks in one network. It is exquisitely devised to leverage advantages of each module, and provide complementary feature abstractions for agent interaction from a global perspective. Tasks are communicated with unified query interfaces to facilitate each other toward planning. We instantiate UniAD on the challenging nuScenes benchmark. With extensive ablations, the effectiveness of using such a philosophy is proven by substantially outperforming previous state-of-the-arts in all aspects. Code and models are public.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 1 code sample harvested from 1 repository linked to this paper: 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified. Where Syntology's instrument failed: 1 where our contract draft was wrong; failures of Syntology's instrument, not of the code. Every run on this page is a failure of Syntology's instrument, not of the code.

By repository: official repository: 1 sample from 1 repository, 1 ran (0 with no instrument failure; 1 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-22 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

opendrivelab/uniad officialmentioned in papermentioned on GitHubpytorchSyntology: 1 sample, 1 ran (1 instrument-failed) · 0 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

1 sample harvested: 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Every run on this page is a failure of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · our draft was wrong

Licence: 0 of the 1 sample are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from opendrivelab/uniad. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

opendrivelab/uniad official repository 1 sample, 1 ran (1 instrument-failed) · 0 unverified
pop_elem_in_result projects/mmdet3d_plugin/uniad/detectors/uniad_e2e.py ran · our draft was wrong Apache-2.0 (permissive) · 4be179dbae6f2c88 · report fixture: signature task_result:dict/0/?, pop_list:list/1/str · returned dict · level recorded 2026-09-22

Tasks

Autonomous DrivingBench2DriveNavSimPhilosophyTrajectory Planning

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Bench2Drive Bench2Drive UniAD-Base Driving Score 45.81 #26 of 35 Archive leaderboard report
Bench2Drive Bench2Drive UniAD-Tiny Driving Score 40.73 #31 of 35 Archive leaderboard report
NavSim OpenScene UniAD PDMS 83.4 #23 of 29 Archive leaderboard report
Trajectory Planning nuScenes UniAD Collision-1s 0.05 #3 of 4 Archive leaderboard report
Trajectory Planning nuScenes UniAD Collision-2s 0.17 #3 of 4 Archive leaderboard report
Trajectory Planning nuScenes UniAD Collision-3s 0.71 #3 of 4 Archive leaderboard report
Trajectory Planning nuScenes UniAD Collision-Avg 0.31 #3 of 4 Archive leaderboard report
Trajectory Planning nuScenes UniAD L2-1s 0.48 #3 of 4 Archive leaderboard report
Trajectory Planning nuScenes UniAD L2-2s 0.96 #3 of 4 Archive leaderboard report
Trajectory Planning nuScenes UniAD L2-3s 1.65 #3 of 4 Archive leaderboard report
Trajectory Planning nuScenes UniAD L2-Avg 1.03 #3 of 4 Archive leaderboard report
Trajectory Planning nuScenes ST-P3 (Lidar) Collision-1s 0.23 #4 of 4 Archive leaderboard report
Trajectory Planning nuScenes ST-P3 (Lidar) Collision-2s 0.62 #4 of 4 Archive leaderboard report
Trajectory Planning nuScenes ST-P3 (Lidar) Collision-3s 1.27 #4 of 4 Archive leaderboard report
Trajectory Planning nuScenes ST-P3 (Lidar) Collision-Avg 0.71 #4 of 4 Archive leaderboard report
Trajectory Planning nuScenes ST-P3 (Lidar) L2-1s 1.33 #4 of 4 Archive leaderboard report
Trajectory Planning nuScenes ST-P3 (Lidar) L2-2s 2.11 #4 of 4 Archive leaderboard report
Trajectory Planning nuScenes ST-P3 (Lidar) L2-3s 2.9 #4 of 4 Archive leaderboard report
Trajectory Planning nuScenes ST-P3 (Lidar) L2-Avg 2.11 #4 of 4 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections