{"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/learning-a-lattice-planner-control-set-for","title":"Learning a Lattice Planner Control Set for Autonomous Vehicles","arxiv_id":"1903.02044","date":"2019-03-05","proceeding":null,"authors":["Ryan De Iaco","Stephen L. Smith","Krzysztof Czarnecki"],"abstract":"This paper introduces a method to compute a sparse lattice planner control\nset that is suited to a particular task by learning from a representative\ndataset of vehicle paths. To do this, we use a scoring measure similar to the\nFr\\'echet distance and propose an algorithm for evaluating a given control set\naccording to the scoring measure. Control actions are then selected from a\ndense control set according to an objective function that rewards improvements\nin matching the dataset while also encouraging sparsity. This method is\nevaluated across several experiments involving real and synthetic datasets, and\nit is shown to generate smaller control sets when compared to the previous\nstate-of-the-art lattice control set computation technique, with these smaller\ncontrol sets maintaining a high degree of manoeuvrability in the required task.\nThis results in a planning time speedup of up to 4.31x when using the learned\ncontrol set over the state-of-the-art computed control set. In addition, we\nshow the learned control sets are better able to capture the driving style of\nthe dataset in terms of path curvature.","url_abs":"http://arxiv.org/abs/1903.02044v2","url_pdf":"http://arxiv.org/pdf/1903.02044v2.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":"learning-a-lattice-planner-control-set-for","repo_url":"https://github.com/rdeiaco/learning_lattice_planner","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"autonomous-vehicles","task_name":"Autonomous Vehicles"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"rdeiaco/learning_lattice_planner","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"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"54043a45975dc4015e107827cde7101e608d9ffddebd0496198335c2f96bf747","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}