Results 41 to 50 of about 130,220 (362)
IET Smart Grid, 2023 The widespread distribution of overhead transmission lines increases the vulnerability of power grids to failures. Thus, power lines need to be timely inspected, especially before or during emergency‐related situations to ensure stable operation of the ...
Rachad Atat +3 more
doaj +1 more source
Vertex Intersection Graphs of Paths on a Grid
Journal of Graph Algorithms and Applications, 2012 Summary: We investigate the class of vertex intersection graphs of paths on a grid, and specifically consider the subclasses that are obtained when each path in the representation has at most \(k\) bends (turns). We call such a subclass the \(B_k\)-VPG graphs, \(k \geq 0\).
Asinowski, Andrei +5 more
openaire +1 more source
FPR -- Fast Path Risk Algorithm to Evaluate Collision Probability [PDF]
, 2019 As mobile robots and autonomous vehicles become increasingly prevalent in human-centred environments, there is a need to control the risk of collision. Perceptual modules, for example machine vision, provide uncertain estimates of object location.
Blake, Andrew +6 more
core +3 more sources
Structural detectability analysis of cyber attacks for power grids via graph theory
IET Cyber-Physical Systems, 2018 Cyber-physical systems are pervasive in every walk of life. The safety performances of these systems are threatened by external malicious attacks and unforeseen failures. In terms of grid structural characteristics and graph theory, this study proposes a
Xiaoyuan Luo +2 more
doaj +1 more source
Hamiltonian paths on directed grids
, 2015 Our studies are related to a special class of FASS-curves, which can be described in a node-rewriting Lindenmayer-system. These ortho-tile (or diagonal) type recursive curves inducing Hamiltonian paths. We define a special directed graph on a rectangular grid, and we enumerate all Hamiltonian paths on this graph.
Hujter, Mihály, Kaszanyitzky, András
openaire +2 more sources
An inequality on paths in a grid
Journal of Combinatorial Theory, Series A, 1992 An inequality on paths in a grid is given in the paper. Let \((c_{i,j})\) be a positive \(n\times m\) log supermodular matrix, i.e., \(c_{i,j}\cdot c_{i+1,j+1}\geq c_{i+1,j}\cdot c_{i,j+1}\). Then there exists a path from \(c_{1,1}\) to \(c_{n,m}\) whose average dominates that of all the entries of the matrix \((c_{i,j})\).
Beck, István, Krogdahl, Stein
openaire +1 more source
Numerical Simulation of Single-Electron Tunneling in Random Arrays of Small Tunnel Junctions Formed by Percolation of Conductive Nanoparticles [PDF]
, 2018 We numerically simulated electrical properties, i.e., the resistance and Coulomb blockade threshold, of randomly-placed conductive nanoparticles. In simulation, tunnel junctions were assumed to be formed between neighboring particle-particle and particle-
Ayumi HIRANO-IWATA +3 more
core +2 more sources
Improved A* Path Planning Method Based on the Grid Map
Sensors, 2022 In obstacle spatial path planning, the traditional A* algorithm has the problem of too many turning points and slow search speed. With this in mind, a path planning method that improves the A* (A-Star) algorithm is proposed. The mobile robot platform was equipped with a lidar and inertial measurement unit (IMU). The Hdl_graph_slam mapping algorithm was
Yangqi Ou +4 more
openaire +3 more sources
Distribution of renewable energy through the energy internet: A routing algorithm for energy routers
Energy Reports, 2022 Fossil fuels are rapidly running out, and with the demand for environmentally friendly energy sources increasing, power grids are looking for distributed power generation-based renewable resources.
Dijo P. Koottappillil +3 more
doaj +1 more source
The Minimum Shared Edges Problem on Grid-like Graphs
, 2017 We study the NP-hard Minimum Shared Edges (MSE) problem on graphs: decide whether it is possible to route $p$ paths from a start vertex to a target vertex in a given graph while using at most $k$ edges more than once.
D Bhatia +13 more
core +1 more source