Additive Heuristic for Four-Connected Gridworlds
نویسنده
چکیده
Memory-based heuristic techniques have been used to effectively reduce search times in implicit graphs. Recently, these techniques have been applied to improving search times in explicit graphs. This paper presents a new memory-based, additive heuristic that can be used on a type of explicit graph: the four-connected gridworld. The heuristic reduces the number of expanded nodes by up to five times, reduces execution time by up to 29 times, and can efficiently accommodate graph changes.
منابع مشابه
Efficient Incremental Search for Moving Target Search
Incremental search algorithms reuse information from previous searches to speed up the current search and are thus often able to find shortest paths for series of similar search problems faster than by solving each search problem independently from scratch. However, they do poorly on moving target search problems, where both the start and goal cells change over time. In this paper, we thus deve...
متن کاملGridworlds as Testbeds for Planning with Incomplete Information
Gridworlds are popular testbeds for planning with incomplete information but not much is known about their properties. We study a fundamental planning problem, localization, to investigate whether gridworlds make good testbeds for planning with incomplete information. We find empirically that greedy planning methods that interleave planning and plan execution can localize robots very quickly on...
متن کاملApproximating Minimum-Size k-Connected Spanning Subgraphs via Matching
Abstract An e cient heuristic is presented for the problem of nding a minimum size k connected spanning subgraph of an undirected or directed simple graph G V E There are four versions of the problem and the approximation guarantees are as followsAn e cient heuristic is presented for the problem of nding a minimum size k connected spanning subgraph of an undirected or directed simple graph G V ...
متن کاملA Survay of Reinforcement Learning Methods in the Windy and Cliff-walking Gridworlds
This report details the implementation of three Reinforcment learning methods, Monte Carlo, SARSA, and Q-Learning, and compares their performances in the Windy and CliffWalking Gridworlds.
متن کاملComputing the additive degree-Kirchhoff index with the Laplacian matrix
For any simple connected undirected graph, it is well known that the Kirchhoff and multiplicative degree-Kirchhoff indices can be computed using the Laplacian matrix. We show that the same is true for the additive degree-Kirchhoff index and give a compact Matlab program that computes all three Kirchhoffian indices with the Laplacian matrix as the only input.
متن کامل