{"id":16446464,"url":"https://github.com/fbukevin/sdp","last_synced_at":"2026-06-12T12:31:45.905Z","repository":{"id":185184840,"uuid":"78417490","full_name":"fbukevin/SDP","owner":"fbukevin","description":"Stochastic dynamic programming","archived":false,"fork":false,"pushed_at":"2017-01-13T14:08:35.000Z","size":11865,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"gh-pages","last_synced_at":"2025-02-26T10:16:42.472Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"https://wiheartio.github.io/SDP/","language":"JavaScript","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/fbukevin.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}},"created_at":"2017-01-09T10:13:32.000Z","updated_at":"2023-06-13T13:52:55.000Z","dependencies_parsed_at":"2023-08-01T02:00:34.520Z","dependency_job_id":null,"html_url":"https://github.com/fbukevin/SDP","commit_stats":null,"previous_names":["fbukevin/sdp"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/fbukevin/SDP","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/fbukevin%2FSDP","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/fbukevin%2FSDP/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/fbukevin%2FSDP/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/fbukevin%2FSDP/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/fbukevin","download_url":"https://codeload.github.com/fbukevin/SDP/tar.gz/refs/heads/gh-pages","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/fbukevin%2FSDP/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34245217,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-12T02:00:06.859Z","response_time":109,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":"2024-10-11T09:47:41.527Z","updated_at":"2026-06-12T12:31:45.887Z","avatar_url":"https://github.com/fbukevin.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Energy Flow Optimization \n\nThis project applies stochastic dynamic programming to simulate energy flow optimization for wind farm. The algorithms is based on day ahead wind commitment scenario, which aims to maximize profit of the energy storage system in specified days, 24 hours.\n\nWe refer to paper `Approximate Dynamic Programming for Storage Problems`(2011) published by Lauren A. Hannah and David B. Dunson in Duke University(USA).\n\n# Author\n\n* Wayne Hung (juh296@psu.edu)\n* Veck Hsiao (fbukevin@gmail.com)\n\n# Develop Note\n* JavaScript Visualization Library:\n\t* 3D 是用這個：http://almende.github.io/chap-links-library/js/graph3d/doc/\u003cbr\u003e\n\t(應該是改 http://javascript-surface-plot.googlecode.com/…/googleVizAp…)\u003cbr\u003e\n\t(tooltip: http://almende.github.io/chap-links-library/js/graph3d/doc/…)\n\t* 2D 是用這個：http://www.flotcharts.org/f…/examples/interacting/index.html\n\n* graph3d 的 basic 中 data: `data.addRow([x, y, value]);`，可以對應到 zt 和 xti 的 [day, hr, value]\n\n* sum()\n\t```\n\tvector = [[1, 2], [3, 4]]\n\twayne 說 sum(vector, 1) 是 jStat(vector).sum() == [4, 6]\n\tsum(vector, 2) 應等於 [3, 7]，但 jStat 沒有這個實作\n\t```\n\t\n* code optimization\n\t1. rev, fu, fd 的 N, t 直接用 global?\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffbukevin%2Fsdp","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ffbukevin%2Fsdp","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffbukevin%2Fsdp/lists"}