Buscar
Mostrando ítems 11-20 de 318
Exploiting direction in grid graphs to build a fast and lighter subgoal graph
(2022)
En el problema de path planning sobre grafos tipo grilla, una de las principales técnicas de preprocesamiento del estado del arte son los subgoal graphs. Estos grafos consisten en un subconjunto de nodos importantes ...
Clique coloring B1-EPG graphs
(Elsevier Science, 2017-05)
We consider the problem of clique coloring, that is, coloring the vertices of a given graph such that no (maximal) clique of size at least two is monocolored. It is known that interval graphs are 2-clique colorable. In ...
Grid Pathfinding on the 2(k) Neighborhoods
(2017)
Grid pathfinding, an old AI problem, is central for the development of navigation systems for autonomous agents. A surprising fact about the vast literature on this problem is that very limited neighborhoods have been ...
Characterising circular-arc contact B0–VPG graphs
(Elsevier Science, 2020-09)
A contact B0–VPG graph is a graph for which there exists a collection of nontrivial pairwise interiorly disjoint horizontal and vertical segments in one-to-one correspondence with its vertex set such that two vertices are ...
Computing transient voltages on grounding grids buried in homogeneous and stratified soils
(2020-09-28)
Grounding grids (GGs) are essential to guarantee protection to personnel and equipment in the electrical substation. In this context, GGs provide low impedance path to high currents during faults or lightning strikes to ...
A Comparison of Path Planning Algorithms for Omni-Directional Robots in Dynamic Environments
(IEEE, 2006)
The scope of this paper is to analyze and compare three path planning methods for omni-directional robots, which are based on a) the bug algorithm, b) the potential fields algorithm, and c) the A* algorithm for minimum ...
Counting paths through a grid
(Wolfram Demonstration Project, 2011)
Counting paths through a grid
(Wolfram Demonstration Project, 2016)