{"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/identification-of-ltv-dynamical-models-with","title":"Identification of LTV Dynamical Models with Smooth or Discontinuous Time Evolution by means of Convex Optimization","arxiv_id":"1802.09794","date":"2018-02-27","proceeding":null,"authors":["Fredrik Bagge Carlson","Anders Robertsson","Rolf Johansson"],"abstract":"We establish a connection between trend filtering and system identification\nwhich results in a family of new identification methods for linear,\ntime-varying (LTV) dynamical models based on convex optimization. We\ndemonstrate how the design of the cost function promotes a model with either a\ncontinuous change in dynamics over time, or causes discontinuous changes in\nmodel coefficients occurring at a finite (sparse) set of time instances. We\nfurther discuss the introduction of priors on the model parameters for\nsituations where excitation is insufficient for identification. The\nidentification problems are cast as convex optimization problems and are\napplicable to, e.g., ARX models and state-space models with time-varying\nparameters. We illustrate usage of the methods in simulations of jump-linear\nsystems, a nonlinear robot arm with non-smooth friction and stiff contacts as\nwell as in model-based, trajectory centric reinforcement learning on a smooth\nnonlinear system.","url_abs":"http://arxiv.org/abs/1802.09794v1","url_pdf":"http://arxiv.org/pdf/1802.09794v1.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":"identification-of-ltv-dynamical-models-with","repo_url":"https://github.com/baggepinnen/LTVModels.jl","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"friction","task_name":"Friction"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"state-space-models","task_name":"State Space Models"}],"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":"baggepinnen/LTVModels.jl","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":"8292ac29a1918c10d22a0a33b1b9b1de0b657b20ea6f74f6cd69539abe3a7612","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}