{"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/trafficpredict-trajectory-prediction-for","title":"TrafficPredict: Trajectory Prediction for Heterogeneous Traffic-Agents","arxiv_id":"1811.02146","date":"2018-11-06","proceeding":null,"authors":["Yuexin Ma","Xinge Zhu","Sibo Zhang","Ruigang Yang","Wenping Wang","Dinesh Manocha"],"abstract":"To safely and efficiently navigate in complex urban traffic, autonomous\nvehicles must make responsible predictions in relation to surrounding\ntraffic-agents (vehicles, bicycles, pedestrians, etc.). A challenging and\ncritical task is to explore the movement patterns of different traffic-agents\nand predict their future trajectories accurately to help the autonomous vehicle\nmake reasonable navigation decision. To solve this problem, we propose a long\nshort-term memory-based (LSTM-based) realtime traffic prediction algorithm,\nTrafficPredict. Our approach uses an instance layer to learn instances'\nmovements and interactions and has a category layer to learn the similarities\nof instances belonging to the same type to refine the prediction. In order to\nevaluate its performance, we collected trajectory datasets in a large city\nconsisting of varying conditions and traffic densities. The dataset includes\nmany challenging scenarios where vehicles, bicycles, and pedestrians move among\none another. We evaluate the performance of TrafficPredict on our new dataset\nand highlight its higher accuracy for trajectory prediction by comparing with\nprior prediction methods.","url_abs":"http://arxiv.org/abs/1811.02146v5","url_pdf":"http://arxiv.org/pdf/1811.02146v5.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":"trafficpredict-trajectory-prediction-for","repo_url":"https://github.com/ApolloScapeAuto/dataset-api","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"autonomous-vehicles","task_name":"Autonomous Vehicles"},{"task_slug":"navigate","task_name":"Navigate"},{"task_slug":"prediction","task_name":"Prediction"},{"task_slug":"traffic-prediction","task_name":"Traffic Prediction"},{"task_slug":"trajectory-prediction","task_name":"Trajectory Prediction"}],"methods":[],"datasets_introduced":[{"slug":"apolloscape-trajectory","name":"Apolloscape Trajectory","full_name":""}],"methods_introduced":[],"results":[{"leaderboard":"/sota/trajectory-prediction-on-apolloscape-1","task":"Trajectory Prediction","dataset":"Apolloscape Trajectory","model":"Trafficpredict","rank_in_archive_order":1,"of":1,"metrics":{"ADE":"8.5881"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1811.02146","atlas_url":"https://app.syntology.ai/?focus=1811.02146","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_citation_path","arguments":{"paper_1":"1811.02146"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1811.02146\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1811.02146"},"call":"get_concepts_for_paper(arxiv_id=\"1811.02146\")"}],"by_repo":[{"repo":"ApolloScapeAuto/dataset-api","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2007.08854"],"harvested_for_calls":[{"arxiv_id":"2007.08854","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2007.08854"},"call":"get_harvested_code_for_paper(arxiv_id=\"2007.08854\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"4120198e9c82bf572bef22e27b872069ddda9a439e2c55f1ffec28f28cf9f5b8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}