Power System Topological Observability Using a Direct Graph-Theoretic Approach

1982 ◽  
Vol PER-2 (3) ◽  
pp. 23-23 ◽  
Author(s):  
V. H. Quintana ◽  
A. Simoes-Costa ◽  
A. Mandel
Keyword(s):  
Power System ◽  
Theoretic Approach ◽  
Direct Graph ◽  
Graph Theoretic ◽  
Graph Theoretic Approach

scholarly journals Quantifying geospatial interdependencies of ICT and power system based on open data

2021 ◽  
Vol 4 (S3) ◽  
Author(s):  
Anna Volkova ◽  
Jonas Terzer ◽  
Hermann de Meer
Keyword(s):  
Power System ◽  
System Architecture ◽  
Open Data ◽  
Data Models ◽  
Theoretic Approach ◽  
Graph Theoretic ◽  
Graph Theoretic Approach ◽  
Wide Range ◽  
Ict System ◽  
System Data

AbstractIn order to evaluate the effectiveness of innovative services and technologies spanning over the ICT-enabled power system, realistic models are required. Although nowadays there is a wide range of power system data models, these models do not include a lifelike representation of the ICT system architecture and do not consider the level of interconnectedness of the two systems. In this paper, we propose a methodology for quantification of the geospatial relations between ICT and power system based on openly available data. We describe a graph-theoretic approach, formulate a problem of assessing geospatial relations and discuss the methods required to process publicly available data, retrieve scenarios for different regions and quantify the level of interdependence between ICT and power system.

Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model

1997 ◽  
Vol 07 (06) ◽  
pp. 581-598 ◽  
Author(s):  
D. T. Lee ◽  
C. D Yang ◽  
C. K. Wong
Keyword(s):  
Shortest Path ◽  
Problem Instance ◽  
Theoretic Approach ◽  
Layer Model ◽  
Direct Graph ◽  
Graph Theoretic ◽  
Graph Theoretic Approach ◽  
Transformation Algorithm ◽  
Two Layer Model ◽  
Almost All

Finding the best rectilinear path with respect to the bends and teh lengths of paths connecting two given points in the presence of rectilinear obstacles in a two-layer model is studied in this paper. In this model, rectilinear obstacles on each layer are specified separately, and the orientation of routing in each layer is fixed. An algorithm is presented to transform any problem instance in the two-layer model to one in a one-layer model, so that almost all algorithms for finding rectilinear paths among obstacles in the plane can be applied. The transformation algorithm runs in O(e log e) time where e is the number of edges on obstacles lying on both layers. A direct graph-theoretic approach to finding a shortest path in the two-layer model, which is easier to implement is also presented. The algorithm runs in O(e log 2 e) time.

Sign in / Sign up

Export Citation Format

Share Document