{"id":28397843,"url":"https://github.com/ziraddingulumjanly/numeration-dynamic-programming-and-qp","last_synced_at":"2026-01-28T00:37:18.898Z","repository":{"id":289889090,"uuid":"972728656","full_name":"ziraddingulumjanly/numeration-Dynamic-Programming-and-QP","owner":"ziraddingulumjanly","description":"This repository contains descriptive solutions and implementations for optimal control problems using three approaches:","archived":false,"fork":false,"pushed_at":"2025-04-25T15:05:06.000Z","size":179,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-28T12:44:31.457Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ziraddingulumjanly.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2025-04-25T15:01:25.000Z","updated_at":"2025-04-25T15:05:09.000Z","dependencies_parsed_at":"2025-04-25T16:23:02.137Z","dependency_job_id":null,"html_url":"https://github.com/ziraddingulumjanly/numeration-Dynamic-Programming-and-QP","commit_stats":null,"previous_names":["ziraddingulumjanly/numeration-dynamic-programming-and-qp"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ziraddingulumjanly/numeration-Dynamic-Programming-and-QP","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ziraddingulumjanly%2Fnumeration-Dynamic-Programming-and-QP","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ziraddingulumjanly%2Fnumeration-Dynamic-Programming-and-QP/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ziraddingulumjanly%2Fnumeration-Dynamic-Programming-and-QP/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ziraddingulumjanly%2Fnumeration-Dynamic-Programming-and-QP/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ziraddingulumjanly","download_url":"https://codeload.github.com/ziraddingulumjanly/numeration-Dynamic-Programming-and-QP/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ziraddingulumjanly%2Fnumeration-Dynamic-Programming-and-QP/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28829517,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-27T23:29:49.665Z","status":"ssl_error","status_checked_at":"2026-01-27T23:25:58.379Z","response_time":168,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2025-06-01T02:37:07.376Z","updated_at":"2026-01-28T00:37:18.871Z","avatar_url":"https://github.com/ziraddingulumjanly.png","language":null,"readme":"# Optimal Control Methods: Enumeration, Dynamic Programming, and QP\n\nThis repository contains descriptive solutions and implementations for optimal control problems using three approaches:\n- **Enumeration-Based Optimization**: Explores all possible control sequences from a discretized control grid to find the one that minimizes the cost function. Suitable for small problems but becomes computationally expensive as the grid size increases.\n\n- **Numerical Dynamic Programming**: Uses the principle of optimality and backward recursion over discretized state and control grids. Efficient for low-dimensional systems, but sensitive to grid resolution and interpolation strategy.\n\n- **Quadratic Programming (QP)**: Solves the discrete-time Linear Quadratic Regulator (LQR) problem exactly using matrix algebra. Fast and accurate for linear systems with quadratic cost, and naturally supports state and control constraints.\n\n![image](https://github.com/user-attachments/assets/adc5491e-d14b-4fa6-87d1-a1e43d6e4cd0)\n\n![image](https://github.com/user-attachments/assets/8f6ed83d-2c4a-4a0b-a9ee-356814a9c473)\n\nThe methods are applied to linear systems with quadratic cost, highlighting trade-offs in accuracy, efficiency, and constraint handling.\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fziraddingulumjanly%2Fnumeration-dynamic-programming-and-qp","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fziraddingulumjanly%2Fnumeration-dynamic-programming-and-qp","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fziraddingulumjanly%2Fnumeration-dynamic-programming-and-qp/lists"}