{"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/using-solar-and-load-predictions-in-battery","title":"Using solar and load predictions in battery scheduling at the residential level","arxiv_id":"1810.11178","date":"2018-10-26","proceeding":null,"authors":["Richard Bean","Hina Khan"],"abstract":"Smart solar inverters can be used to store, monitor and manage a home's solar\nenergy. We describe a smart solar inverter system with battery which can either\noperate in an automatic mode or receive commands over a network to charge and\ndischarge at a given rate. In order to make battery storage financially viable\nand advantageous to the consumers, effective battery scheduling algorithms can\nbe employed. Particularly, when time-of-use tariffs are in effect in the region\nof the inverter, it is possible in some cases to schedule the battery to save\nmoney for the individual customer, compared to the \"automatic\" mode. Hence,\nthis paper presents and evaluates the performance of a novel battery scheduling\nalgorithm for residential consumers of solar energy. The proposed battery\nscheduling algorithm optimizes the cost of electricity over next 24 hours for\nresidential consumers. The cost minimization is realized by controlling the\ncharging/discharging of battery storage system based on the predictions for\nload and solar power generation values. The scheduling problem is formulated as\na linear programming problem. We performed computer simulations over 83\ninverters using several months of hourly load and PV data. The simulation\nresults indicate that key factors affecting the viability of optimization are\nthe tariffs and the PV to Load ratio at each inverter. Depending on the tariff,\nsavings of between 1% and 10% can be expected over the automatic approach. The\nprediction approach used in this paper is also shown to out-perform basic\n\"persistence\" forecasting approaches. We have also examined the approaches for\nimproving the prediction accuracy and optimization effectiveness.","url_abs":"http://arxiv.org/abs/1810.11178v1","url_pdf":"http://arxiv.org/pdf/1810.11178v1.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":"using-solar-and-load-predictions-in-battery","repo_url":"https://github.com/RichardBean/IEEE-Predict-Optimize-Challenge","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"scheduling","task_name":"Scheduling"}],"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":"RichardBean/IEEE-Predict-Optimize-Challenge","kind":"listed","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":"3cec8ed4d8075bbbeb75d5b4a3d1ed0f49bf58ec687d2b68b2f583c81d592a0f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}