{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/trajectory-guided-control-prediction-for-end","title":"Trajectory-guided Control Prediction for End-to-end Autonomous Driving: A Simple yet Strong Baseline","arxiv_id":"2206.08129","date":"2022-06-16","proceeding":null,"authors":["Penghao Wu","Xiaosong Jia","Li Chen","Junchi Yan","Hongyang Li","Yu Qiao"],"abstract":"Current end-to-end autonomous driving methods either run a controller based on a planned trajectory or perform control prediction directly, which have spanned two separately studied lines of research. Seeing their potential mutual benefits to each other, this paper takes the initiative to explore the combination of these two well-developed worlds. Specifically, our integrated approach has two branches for trajectory planning and direct control, respectively. The trajectory branch predicts the future trajectory, while the control branch involves a novel multi-step prediction scheme such that the relationship between current actions and future states can be reasoned. The two branches are connected so that the control branch receives corresponding guidance from the trajectory branch at each time step. The outputs from two branches are then fused to achieve complementary advantages. Our results are evaluated in the closed-loop urban driving setting with challenging scenarios using the CARLA simulator. Even with a monocular camera input, the proposed approach ranks first on the official CARLA Leaderboard, outperforming other complex candidates with multiple sensors or fusion mechanisms by a large margin. The source code is publicly available at https://github.com/OpenPerceptionX/TCP","url_abs":"https://arxiv.org/abs/2206.08129v2","url_pdf":"https://arxiv.org/pdf/2206.08129v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"trajectory-guided-control-prediction-for-end","repo_url":"https://github.com/OpenPerceptionX/TCP","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"autonomous-driving","task_name":"Autonomous Driving"},{"task_slug":"bench2drive","task_name":"Bench2Drive"},{"task_slug":"carla-longest6","task_name":"CARLA longest6"},{"task_slug":"trajectory-planning","task_name":"Trajectory Planning"}],"methods":[{"method_slug":"carla","method_name":"CARLA"},{"method_slug":"entropy-regularization","method_name":"Entropy Regularization"},{"method_slug":"ppo","method_name":"PPO"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/autonomous-driving-on-carla-leaderboard","task":"Autonomous Driving","dataset":"CARLA Leaderboard","model":"TCP","rank_in_archive_order":3,"of":18,"metrics":{"Driving Score":"75.14","Infraction penalty":"0.87","Route Completion":"85.63"},"uses_additional_data":false},{"leaderboard":"/sota/autonomous-driving-on-carla-leaderboard","task":"Autonomous Driving","dataset":"CARLA Leaderboard","model":"TCP (Reproduced)","rank_in_archive_order":8,"of":18,"metrics":{"Driving Score":"47.91","Infraction penalty":"0.77","Route Completion":"65.73"},"uses_additional_data":false},{"leaderboard":"/sota/bench2drive-on-bench2drive","task":"Bench2Drive","dataset":"Bench2Drive","model":"TCP-traj","rank_in_archive_order":20,"of":35,"metrics":{"Driving Score":"59.90"},"uses_additional_data":false},{"leaderboard":"/sota/bench2drive-on-bench2drive","task":"Bench2Drive","dataset":"Bench2Drive","model":"TCP-traj w/o distillation","rank_in_archive_order":23,"of":35,"metrics":{"Driving Score":"49.30"},"uses_additional_data":false},{"leaderboard":"/sota/bench2drive-on-bench2drive","task":"Bench2Drive","dataset":"Bench2Drive","model":"TCP","rank_in_archive_order":32,"of":35,"metrics":{"Driving Score":"40.70"},"uses_additional_data":false},{"leaderboard":"/sota/bench2drive-on-bench2drive","task":"Bench2Drive","dataset":"Bench2Drive","model":"TCP-ctrl","rank_in_archive_order":34,"of":35,"metrics":{"Driving Score":"30.47"},"uses_additional_data":false},{"leaderboard":"/sota/carla-longest6-on-carla","task":"CARLA longest6","dataset":"CARLA","model":"Trajectory-guided Control Prediction (TCP)","rank_in_archive_order":13,"of":21,"metrics":{"Driving Score":"48","Infraction Score":"0.65","Route Completion":"72"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2206.08129","atlas_url":"https://app.syntology.ai/?focus=2206.08129","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_reference_implementation","arguments":{"name":"Trajectory-guided Control Prediction"},"call":"get_reference_implementation(name='Trajectory-guided Control Prediction')","min_level":{"quoted_from_server_card":["It REFUSES rather than serving below min_level, and the refusal names the highest level that exists","so lowering min_level is a deliberate, informed choice, not a guess."],"default_on_card":2,"server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","this_implementation_level":3}},{"tool":"get_citation_path","arguments":{"paper_1":"2206.08129"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2206.08129\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2206.08129"},"call":"get_concepts_for_paper(arxiv_id=\"2206.08129\")"}],"reference_implementation":[{"method_name":"Trajectory-guided Control Prediction","assembly_sha256":"b0f88abde51feb8b","source":"generated from the paper text (not the authors' code)","level":3,"level_is_quoted_from_server_card":[{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","v3_tests_passed_both_sides":0,"level_3_note":"level 3 is recorded, but its report lists no property test that passed on both","no_rung":"No rung compares this code against the authors' implementation","no_rung_quoted_from_server_card":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results.","retrieve_with":"get_reference_implementation(name='Trajectory-guided Control Prediction')","have_check":{"url":"https://syntology.ai/api/graph/have?x=2206.08129","call":"have('2206.08129')","in_build_sample":false}}],"reference_implementation_is":"Syntology's reference implementation of this paper's method: code Syntology generated from the paper text (not the authors' code), at the level its own end-to-end run recorded (the assembly's own level, never averaged); the level's meaning is quoted from Syntology's server card, and nothing here says the code is correct or reproduces the paper's results","by_repo":[{"repo":"OpenPerceptionX/TCP","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","assemblies":[{"assembly_sha256":"b0f88abde51feb8b","source_kind":"generated","method_name":"Trajectory-guided Control Prediction","realizes_method":"Trajectory-guided Control Prediction","graph_method":"Trajectory-guided Control Prediction","realizes_severed":false,"claim":"Fuses two control signal arrays based on situation type. Inputs: a_ctl is a 1D numpy array of control signals from the direct controller; a_traj is a 1D numpy array of control signals from the trajectory-based controller (same shape as a_ctl); alpha is a scalar float in [0, 0.5] representing the com","centrality":"contribution","entry":"situation_based_fusion","entry_sha256":"a9ed703a08168774ccedf86ea59bbb437d7142cc00be71575d7687a188a1be39","n_bricks":1,"bricks":[{"entry":"situation_based_fusion","code_sha256":"a9ed703a08168774ccedf86ea59bbb437d7142cc00be71575d7687a188a1be39","role":"entry","order":0,"level":3,"status":"ran_violates"}],"ran_individually":1,"ran_individually_constructed":null,"ran_individually_by_status":{"ran_violates":1},"end_to_end":{"ran":true,"level":3,"against_independent_peer":true,"n_peers":1,"v3_tests_passed_both_sides":0,"means":"this assembly is a single routine, so the entry brick's verification IS the assembly's: it executed and two family-independent implementations agreed"},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"construction","claim_match_judges":["construction:spec_drafted_for_this_method"],"label_verdict":"matches","label_verdict_judged":false,"suggested_method":null,"batch_at":"2026-09-07T20:44:12+00:00","sibling_group":"6ef8828fdc38","n_siblings":0,"retention":"keep","provenance":"assembly:generated_reference_impl_v1","attached_at":"2026-09-07T20:44:12+00:00","attached_provenance":"assembly:generated_reference_impl_v1"}],"assembly_sibling_groups":[{"group":"6ef8828fdc38","realizes_method":"Trajectory-guided Control Prediction","source_kind":"generated","batch_at":"2026-09-07T20:44:12+00:00","members":["b0f88abde51feb8b"]}],"assemblies_is":{"about":"What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results.","harvested":"assembled from code harvested from a repository linked to the paper","generated":"generated from the paper text, not the repository's code","end_to_end":"for a harvested assembly, the assembly has not been run end-to-end; for a generated one, end_to_end.level is the assembly's own level and against_independent_peer says whether it ran against a peer: an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists","bricks_level":"each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level","ran_individually":"a COUNT of bricks that ran on their own on a fixture (split by status in ran_individually_by_status), not a level; instrument statuses are failures of Syntology's instrument, not of the code","siblings":"assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another","judged":"Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as \"by construction\" or \"not judged by a model\"","level_lowered":"a generated assembly whose level Syntology's graph lowered, with the level it had, the recorded reason and when","retention":"Syntology's spending triage for further verification, not a verdict","claim_match":"the claim_match vote: IMPLEMENTS, COMPONENT or UNCLEAR. Where claim_match_basis is \"judge:<model>\", it is one model's judgement of the assembly's label against the paper's claim (claim_match_rule single_judge, the model in claim_match_judges): not a verification and not a run. Where it is \"construction\", the value was set when the code was generated for this method and no model judged it, whatever claim_match_rule says. The page prints no claim match for any assembly","label_verdict":"whether the assembly's code is the method it is labelled with: matches, cannot_tell, mislabelled (suggested_method names what it looks like instead) or not_the_method; label_verdict_judged is true only when a model read the code (claim_match_basis \"judge:<model>\")","label_verdict_judged":"where true (claim_match_basis \"judge:<model>\"), label_verdict is a single model's judgement; not calibrated; not printed on the page; where false, it was set by construction, and the page prints it unless the node is shared with another paper (node_properties_written_for)","claim":"the claim text stored on the assembly node: for a harvested assembly, what the paper claims the code implements, as the lifting model wrote it; for a generated one, the specification the code was generated from. Not verified text","centrality":"how central the lifted method is to the paper, as the lifting step recorded it: contribution, component or incidental","v3_tests_passed_both_sides":"end_to_end.v3_tests_passed_both_sides: the number of property tests derived from the paper that passed on both implementations, as the attached report lists them; a level 3 card with 0 says its report lists none","ran_individually_constructed":"ran_individually_constructed: of the bricks counted in ran_individually, how many constructed an object rather than computing a result (Syntology's RAN record's rule, read from the graph-layer sample with the brick's code_sha256); a part of ran_individually, never subtracted from it and never a failure; null where a brick that ran has no sample in the graph layer this build read, so the figure was not counted"},"assemblies_call":{"tool":"assembly","arguments":{"arxiv_id":"2206.08129"},"call":"assembly(arxiv_id=\"2206.08129\")"}},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"a26c74a96736b243c3d7fabb7280cce54f8fe77cb233a9e52bedf61d0615a984","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}