Power Network Visualization Triangulation Interpolation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing power transmission network supervision systems face delays in updating visualizations due to high computational loads from interpolating data across numerous locations, leading to non-real-time monitoring and potentially delayed responses to network disturbances.

Innovation Solution

The method involves dividing a geographical area into triangles, determining closest data locations, and interpolating data values using programmable graphics hardware to generate output data values, allowing for efficient and real-time visualization of network states.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If traditional interpolation methods are used to calculate data values for all data locations, then comprehensive network state coverage is achieved, but the computational load increases causing slow visualization updates

Engineering Contradiction:
Improvenetwork state coverageVSAvoidvisualization update time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent divides the geographical area into triangular elements with vertices at data locations. This segmentation allows the system to process only relevant local data for each triangle rather than performing global interpolation across all data locations, significantly reducing computational load while maintaining adequate visualization coverage.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent applies different processing approaches to different regions by using local triangulation and selecting only the N closest data locations for each triangle. This local quality approach ensures sufficient detail is maintained in each local area while avoiding the computational overhead of processing all data locations globally, thus achieving real-time update performance.

Inventive Principle:
Principle #3Local quality

2Measurement precision

If data values from all data locations are processed and interpolated, then accurate network state representation is achieved, but the system processor becomes overloaded

Engineering Contradiction:
Improvenetwork state accuracyVSAvoidprocessor load
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The patent extracts only the N closest data locations for each triangle from the complete set of all data locations. This extraction principle removes unnecessary computational complexity by processing only the most relevant local data points rather than all available data, reducing processor load while maintaining sufficient interpolation accuracy for visualization purposes.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent applies partial action by performing interpolation only for the N closest data locations within each triangle rather than all data locations. This partial processing approach provides sufficient accuracy for visualization needs without the excessive computational burden of complete global interpolation, enabling real-time performance.

Inventive Principle:
Principle #16Partial or excessive action

Data Source

PatentUS9336616B2Power transmission network state visualization
Publication Date: 2016.05.10 HITACHI ENERGY LTD
  • US9336616B2 patent drawing
  • US9336616B2 patent drawing

AI summary

A method and system are provided for visualizing and displaying a state of a power transmission network to an operator, for the supervision of the network. The method and system are provided for visualizing or contouring a power transmission network state by displaying to an operator output data values interpolated at output data locations from input data including geographically distributed input data sensor locations and corresponding dynamically updated input data values. The method includes dividing a geographical area of interest into triangles, wherein a triangle vertex is defined at each input data location within the area, determining, for each triangle, closest input data locations according to a closeness criteria, and interpolating by weighting or scaling at each output data location within a triangle the input data values of a number of closest input data locations to generate output data values corresponding to the output data locations.