Repository navigation
Expand file tree
/
Copy pathplan.py
More file actions
4157 lines (3805 loc) · 212 KB
/
Copy pathplan.py
File metadata and controls
4157 lines (3805 loc) · 212 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
# -----------------------------------------------------------------------------
# Predbat Home Battery System
# Copyright Trefor Southwell 2024 - All Rights Reserved
# This application maybe used for personal use only and not for commercial use
# -----------------------------------------------------------------------------
# fmt off
# pylint: disable=consider-using-f-string
# pylint: disable=line-too-long
# pylint: disable=attribute-defined-outside-init
import copy
import traceback
from datetime import datetime, timedelta
from multiprocessing import Pool, cpu_count
from config import PREDICT_STEP, TIME_FORMAT, MINUTE_WATT
from utils import calc_percent_limit, dp0, dp1, dp2, dp3, dp4, remove_intersecting_windows, calc_percent_limit, in_car_slot
from prediction import Prediction, wrapped_run_prediction_single, wrapped_run_prediction_charge, wrapped_run_prediction_charge_min_max, wrapped_run_prediction_export, wrapped_run_prediction_charge_min_max
"""
Used to mimic threads when they are disabled
"""
class DummyThread:
def __init__(self, result):
"""
Store the data into the class
"""
self.result = result
def get(self):
"""
Return the result
"""
return self.result
class Plan:
def dynamic_load(self):
# Last period load analysis
self.load_last_status = "baseline"
if self.load_last_period > self.battery_rate_max_discharge * MINUTE_WATT / 1000:
self.load_last_status = "high"
elif (self.load_last_period < self.battery_rate_max_discharge * 0.9 * MINUTE_WATT / 1000) and (self.load_last_period < self.car_charging_threshold * 0.9):
# Check if the load is less than car charging threshold
self.load_last_status = "low"
else:
self.load_last_status = "baseline"
self.dynamic_load_baseline = {}
if self.metric_dynamic_load_adjust:
minutes_now = self.minutes_now
minutes_end_slot = int((self.minutes_now + 30) / 30) * 30
# When dynamic load is enabled we try can do two things
# 1. Increase the load prediction in the current 30 minute period to match the actual load (if its low)
# 2. If its low and car charging is predicted then cancel off that car slot
if self.load_last_status == "low":
for car_n in range(0, self.num_cars):
for slot in self.car_charging_slots[car_n]:
if (slot["start"] < minutes_now) and (slot["start"] < minutes_end_slot) and (slot["end"] > minutes_now):
# If the slot is within the current 30 minute period
self.log("Dynamic load adjust is cancelling car {} slot {}-{} due to low load".format(car_n + 1, slot["start"], slot["end"]))
slot["kwh"] = 0
if self.load_last_status == "high":
have_printed = False
for minute_absolute in range(minutes_now, minutes_end_slot, PREDICT_STEP):
car_load = sum(in_car_slot(minute_absolute, self.num_cars, self.car_charging_slots))
load_last_period = self.load_last_period / 60 * PREDICT_STEP
load_last_period = max(load_last_period - car_load, 0)
if load_last_period > 0:
if not have_printed:
self.log("Dynamic load adjust is setting load minimum {:.2f}kW at {}".format(load_last_period, self.time_abs_str(minute_absolute)))
have_printed = True
self.dynamic_load_baseline[minute_absolute] = load_last_period
def find_price_levels(
self,
price_set,
price_links,
window_index,
charge_limit,
charge_window,
export_window,
export_limits,
):
"""
Find the highest and lowest price levels for charge and export windows
"""
highest_price_charge = None
lowest_price_export = None
highest_price_charge_level = None
lowest_price_export_level = None
for price in price_set:
links = price_links[price]
for key in links:
window_n = window_index[key]["id"]
typ = window_index[key]["type"]
if typ == "c":
if (highest_price_charge_level is None) or (price < highest_price_charge_level):
highest_price_charge_level = price
elif typ == "d":
if (lowest_price_export_level is None) or (price > lowest_price_export_level):
lowest_price_export_level = price
for price in price_set:
links = price_links[price]
for key in links:
window_n = window_index[key]["id"]
typ = window_index[key]["type"]
if typ == "c":
if charge_limit[window_n] > self.reserve:
if highest_price_charge is None:
highest_price_charge = charge_window[window_n]["average"]
else:
highest_price_charge = max(highest_price_charge, charge_window[window_n]["average"])
if highest_price_charge_level is None:
highest_price_charge_level = price
else:
highest_price_charge_level = max(highest_price_charge_level, price)
elif typ == "d":
if export_limits[window_n] < 99.0:
if lowest_price_export is None:
lowest_price_export = export_window[window_n]["average"]
else:
lowest_price_export = min(lowest_price_export, export_window[window_n]["average"])
if lowest_price_export_level is None:
lowest_price_export_level = price
else:
lowest_price_export_level = min(lowest_price_export_level, price)
if highest_price_charge is None:
highest_price_charge = self.rate_min
if lowest_price_export is None:
lowest_price_export = self.rate_export_max
if highest_price_charge_level is None:
highest_price_charge_level = self.rate_min
if lowest_price_export_level is None:
lowest_price_export_level = self.rate_export_max
return highest_price_charge, lowest_price_export, highest_price_charge_level, lowest_price_export_level
def optimise_charge_limit_price_threads(
self,
price_set,
price_links,
window_index,
record_charge_windows,
record_export_windows,
try_charge_limit,
charge_window,
export_window,
export_limits,
end_record=None,
region_start=None,
region_end=None,
fast=False,
quiet=False,
best_metric=9999999,
best_cost=0,
best_keep=0,
best_soc_min=None,
best_cycle=0,
best_carbon=0,
best_import=0,
best_battery_value=0,
tried_list=None,
test_mode=False,
levels_score=None,
):
"""
Pick an import price threshold which gives the best results
"""
loop_price = price_set[-1]
best_price = loop_price
try_export = export_limits.copy()
best_limits = try_charge_limit.copy()
best_export_limits = try_export.copy()
best_all_n = []
if best_soc_min is None:
best_soc_min = self.reserve
step = PREDICT_STEP
if fast:
step = 30
if tried_list is None:
tried_list = {}
best_level_score = None
worst_level_score = None
level_score_range = None
if levels_score is None:
levels_score = {}
else:
best_level_score = 9999999
worst_level_score = -9999999
# Work out the best levels score so far
for price in price_set:
best_level_score = min(best_level_score, levels_score[price])
worst_level_score = max(worst_level_score, levels_score[price])
level_score_range = abs(worst_level_score - best_level_score)
best_metric, best_battery_value, best_cost, best_keep, best_cycle, best_carbon, best_import, best_export = self.run_prediction_metric(best_limits, charge_window, export_window, export_limits, end_record=self.end_record)
if region_start:
region_txt = "Region {} - {}".format(self.time_abs_str(region_start), self.time_abs_str(region_end))
else:
region_txt = "All regions"
# Do we loop on export?
if self.calculate_best_export and self.calculate_export_first:
export_enable = True
else:
export_enable = False
# Most expensive first
all_prices = price_set[::] + [dp1(price_set[-1] - 1)]
if not quiet:
self.log("All prices {}".format(all_prices))
if region_start:
self.log("Region {} - {}".format(self.time_abs_str(region_start), self.time_abs_str(region_end)))
price_set_charge = []
valid_charge_windows = {}
best_limits_reset = best_limits.copy()
for price in price_set[::-1]:
links = price_links[price]
for key in links:
window_n = window_index[key]["id"]
typ = window_index[key]["type"]
if typ in ["c", "cf"]:
if region_start and (charge_window[window_n]["start"] >= region_end or charge_window[window_n]["end"] < region_start):
pass
elif charge_window[window_n]["start"] in self.manual_all_times:
pass
else:
price_set_charge.append([price, window_n, typ == "cf"])
valid_charge_windows[window_n] = True
best_limits_reset[window_n] = 0
price_set_export = []
valid_export_windows = {}
best_export_limits_reset = export_limits.copy()
if export_enable:
for price in price_set:
links = price_links[price]
# For prices above threshold try export
for key in links:
typ = window_index[key]["type"]
window_n = window_index[key]["id"]
if typ in ["d", "df"]:
if region_start and (export_window[window_n]["start"] >= region_end or export_window[window_n]["end"] < region_start):
pass
elif export_window[window_n]["start"] in self.manual_all_times:
pass
else:
price_set_export.append([price, window_n, typ == "df"])
valid_export_windows[window_n] = True
best_export_limits_reset[window_n] = 100.0
# Start loop of trials
for loop_price in all_prices:
if best_level_score is not None:
this_level_score = levels_score.get(loop_price, 9999999)
if abs(this_level_score - best_level_score) > (0.3 * level_score_range):
if self.debug_enable:
self.log("Skipping price {} as level score {} is not within 30% of best {}".format(loop_price, this_level_score, best_level_score))
continue
pred_table = []
charge_freeze_options = [True, False] if self.set_charge_freeze else [False]
export_freeze_options = [True, False] if self.set_export_freeze else [False]
min_freeze_percent = calc_percent_limit(self.best_soc_min, self.soc_max)
for max_charge_slots in [48, 32, 24, 16, 12, 8, 6, 4, 3, 2, 1]:
for max_export_slots in [48, 32, 24, 16, 12, 8, 6, 4, 3, 2, 1]:
for try_charge_freeze in charge_freeze_options:
for try_export_freeze in export_freeze_options:
all_n = []
all_d = []
count_c = 0
count_d = 0
try_charge_limit = best_limits_reset.copy()
try_export = best_export_limits_reset.copy()
for price, window_n, freeze in price_set_charge:
if loop_price >= price:
if freeze and not try_charge_freeze:
pass
elif count_c < max_charge_slots and (window_n not in all_n):
all_n.append(window_n)
try_charge_limit[window_n] = self.reserve if freeze else self.soc_max
count_c += 1
for price, window_n, freeze in price_set_export:
if loop_price < price:
# For prices above threshold try export
if freeze and not try_export_freeze:
pass
elif count_d < max_export_slots and (window_n not in all_d):
if not self.car_charging_from_battery and self.hit_car_window(export_window[window_n]["start"], export_window[window_n]["end"]):
pass
elif not self.iboost_on_export and self.iboost_enable and self.iboost_plan and (self.hit_charge_window(self.iboost_plan, export_window[window_n]["start"], export_window[window_n]["end"]) >= 0):
pass
else:
all_d.append(window_n)
try_export[window_n] = 99.0 if freeze else min_freeze_percent
count_d += 1
# Remove export hitting charge windows if this is disabled
if not self.calculate_export_oncharge:
for window_n in all_d[:]:
hit_charge = self.hit_charge_window(self.charge_window_best, export_window[window_n]["start"], export_window[window_n]["end"])
if hit_charge >= 0 and try_charge_limit[hit_charge] > 0.0:
try_export[window_n] = 100.0
all_d.remove(window_n)
# Skip this one as it's the same as selected already
try_hash = hash(tuple(try_charge_limit)) ^ hash(tuple(try_export))
if try_hash in tried_list:
try_value = tried_list[try_hash]
if try_value is not True:
if loop_price not in levels_score:
levels_score[loop_price] = 9999999
levels_score[loop_price] = min(levels_score[loop_price], tried_list[try_hash])
continue
tried_list[try_hash] = True
pred_item = {}
pred_item["handle"] = self.launch_run_prediction_single(try_charge_limit, charge_window, export_window, try_export, False, end_record=end_record, step=step)
pred_item["handle10"] = self.launch_run_prediction_single(try_charge_limit, charge_window, export_window, try_export, True, end_record=end_record, step=step)
pred_item["charge_limit"] = try_charge_limit
pred_item["export_limit"] = try_export
pred_item["loop_price"] = loop_price
pred_item["all_n"] = all_n.copy()
pred_item["try_hash"] = try_hash
pred_table.append(pred_item)
for pred in pred_table:
handle = pred["handle"]
handle10 = pred["handle10"]
try_charge_limit = pred["charge_limit"]
try_export = pred["export_limit"]
loop_price = pred["loop_price"]
all_n = pred["all_n"]
try_hash = pred["try_hash"]
cost, import_kwh_battery, import_kwh_house, export_kwh, soc_min, soc, soc_min_minute, battery_cycle, metric_keep, final_iboost, final_carbon_g = handle.get()
cost10, import_kwh_battery10, import_kwh_house10, export_kwh10, soc_min10, soc10, soc_min_minute10, battery_cycle10, metric_keep10, final_iboost10, final_carbon_g10 = handle10.get()
metric, battery_value = self.compute_metric(end_record, soc, soc10, cost, cost10, final_iboost, final_iboost10, battery_cycle, metric_keep, final_carbon_g, import_kwh_battery, import_kwh_house, export_kwh)
tried_list[try_hash] = metric
# Optimise
if self.debug_enable:
if export_enable:
self.log(
"Optimise all for buy/sell price band <= {} metric {} keep {} soc_min {} import {} export {} soc {} windows {} export on {}".format(
loop_price,
dp4(metric),
dp4(metric_keep),
dp4(soc_min),
dp4(import_kwh_battery + import_kwh_house),
dp4(export_kwh),
dp4(soc),
try_charge_limit,
try_export,
)
)
else:
self.log(
"Optimise all for buy/sell price band <= {} metric {} keep {} soc_min {} import {} export {} soc {} windows {} export off".format(
loop_price,
dp4(metric),
dp4(metric_keep),
dp4(soc_min),
dp4(import_kwh_battery + import_kwh_house),
dp4(export_kwh),
dp4(soc),
try_charge_limit,
)
)
if loop_price not in levels_score:
levels_score[loop_price] = 9999999
levels_score[loop_price] = min(levels_score[loop_price], metric)
# For the first pass just pick the most cost effective threshold, consider soc keep later
if metric < best_metric:
best_metric = metric
best_keep = metric_keep
best_price = loop_price
best_limits = try_charge_limit
best_export_limits = try_export
best_cycle = battery_cycle
best_carbon = final_carbon_g
best_soc_min = soc_min
best_cost = cost
best_import = import_kwh_battery + import_kwh_house
best_battery_value = battery_value
best_all_n = all_n.copy()
if self.debug_enable:
self.log(
"Optimise all charge {} price band {} total simulations {} at cost {} metric {} keep {} cycle {} carbon {} import {} cost {} battery_value {} soc_min {} limits {} export {}".format(
region_txt,
dp4(best_price),
len(tried_list),
dp4(best_cost),
dp4(best_metric),
dp4(best_keep),
dp4(best_cycle),
dp0(best_carbon),
dp2(best_import),
dp4(best_cost),
dp4(best_battery_value),
dp4(best_soc_min),
best_limits,
best_export,
)
)
# Perform charge limit levelling on best_all_n
if best_all_n:
best_all_n.sort()
metric, battery_value, cost, keep, cycle, carbon, import_this, export_this = self.run_prediction_metric(best_limits, charge_window, export_window, best_export_limits, end_record=self.end_record)
best_soc, best_metric, best_cost, soc_min, soc_min_minute, best_keep, best_cycle, best_carbon, best_import = self.optimise_charge_limit(
0, record_charge_windows, best_limits, charge_window, export_window, best_export_limits, all_n=best_all_n, end_record=end_record
)
if self.debug_enable:
self.log("Best all_n {} best_limits {} => {} metric {}".format(best_all_n, [best_limits[window_n] for window_n in best_all_n], best_soc, metric))
for window_n in best_all_n:
best_limits[window_n] = best_soc
try_charge_limit[window_n] = best_soc
metric, battery_value, cost, keep, cycle, carbon, import_this, export_this = self.run_prediction_metric(best_limits, charge_window, export_window, best_export_limits, end_record=self.end_record)
return (
best_limits,
best_export_limits,
best_metric,
best_cost,
best_keep,
best_soc_min,
best_cycle,
best_carbon,
best_import,
best_battery_value,
tried_list,
levels_score,
)
def launch_run_prediction_single(self, charge_limit, charge_window, export_window, export_limits, pv10, end_record, step=PREDICT_STEP):
"""
Launch a thread to run a prediction
"""
charge_limit = copy.deepcopy(charge_limit)
export_limits = copy.deepcopy(export_limits)
if self.pool and self.pool._state == "RUN":
han = self.pool.apply_async(wrapped_run_prediction_single, (charge_limit, charge_window, export_window, export_limits, pv10, end_record, step))
else:
han = DummyThread(self.prediction.thread_run_prediction_single(charge_limit, charge_window, export_window, export_limits, pv10, end_record, step))
return han
def launch_run_prediction_charge(self, loop_soc, window_n, charge_limit, charge_window, export_window, export_limits, pv10, all_n, end_record):
"""
Launch a thread to run a prediction
"""
if self.pool and self.pool._state == "RUN":
han = self.pool.apply_async(wrapped_run_prediction_charge, (loop_soc, window_n, charge_limit, charge_window, export_window, export_limits, pv10, all_n, end_record))
else:
han = DummyThread(self.prediction.thread_run_prediction_charge(loop_soc, window_n, charge_limit, charge_window, export_window, export_limits, pv10, all_n, end_record))
return han
def launch_run_prediction_charge_min_max(self, loop_soc, window_n, charge_limit, charge_window, export_window, export_limits, pv10, all_n, end_record):
"""
Launch a thread to run a prediction
"""
if self.pool and self.pool._state == "RUN":
han = self.pool.apply_async(wrapped_run_prediction_charge_min_max, (loop_soc, window_n, charge_limit, charge_window, export_window, export_limits, pv10, all_n, end_record))
else:
han = DummyThread(self.prediction.thread_run_prediction_charge_min_max(loop_soc, window_n, charge_limit, charge_window, export_window, export_limits, pv10, all_n, end_record))
return han
def launch_run_prediction_export(self, this_export_limit, start, window_n, try_charge_limit, charge_window, try_export_window, try_export, pv10, all_n, end_record):
"""
Launch a thread to run a prediction
"""
if self.pool and self.pool._state == "RUN":
han = self.pool.apply_async(
wrapped_run_prediction_export,
(this_export_limit, start, window_n, try_charge_limit, charge_window, try_export_window, try_export, pv10, all_n, end_record),
)
else:
han = DummyThread(self.prediction.thread_run_prediction_export(this_export_limit, start, window_n, try_charge_limit, charge_window, try_export_window, try_export, pv10, all_n, end_record))
return han
def scenario_summary_title(self, record_time):
txt = ""
minute_start = self.minutes_now - self.minutes_now % 30
for minute_absolute in range(minute_start, self.forecast_minutes + minute_start, 30):
this_minute_absolute = max(minute_absolute, self.minutes_now)
minute_timestamp = self.midnight_utc + timedelta(seconds=60 * this_minute_absolute)
dstamp = minute_timestamp.strftime(TIME_FORMAT)
stamp = minute_timestamp.strftime("%H:%M")
if txt:
txt += ", "
txt += "%8s" % str(stamp)
if record_time[dstamp] > 0:
break
return txt
def scenario_summary(self, record_time, datap):
txt = ""
minute_start = self.minutes_now - self.minutes_now % 30
for minute_absolute in range(minute_start, self.forecast_minutes + minute_start, 30):
this_minute_absolute = max(minute_absolute, self.minutes_now)
minute_timestamp = self.midnight_utc + timedelta(seconds=60 * this_minute_absolute)
stamp = minute_timestamp.strftime(TIME_FORMAT)
value = datap[stamp]
if not isinstance(value, str):
value = dp2(value)
if value > 10000:
value = dp0(value)
if txt:
txt += ", "
txt += "%8s" % str(value)
if record_time[stamp] > 0:
break
return txt
def scenario_summary_state(self, record_time):
txt = ""
minute_start = self.minutes_now - self.minutes_now % 30
for minute_absolute in range(minute_start, self.forecast_minutes + minute_start, 30):
minute_relative_start = max(minute_absolute - self.minutes_now, 0)
minute_relative_end = minute_relative_start + 30
this_minute_absolute = max(minute_absolute, self.minutes_now)
minute_timestamp = self.midnight_utc + timedelta(seconds=60 * this_minute_absolute)
stamp = minute_timestamp.strftime(TIME_FORMAT)
value = ""
charge_window_n = -1
for try_minute in range(this_minute_absolute, minute_absolute + 30, 5):
charge_window_n = self.in_charge_window(self.charge_window_best, try_minute)
if charge_window_n >= 0 and self.charge_limit_best[charge_window_n] == 0:
charge_window_n = -1
if charge_window_n >= 0:
break
export_window_n = -1
for try_minute in range(this_minute_absolute, minute_absolute + 30, 5):
export_window_n = self.in_charge_window(self.export_window_best, try_minute)
if export_window_n >= 0 and self.export_limits_best[export_window_n] == 100.0:
export_window_n = -1
if export_window_n >= 0:
break
soc_percent = calc_percent_limit(self.predict_soc_best.get(minute_relative_start, 0.0), self.soc_max)
soc_percent_end = calc_percent_limit(self.predict_soc_best.get(minute_relative_end, 0.0), self.soc_max)
soc_percent_max = max(soc_percent, soc_percent_end)
soc_percent_min = min(soc_percent, soc_percent_end)
if charge_window_n >= 0 and export_window_n >= 0:
value = "Chrg/Exp"
elif charge_window_n >= 0:
charge_target = self.charge_limit_best[charge_window_n]
if charge_target == self.reserve:
value = "FrzChrg"
else:
value = "Chrg"
elif export_window_n >= 0:
export_target = self.export_limits_best[export_window_n]
if export_target >= soc_percent_max:
if export_target == 99:
value = "FrzExp"
else:
value = "HldExp"
else:
value = "Exp"
if record_time[stamp] > 0:
break
if txt:
txt += ", "
txt += "%8s" % str(value)
return txt
def record_length(self, charge_window, charge_limit, best_price):
"""
Limit the forecast length to either the total forecast duration or the start of the last window that falls outside the forecast
"""
next_charge_start = self.forecast_minutes + self.minutes_now
if charge_window:
for window_n in range(len(charge_window)):
if charge_limit[window_n] > 0 and charge_window[window_n]["average"] <= best_price:
next_charge_start = charge_window[window_n]["start"]
if next_charge_start < self.minutes_now:
next_charge_start = charge_window[window_n]["end"]
break
end_record_min = self.minutes_now + self.forecast_plan_hours * 60
end_record = min(self.forecast_plan_hours * 60 + next_charge_start, self.forecast_minutes + self.minutes_now)
# Align to next window
max_windows = self.max_charge_windows(end_record, charge_window)
if len(charge_window) > max_windows:
end_record = min(end_record, charge_window[max_windows]["start"])
# If we are within this window then push to the end of it
if end_record < self.minutes_now:
end_record = min(charge_window[max_windows]["end"], self.forecast_minutes + self.minutes_now)
# avoid too short a plan, find the next charge window if its short
if end_record < end_record_min:
# If we are within this window then push to
max_windows += 1
if len(charge_window) > max_windows:
end_record = min(max(end_record, charge_window[max_windows]["start"]), self.forecast_minutes + self.minutes_now)
# Final check to avoid too short a plan
end_record = max(end_record, end_record_min)
self.log("Calculated end_record as {} based on best_price {} next_charge_start {} max_windows {}".format(self.time_abs_str(end_record), best_price, self.time_abs_str(next_charge_start), max_windows))
return end_record - self.minutes_now
def max_charge_windows(self, end_record_abs, charge_window):
"""
Work out how many charge windows the time period covers
"""
charge_windows = 0
window_n = 0
for window in charge_window:
if end_record_abs >= window["end"]:
charge_windows = window_n + 1
window_n += 1
return charge_windows
def hit_charge_window(self, charge_window, start, end):
"""
Determines if the given start and end time falls within any of the charge windows.
Parameters:
charge_window (list): A list of dictionaries representing charge windows, each containing "start" and "end" keys.
start (int): The start time of the interval to check.
end (int): The end time of the interval to check.
Returns:
int: The index of the charge window that the interval falls within, or -1 if it doesn't fall within any charge window.
"""
window_n = 0
for window in charge_window:
if end > window["start"] and start < window["end"]:
return window_n
window_n += 1
return -1
def run_prediction_metric(self, charge_limit_best, charge_window_best, export_window_best, export_limits_best, end_record=None, save=None):
"""
Run a single datapoint for PV and PV10 and return the metric
"""
if end_record is None:
end_record = self.forecast_minutes
(
cost10,
import_kwh_battery10,
import_kwh_house10,
export_kwh10,
soc_min10,
soc10,
soc_min_minute10,
battery_cycle10,
metric_keep10,
final_iboost10,
final_carbon_g10,
) = self.run_prediction(
charge_limit_best,
charge_window_best,
export_window_best,
export_limits_best,
True,
end_record=end_record,
)
# Run new plan
(
cost,
import_kwh_battery,
import_kwh_house,
export_kwh,
soc_min,
soc,
soc_min_minute,
battery_cycle,
metric_keep,
final_iboost,
final_carbon_g,
) = self.run_prediction(
charge_limit_best,
charge_window_best,
export_window_best,
export_limits_best,
False,
end_record=end_record,
save=save,
)
metric, battery_value = self.compute_metric(self.end_record, soc, soc10, cost, cost10, final_iboost, final_iboost10, battery_cycle, metric_keep, final_carbon_g, import_kwh_battery, import_kwh_house, export_kwh)
return metric, battery_value, cost, metric_keep, battery_cycle, final_carbon_g, import_kwh_battery + import_kwh_house, export_kwh
def in_charge_window(self, charge_window, minute_abs):
"""
Work out if this minute is within the a charge window
Parameters:
charge_window (list): A sorted list of dictionaries representing charge windows.
Each dictionary should have "start" and "end" keys
representing the start and end minutes of the window.
minute_abs (int): The absolute minute value to check.
Returns:
int: The index of the charge window if the minute is within a window,
otherwise -1.
"""
window_n = 0
for window in charge_window:
if minute_abs >= window["start"] and minute_abs < window["end"]:
return window_n
elif window["start"] > minute_abs:
# As windows are sorted, we can stop searching once we've passed the minute
break
window_n += 1
return -1
def calculate_plan(self, recompute=True, debug_mode=False, publish=True):
"""
Calculate the new plan (best)
sets:
self.charge_window_best
self.charge_limit_best
self.charge_limit_percent_best
self.export_window_best
self.export_limits_best
"""
# Re-compute plan due to time wrap
if self.plan_last_updated_minutes > self.minutes_now:
self.log("Force recompute due to start of day")
recompute = True
self.plan_valid = False
# Shift onto next charge window if required
while self.charge_window_best:
window = self.charge_window_best[0]
if window["end"] <= self.minutes_now:
del self.charge_window_best[0]
del self.charge_limit_best[0]
del self.charge_limit_percent_best[0]
self.log("Current charge window has expired, removing it")
else:
break
# Shift onto next export window if required
while self.export_window_best:
window = self.export_window_best[0]
if window["end"] <= self.minutes_now:
del self.export_window_best[0]
del self.export_limits_best[0]
self.log("Current export window has expired, removing it")
else:
break
# Recompute?
if recompute:
# Obtain previous plan data for comparison
if self.plan_valid:
charge_limit_best_prev = copy.deepcopy(self.charge_limit_best)
charge_window_best_prev = copy.deepcopy(self.charge_window_best)
export_window_best_prev = copy.deepcopy(self.export_window_best)
export_limits_best_prev = copy.deepcopy(self.export_limits_best)
self.log("Recompute is saving previous plan...")
else:
charge_limit_best_prev = None
charge_window_best_prev = None
export_window_best_prev = None
export_limits_best_prev = None
self.log("Recompute, previous plan is invalid...")
self.plan_valid = False # In case of crash, plan is now invalid
# Calculate best charge windows
if self.low_rates and self.calculate_best_charge and self.set_charge_window:
# If we are using calculated windows directly then save them
self.charge_window_best = copy.deepcopy(self.low_rates)
else:
# Default best charge window as this one
self.charge_window_best = copy.deepcopy(self.charge_window)
# Calculate best export windows
if self.calculate_best_export and self.set_export_window:
self.export_window_best = copy.deepcopy(self.high_export_rates)
else:
self.export_window_best = copy.deepcopy(self.export_window)
# Pre-fill best charge limit with the current charge limit
self.charge_limit_best = [self.current_charge_limit * self.soc_max / 100.0 for i in range(len(self.charge_window_best))]
self.charge_limit_percent_best = [self.current_charge_limit for i in range(len(self.charge_window_best))]
# Pre-fill best export enable with Off
self.export_limits_best = [100.0 for i in range(len(self.export_window_best))]
self.end_record = self.forecast_minutes
# Show best windows
self.log("Best charge window {}".format(self.window_as_text(self.charge_window_best, self.charge_limit_percent_best)))
self.log("Best export window {}".format(self.window_as_text(self.export_window_best, self.export_limits_best)))
# Created optimised step data
self.metric_cloud_coverage = self.get_cloud_factor(self.minutes_now, self.pv_forecast_minute, self.pv_forecast_minute10)
self.metric_load_divergence = self.get_load_divergence(self.minutes_now, self.load_minutes)
load_minutes_step = self.step_data_history(
self.load_minutes,
self.minutes_now,
forward=False,
scale_today=self.load_inday_adjustment,
scale_fixed=1.0,
type_load=True,
load_forecast=self.load_forecast,
load_scaling_dynamic=self.load_scaling_dynamic,
cloud_factor=self.metric_load_divergence,
load_adjust=self.manual_load_adjust,
load_baseline=self.dynamic_load_baseline,
)
load_minutes_step10 = self.step_data_history(
self.load_minutes,
self.minutes_now,
forward=False,
scale_today=self.load_inday_adjustment,
scale_fixed=self.load_scaling10,
type_load=True,
load_forecast=self.load_forecast,
load_scaling_dynamic=self.load_scaling_dynamic,
cloud_factor=min(self.metric_load_divergence + 0.5, 1.0) if self.metric_load_divergence else None,
load_adjust=self.manual_load_adjust,
load_baseline=self.dynamic_load_baseline,
)
pv_forecast_minute_step = self.step_data_history(self.pv_forecast_minute, self.minutes_now, forward=True, cloud_factor=self.metric_cloud_coverage)
pv_forecast_minute10_step = self.step_data_history(self.pv_forecast_minute10, self.minutes_now, forward=True, cloud_factor=min(self.metric_cloud_coverage + 0.2, 1.0) if self.metric_cloud_coverage else None, flip=True)
# Save step data for debug
self.load_minutes_step = load_minutes_step
self.load_minutes_step10 = load_minutes_step10
self.pv_forecast_minute_step = pv_forecast_minute_step
self.pv_forecast_minute10_step = pv_forecast_minute10_step
# Yesterday data
if recompute and self.calculate_savings and publish:
self.calculate_yesterday()
# Creation prediction object
self.prediction = Prediction(self, pv_forecast_minute_step, pv_forecast_minute10_step, load_minutes_step, load_minutes_step10)
# Create pool
if not self.pool:
threads = self.get_arg("threads", "auto")
if threads == "auto":
self.log("Creating pool of {} processes to match your CPU count".format(cpu_count()))
self.pool = Pool(processes=cpu_count())
elif threads:
self.log("Creating pool of {} processes as per apps.yaml".format(int(threads)))
self.pool = Pool(processes=int(threads))
else:
self.log("Not using threading as threads is set to 0 in apps.yaml")
# Simulate current settings to get initial data
metric, import_kwh_battery, import_kwh_house, export_kwh, soc_min, soc, soc_min_minute, battery_cycle, metric_keep, final_iboost, final_carbon_g = self.run_prediction(
self.charge_limit, self.charge_window, self.export_window, self.export_limits, False, end_record=self.end_record
)
# Try different battery SoC's to get the best result
if recompute:
self.rate_best_cost_threshold_charge = None
self.rate_best_cost_threshold_export = None
if self.calculate_best and recompute:
# Recomputing the plan
self.log_option_best()
# Full plan
self.optimise_all_windows(metric, metric_keep, debug_mode)
# Update target values, will be refined via clipping
self.update_target_values()
# Remove charge windows that overlap with export windows
self.charge_limit_best, self.charge_window_best = remove_intersecting_windows(self.charge_limit_best, self.charge_window_best, self.export_limits_best, self.export_window_best)
# Filter out any unused export windows
if self.calculate_best_export and self.export_window_best:
# Filter out the windows we disabled
self.export_limits_best, self.export_window_best = self.discard_unused_export_slots(self.export_limits_best, self.export_window_best)
# Clipping windows
if self.export_window_best:
# Re-run prediction to get data for clipping
(
best_metric,
import_kwh_battery,
import_kwh_house,
export_kwh,
soc_min,
soc,
soc_min_minute,
battery_cycle,
metric_keep,
final_iboost,
final_carbon_g,
) = self.run_prediction(
self.charge_limit_best,
self.charge_window_best,
self.export_window_best,
self.export_limits_best,
False,
end_record=self.end_record,
)
# Work out record windows
record_export_windows = max(self.max_charge_windows(self.end_record + self.minutes_now, self.export_window_best), 1)
# Export slot clipping
self.export_window_best, self.export_limits_best = self.clip_export_slots(self.minutes_now, self.predict_soc, self.export_window_best, self.export_limits_best, record_export_windows, PREDICT_STEP)
# Filter out the windows we disabled during clipping
self.export_limits_best, self.export_window_best = self.discard_unused_export_slots(self.export_limits_best, self.export_window_best)
self.log("Export windows filtered {}".format(self.window_as_text(self.export_window_best, self.export_limits_best)))
# Filter out any unused charge slots
if self.calculate_best_charge and self.charge_window_best:
# Re-run prediction to get data for clipping
(
best_metric,
import_kwh_battery,
import_kwh_house,
export_kwh,
soc_min,
soc,
soc_min_minute,
battery_cycle,
metric_keep,
final_iboost,
final_carbon_g,
) = self.run_prediction(
self.charge_limit_best,
self.charge_window_best,
self.export_window_best,
self.export_limits_best,
False,
end_record=self.end_record,
)
self.log("Raw charge windows {} reserve {}".format(self.window_as_text(self.charge_window_best, calc_percent_limit(self.charge_limit_best, self.soc_max)), self.reserve))
# Initial charge slot filter
if self.set_charge_window:
record_charge_windows = max(self.max_charge_windows(self.end_record + self.minutes_now, self.charge_window_best), 1)
self.charge_limit_best, self.charge_window_best = self.discard_unused_charge_slots(self.charge_limit_best, self.charge_window_best, self.reserve)
# Charge slot clipping
record_charge_windows = max(self.max_charge_windows(self.end_record + self.minutes_now, self.charge_window_best), 1)
self.log("Unclipped charge windows {} reserve {}".format(self.window_as_text(self.charge_window_best, calc_percent_limit(self.charge_limit_best, self.soc_max)), self.reserve))
self.charge_window_best, self.charge_limit_best = self.clip_charge_slots(self.minutes_now, self.predict_soc, self.charge_window_best, self.charge_limit_best, record_charge_windows, PREDICT_STEP)
if self.set_charge_window:
# Filter out the windows we disabled during clipping
self.log("Unfiltered charge windows {} reserve {}".format(self.window_as_text(self.charge_window_best, calc_percent_limit(self.charge_limit_best, self.soc_max)), self.reserve))
self.charge_limit_best, self.charge_window_best = self.discard_unused_charge_slots(self.charge_limit_best, self.charge_window_best, self.reserve)
self.charge_limit_percent_best = calc_percent_limit(self.charge_limit_best, self.soc_max)
self.log("Filtered charge windows {} reserve {}".format(self.window_as_text(self.charge_window_best, calc_percent_limit(self.charge_limit_best, self.soc_max)), self.reserve))
else:
self.charge_limit_percent_best = calc_percent_limit(self.charge_limit_best, self.soc_max)
self.log("Unfiltered charge windows {} reserve {}".format(self.window_as_text(self.charge_window_best, calc_percent_limit(self.charge_limit_best, self.soc_max)), self.reserve))
# Plan comparison
if charge_window_best_prev is not None and not debug_mode:
metric, battery_value, cost, metric_keep, battery_cycle, final_carbon_g, import_kwh, export_kwh = self.run_prediction_metric(
self.charge_limit_best, self.charge_window_best, self.export_window_best, self.export_limits_best, end_record=self.end_record
)
metric_prev, battery_value_prev, cost_prev, metric_keep_prev, battery_cycle_prev, final_carbon_g_prev, import_kwh_prev, export_kwh_prev = self.run_prediction_metric(
charge_limit_best_prev, charge_window_best_prev, export_window_best_prev, export_limits_best_prev, end_record=self.end_record
)
self.log("Previous plan best metric is {} (cost {}) and new plan best metric is {} (cost {})".format(dp2(metric_prev), dp2(cost_prev), dp2(metric), dp2(cost)))
if (metric_prev - metric) < self.metric_min_improvement_plan:
self.log("New plan metric is not significantly better (metric_min_improvement_plan {}) than previous plan, using previous plan".format(self.metric_min_improvement_plan))
self.charge_window_best = copy.deepcopy(charge_window_best_prev)
self.charge_limit_best = copy.deepcopy(charge_limit_best_prev)
self.export_window_best = copy.deepcopy(export_window_best_prev)
self.export_limits_best = copy.deepcopy(export_limits_best_prev)
else:
self.log("New plan metric is significantly better from previous plan, using new plan")
# Plan is now valid