Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Step-up transformer tap changer support: linear search control logic #893

Merged
Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
28 commits
Select commit Hold shift + click to select a range
7ce5269
added control logic for linear search
Jerry-Jinfeng-Guo Feb 12, 2025
ddd8438
added updated binary control logic
Jerry-Jinfeng-Guo Feb 12, 2025
5e466b1
[skip ci]
Jerry-Jinfeng-Guo Feb 12, 2025
327ca17
[skip ci]
Jerry-Jinfeng-Guo Feb 12, 2025
5c856b5
Merge branch 'feature/tap-changer-unit-test-for-new-control-logic' in…
Jerry-Jinfeng-Guo Feb 12, 2025
47f3525
Merge branch 'feature/tap-changer-control-logic-linear-search' into f…
Jerry-Jinfeng-Guo Feb 12, 2025
2b8110a
Merge branch 'feature/tap-changer-unit-test-for-new-control-logic' in…
Jerry-Jinfeng-Guo Feb 12, 2025
32d62ae
Merge branch 'feature/tap-changer-control-logic-linear-search' into f…
Jerry-Jinfeng-Guo Feb 12, 2025
17bc26d
Merge branch 'feature/tap-changer-unit-test-for-new-control-logic' in…
Jerry-Jinfeng-Guo Feb 12, 2025
d312f0a
Merge branch 'feature/tap-changer-control-logic-linear-search' into f…
Jerry-Jinfeng-Guo Feb 12, 2025
7095594
Merge branch 'feature/tap-changer-unit-test-for-new-control-logic' in…
Jerry-Jinfeng-Guo Feb 12, 2025
6cff993
Merge branch 'feature/tap-changer-control-logic-linear-search' into f…
Jerry-Jinfeng-Guo Feb 12, 2025
1cd2a1c
[skip ci]
Jerry-Jinfeng-Guo Feb 12, 2025
40b44e5
[skip ci]
Jerry-Jinfeng-Guo Feb 12, 2025
201596c
Merge branch 'feature/tap-changer-unit-test-for-new-control-logic' in…
Jerry-Jinfeng-Guo Feb 13, 2025
0091d6d
Merge branch 'feature/tap-changer-control-logic-linear-search' into f…
Jerry-Jinfeng-Guo Feb 13, 2025
1b5d166
[skip ci]
Jerry-Jinfeng-Guo Feb 13, 2025
98d8562
Merge branch 'feature/tap-changer-unit-test-for-new-control-logic' in…
Jerry-Jinfeng-Guo Feb 13, 2025
9302c24
Merge branch 'feature/tap-changer-control-logic-linear-search' into f…
Jerry-Jinfeng-Guo Feb 13, 2025
70a481e
Merge branch 'feature/tap-changer-unit-test-for-new-control-logic' in…
Jerry-Jinfeng-Guo Feb 13, 2025
625a249
Merge branch 'feature/tap-changer-control-logic-linear-search' into f…
Jerry-Jinfeng-Guo Feb 13, 2025
35d0f63
ready for review
Jerry-Jinfeng-Guo Feb 13, 2025
5d6fe36
[skip ci] ready for review
Jerry-Jinfeng-Guo Feb 13, 2025
8ead84e
Merge branch 'feature/tap-changer-control-logic-linear-search' of htt…
Jerry-Jinfeng-Guo Feb 13, 2025
eef3127
[skip ci] ready for review
Jerry-Jinfeng-Guo Feb 13, 2025
19b5514
apply review suggestions
Jerry-Jinfeng-Guo Feb 21, 2025
73d7979
linux build
Jerry-Jinfeng-Guo Feb 21, 2025
97a1b94
Merge pull request #894 from PowerGridModel/feature/tap-changer-contr…
Jerry-Jinfeng-Guo Feb 21, 2025
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Original file line number Diff line number Diff line change
Expand Up @@ -396,11 +396,19 @@ constexpr IntS one_step_tap_down(transformer_c auto const& transformer) {
return tap_min < tap_max ? tap_pos - IntS{1} : tap_pos + IntS{1};
}
// higher voltage at control side => lower voltage at tap side => lower tap pos
constexpr IntS one_step_control_voltage_up(transformer_c auto const& transformer) {
constexpr IntS one_step_control_voltage_up(transformer_c auto const& transformer, bool control_at_tap_side) {
if (control_at_tap_side) {
// control side is tap side, voltage up requires tap up
return one_step_tap_up(transformer);
}
return one_step_tap_down(transformer);
}
// lower voltage at control side => higher voltage at tap side => higher tap pos
constexpr IntS one_step_control_voltage_down(transformer_c auto const& transformer) {
constexpr IntS one_step_control_voltage_down(transformer_c auto const& transformer, bool control_at_tap_side) {
if (control_at_tap_side) {
// control side is tap side, voltage down requires tap down
return one_step_tap_down(transformer);
}
return one_step_tap_up(transformer);
}

Expand All @@ -426,6 +434,9 @@ template <transformer_c... TransformerTypes> class TransformerWrapper {
IntS tap_max() const {
return apply([](auto const& t) { return t.tap_max(); });
}
IntS tap_side() const {
return std::visit([](auto const& t) -> IntS { return static_cast<IntS>(t.get().tap_side()); }, transformer_);
}
int64_t tap_range() const {
return apply([](auto const& t) {
return std::abs(static_cast<int64_t>(t.tap_max()) - static_cast<int64_t>(t.tap_min()));
Expand All @@ -447,6 +458,10 @@ template <transformer_c... TransformerTypes> class TransformerWrapper {
template <transformer_c... TransformerTypes> struct TapRegulatorRef {
std::reference_wrapper<const TransformerTapRegulator> regulator;
TransformerWrapper<TransformerTypes...> transformer;

bool control_at_tap_side() const {
return static_cast<IntS>(regulator.get().control_side()) == transformer.tap_side();
}
};

template <typename State>
Expand Down Expand Up @@ -675,7 +690,9 @@ class TapPositionOptimizerImpl<std::tuple<TransformerTypes...>, StateCalculator,
class BinarySearch {
public:
BinarySearch() = default;
BinarySearch(IntS tap_pos, IntS tap_min, IntS tap_max) { reset(tap_pos, tap_min, tap_max); }
BinarySearch(IntS tap_pos, IntS tap_min, IntS tap_max, bool control_at_tap_side) {
reset(tap_pos, tap_min, tap_max, control_at_tap_side);
}

constexpr IntS get_current_tap() const { return current_; }
constexpr bool get_last_down() const { return last_down_; }
Expand All @@ -694,7 +711,8 @@ class TapPositionOptimizerImpl<std::tuple<TransformerTypes...>, StateCalculator,
// - tap_max > tap_min && strategy_max == true
// - tap_max < tap_min && strategy_max == false
// Upper bound should be updated to the current tap position if the rest is the case.
if (tap_reverse_ == strategy_max) {
bool const invert_strategy = control_at_tap_side_ ? !strategy_max : strategy_max;
if (tap_reverse_ == invert_strategy) {
lower_bound_ = current_;
last_down_ = false;
} else {
Expand All @@ -704,7 +722,7 @@ class TapPositionOptimizerImpl<std::tuple<TransformerTypes...>, StateCalculator,
}

void propose_new_pos(bool strategy_max, bool above_range) {
bool const is_down = above_range == tap_reverse_;
bool const is_down = (above_range == tap_reverse_) != control_at_tap_side_;
if (last_check_) {
current_ = is_down ? lower_bound_ : upper_bound_;
inevitable_run_ = true;
Expand All @@ -718,7 +736,7 @@ class TapPositionOptimizerImpl<std::tuple<TransformerTypes...>, StateCalculator,
// __prefer_higher__ indicates a preference towards higher voltage
// that is a result of both the strategy as well as whether the current
// transformer has a reversed tap_max and tap_min
bool const prefer_higher = strategy_max != tap_reverse_;
bool const prefer_higher = (strategy_max != tap_reverse_) ^ control_at_tap_side_;
auto const tap_pos = search(prefer_higher);
auto const tap_diff = tap_pos - get_current_tap();
if (tap_diff == 0) {
Expand All @@ -739,14 +757,15 @@ class TapPositionOptimizerImpl<std::tuple<TransformerTypes...>, StateCalculator,
}

private:
void reset(IntS tap_pos, IntS tap_min, IntS tap_max) {
void reset(IntS tap_pos, IntS tap_min, IntS tap_max, bool control_at_tap_side) {
last_down_ = false;
last_check_ = false;
current_ = tap_pos;
inevitable_run_ = false;
lower_bound_ = std::min(tap_min, tap_max);
upper_bound_ = std::max(tap_min, tap_max);
tap_reverse_ = tap_max < tap_min;
control_at_tap_side_ = control_at_tap_side;
}

void adjust(bool strategy_max = true) {
Expand All @@ -762,25 +781,27 @@ class TapPositionOptimizerImpl<std::tuple<TransformerTypes...>, StateCalculator,
}
}

IntS search(bool prefer_higher = true) const {
// This logic is used to determin which of the middle points could be of interest
IntS search(bool prefer_higher_) const {
// This logic is used to determine which of the middle points could be of interest
// given strategy used in optimization:
// Since in BinarySearch we insist on absolute upper and lower bounds, we only need to
// find the corresponding mid point. std::midpoint returns always the lower mid point
// if the range is of even length. This is why we need to adjust bounds accordingly.
// Not because upper bound and lower bound might be reversed, which is not possible.
bool const prefer_higher = control_at_tap_side_ != prefer_higher_;
auto const primary_bound = prefer_higher ? upper_bound_ : lower_bound_;
auto const secondary_bound = prefer_higher ? lower_bound_ : upper_bound_;
return std::midpoint(primary_bound, secondary_bound);
}

IntS lower_bound_{}; // tap position lower bound
IntS upper_bound_{}; // tap position upper bound
IntS current_{0}; // current tap position
bool last_down_{false}; // last direction
bool last_check_{false}; // last run checked
bool tap_reverse_{false}; // tap range normal or reversed
bool inevitable_run_{false}; // inevitable run
IntS lower_bound_{}; // tap position lower bound
IntS upper_bound_{}; // tap position upper bound
IntS current_{0}; // current tap position
bool last_down_{false}; // last direction
bool last_check_{false}; // last run checked
bool tap_reverse_{false}; // tap range normal or reversed
bool inevitable_run_{false}; // inevitable run
bool control_at_tap_side_{false}; // regulator control side is at tap side
};
std::vector<std::vector<BinarySearch>> binary_search_;
struct BinarySearchOptions {
Expand Down Expand Up @@ -881,7 +902,7 @@ class TapPositionOptimizerImpl<std::tuple<TransformerTypes...>, StateCalculator,
std::vector<BinarySearch> binary_search_group(same_rank_regulators.size());
std::ranges::transform(same_rank_regulators, binary_search_group.begin(), [](auto const& regulator) {
return BinarySearch{regulator.transformer.tap_pos(), regulator.transformer.tap_min(),
regulator.transformer.tap_max()};
regulator.transformer.tap_max(), regulator.control_at_tap_side()};
});
binary_search_.push_back(std::move(binary_search_group));
}
Expand Down Expand Up @@ -1014,13 +1035,15 @@ class TapPositionOptimizerImpl<std::tuple<TransformerTypes...>, StateCalculator,

auto [node_state, param] = compute_node_state_and_param<TransformerType>(regulator, state, solver_output);

bool control_at_tap_side = regulator.control_at_tap_side();

auto const cmp = node_state <=> param;
auto new_tap_pos = [&transformer, &cmp] {
auto new_tap_pos = [&transformer, &cmp, &control_at_tap_side] {
if (cmp > 0) { // NOLINT(modernize-use-nullptr)
return one_step_control_voltage_down(transformer);
return one_step_control_voltage_down(transformer, control_at_tap_side);
}
if (cmp < 0) { // NOLINT(modernize-use-nullptr)
return one_step_control_voltage_up(transformer);
return one_step_control_voltage_up(transformer, control_at_tap_side);
}
return transformer.tap_pos();
}();
Expand Down Expand Up @@ -1119,11 +1142,19 @@ class TapPositionOptimizerImpl<std::tuple<TransformerTypes...>, StateCalculator,
auto pilot_run(std::vector<std::vector<RegulatedTransformer>> const& regulator_order) {
using namespace std::string_literals;

constexpr auto max_voltage_pos = [](transformer_c auto const& transformer) -> IntS {
constexpr auto max_voltage_pos = [](transformer_c auto const& transformer, bool control_at_tap_side) -> IntS {
if (control_at_tap_side) {
// min voltage at control side => max voltage at tap side => max tap pos
return transformer.tap_max();
}
// max voltage at control side => min voltage at tap side => min tap pos
return transformer.tap_min();
};
constexpr auto min_voltage_pos = [](transformer_c auto const& transformer) -> IntS {
constexpr auto min_voltage_pos = [](transformer_c auto const& transformer, bool control_at_tap_side) -> IntS {
if (control_at_tap_side) {
// max voltage at control side => min voltage at tap side => min tap pos
return transformer.tap_min();
}
// min voltage at control side => max voltage at tap side => max tap pos
return transformer.tap_max();
};
Expand Down Expand Up @@ -1154,11 +1185,11 @@ class TapPositionOptimizerImpl<std::tuple<TransformerTypes...>, StateCalculator,
void exploit_neighborhood(std::vector<std::vector<RegulatedTransformer>> const& regulator_order) {
using namespace std::string_literals;

constexpr auto one_step_up = [](transformer_c auto const& transformer) -> IntS {
return one_step_control_voltage_up(transformer);
constexpr auto increment_voltage = [](transformer_c auto const& transformer, bool control_at_tap_side) -> IntS {
return one_step_control_voltage_up(transformer, control_at_tap_side);
};
constexpr auto one_step_down = [](transformer_c auto const& transformer) -> IntS {
return one_step_control_voltage_down(transformer);
constexpr auto decrement_voltage = [](transformer_c auto const& transformer, bool control_at_tap_side) -> IntS {
return one_step_control_voltage_down(transformer, control_at_tap_side);
};

switch (strategy_) {
Expand All @@ -1169,12 +1200,12 @@ class TapPositionOptimizerImpl<std::tuple<TransformerTypes...>, StateCalculator,
case OptimizerStrategy::global_maximum:
[[fallthrough]];
case OptimizerStrategy::local_maximum:
regulate_transformers(one_step_up, regulator_order);
regulate_transformers(increment_voltage, regulator_order);
break;
case OptimizerStrategy::global_minimum:
[[fallthrough]];
case OptimizerStrategy::local_minimum:
regulate_transformers(one_step_down, regulator_order);
regulate_transformers(decrement_voltage, regulator_order);
break;
default:
throw MissingCaseForEnumError{"TapPositionOptimizer::exploit_neighborhood"s, strategy_};
Expand All @@ -1189,21 +1220,23 @@ class TapPositionOptimizerImpl<std::tuple<TransformerTypes...>, StateCalculator,
}

template <typename Func>
requires((std::invocable<Func, TransformerTypes const&> &&
std::same_as<std::invoke_result_t<Func, TransformerTypes const&>, IntS>) &&
requires((std::invocable<Func, TransformerTypes const&, bool> &&
std::same_as<std::invoke_result_t<Func, TransformerTypes const&, bool>, IntS>) &&
...)
auto regulate_transformers(Func to_new_tap_pos,
std::vector<std::vector<RegulatedTransformer>> const& regulator_order) const {
UpdateBuffer update_data;

auto const get_update = [to_new_tap_pos_func = std::move(to_new_tap_pos),
&update_data](transformer_c auto const& transformer) {
add_tap_pos_update(to_new_tap_pos_func(transformer), transformer, update_data);
&update_data](transformer_c auto const& transformer, bool control_at_tap_side) {
add_tap_pos_update(to_new_tap_pos_func(transformer, control_at_tap_side), transformer, update_data);
};

for (auto const& sub_order : regulator_order) {
for (auto const& regulator : sub_order) {
regulator.transformer.apply(get_update);
bool const control_at_tap_side = regulator.control_at_tap_side();
regulator.transformer.apply(
[&](auto const& transformer) { get_update(transformer, control_at_tap_side); });
}
}

Expand Down
24 changes: 12 additions & 12 deletions tests/cpp_unit_tests/test_tap_position_optimizer.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -632,15 +632,15 @@ auto check_exact(IntS tap_pos) -> TapPositionCheckFunc {
CHECK(value == tap_pos);
};
};
auto check_compensated_exact(IntS tap_pos, IntS tap_pos_comp) -> TapPositionCheckFunc {
return [tap_pos, tap_pos_comp](IntS value, OptimizerStrategy /*strategy*/, bool control_at_tap_side) {
if (control_at_tap_side) {
CHECK(value == tap_pos_comp);
} else {
CHECK(value == tap_pos);
}
};
};
// auto check_compensated_exact(IntS tap_pos, IntS tap_pos_comp) -> TapPositionCheckFunc {
// return [tap_pos, tap_pos_comp](IntS value, OptimizerStrategy /*strategy*/, bool control_at_tap_side) {
// if (control_at_tap_side) {
// CHECK(value == tap_pos_comp);
// } else {
// CHECK(value == tap_pos);
// }
// };
// };
auto check_exact_per_strategy(IntS tap_pos_any, IntS tap_range_min, IntS tap_range_max) -> TapPositionCheckFunc {
return
[tap_pos_any, tap_range_min, tap_range_max](IntS value, OptimizerStrategy strategy, bool control_at_tap_side) {
Expand Down Expand Up @@ -996,7 +996,7 @@ TEST_CASE("Test Tap position optimizer") {

SUBCASE("voltage band") {
state_b.rank = 0;
state_b.u_pu = [&state_b, &regulator_b](ControlSide side) {
state_b.u_pu = [&state_b, &regulator_b](ControlSide /*side*/) {
if (state_b.tap_side == regulator_b.control_side()) {
return static_cast<DoubleComplex>(
test::normalized_lerp(state_b.tap_pos, state_b.tap_min, state_b.tap_max));
Expand All @@ -1015,7 +1015,7 @@ TEST_CASE("Test Tap position optimizer") {

SUBCASE("line drop compensation") {
state_b.rank = 0;
state_b.u_pu = [&state_b, &regulator_b](ControlSide side) {
state_b.u_pu = [&state_b, &regulator_b](ControlSide /*side*/) {
if (state_b.tap_side == regulator_b.control_side()) {
return static_cast<DoubleComplex>(
test::normalized_lerp(state_b.tap_pos, state_b.tap_min, state_b.tap_max));
Expand Down Expand Up @@ -1219,7 +1219,7 @@ TEST_CASE("Test Tap position optimizer") {

SUBCASE("Check throw as MaxIterationReached") { // This only applies to non-binary search
state_b.rank = 0;
state_b.u_pu = [&state_b, &regulator_b](ControlSide side) {
state_b.u_pu = [&state_b, &regulator_b](ControlSide /*side*/) {
if (state_b.tap_side == regulator_b.control_side()) {
return static_cast<DoubleComplex>(
test::normalized_lerp(state_b.tap_pos, state_b.tap_min, state_b.tap_max));
Expand Down
Loading