Results 1 to 10 of about 130,101 (249)
On Approximating Node-Disjoint Paths in Grids [PDF]
International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2015 In the Node-Disjoint Paths (NDP) problem, the input is an undirected n-vertex graph G, and a collection {(s_1,t_1),...,(s_k,t_k)} of pairs of vertices called demand pairs. The goal is to route the largest possible number of the demand pairs (s_i,t_i), by selecting a path connecting each such pair, so that the resulting paths are node-disjoint.
Julia Chuzhoy, David H. K. Kim
semanticscholar +6 more sources
Path Planning on Grids: The Effect of Vertex Placement on Path Length
Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2021 Video-game designers often tessellate continuous 2-dimensional terrain into a grid of blocked and unblocked square cells. The three main ways to calculate short paths on such a grid are to determine truly shortest paths, shortest vertex paths and ...
James Bailey +4 more
semanticscholar +2 more sources
On edge-intersection graphs of k-bend paths in grids [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Edge-intersection graphs of paths in grids are graphs that can be represented such that vertices are paths in a grid and edges between vertices of the graph exist whenever two grid paths share a grid edge. This type of graphs is motivated by applications
Therese Biedl, Michal Stern
doaj +2 more sources
Multiple Random Walks on Paths and Grids
34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), 2017 We derive several new results on multiple random walks on "low dimensional" graphs. First, inspired by an example of a weighted random walk on a path of three vertices given by Efremenko and Reingold, we prove the following dichotomy: as the path ...
Andrej Ivaskovic +3 more
semanticscholar +5 more sources
Theta*: Any-Angle Path Planning on Grids [PDF]
Journal of Artificial Intelligence Research, 2007 Grids with blocked and unblocked cells are often used to represent terrain in computer games and robotics. However, paths formed by grid edges can be sub-optimal and unrealistic looking, since the possible headings are artificially constrained.
A. Nash +3 more
semanticscholar +4 more sources
A Path‐Tracing Monte Carlo Library for 3‐D Radiative Transfer in Highly Resolved Cloudy Atmospheres [PDF]
Journal of Advances in Modeling Earth Systems, 2019 Interactions between clouds and radiation are at the root of many difficulties in numerically predicting future weather and climate and in retrieving the state of the atmosphere from remote sensing observations. The broad range of issues related to these
Najda Villefranque +7 more
doaj +3 more sources
Analysis of Known Linear Distributed Average Consensus Algorithms on Cycles and Paths
Sensors, 2018 In this paper, we compare six known linear distributed average consensus algorithms on a sensor network in terms of convergence time (and therefore, in terms of the number of transmissions required).
Jesús Gutiérrez-Gutiérrez +2 more
doaj +2 more sources
Large-Scale Multirobot Coverage Path Planning on Grids With Path Deconfliction
IEEE Transactions on RoboticsIn this article, we study multirobot coverage path planning (MCPP) on a four-neighbor 2-D grid $G$, which aims to compute paths for multiple robots to cover all cells of $G$.
J. Tang, Zining Mao, Hang Ma
semanticscholar +3 more sources
Speeding-Up Any-Angle Path-Planning on Grids
Proceedings of the International Conference on Automated Planning and Scheduling, 2015 Simple Subgoal Graphs are constructed from grids by placing subgoals at the corners of obstacles and connecting them. They are analogous to visibility graphs for continuous terrain but have fewer edges and can be used to quickly find shortest paths ...
T. Uras, Sven Koenig
semanticscholar +2 more sources
A Multi-Stage Real-Time Fast Search Method for Closed-Loop Paths Based on Grid Hierarchical Partitioning Characteristics [PDF]
Energies, 2023 Prior to switching operations, the dispatch automation system is required to be able to search for closed-loop paths quickly in real time. In order to improve the efficiency of closed-loop path search, this paper proposes a multi-stage real-time fast ...
Dongying Zhang +6 more
doaj +2 more sources