scholarly journals Best-First Heuristic Search for Multicore Machines

2010 ◽  
Vol 39 ◽  
pp. 689-743 ◽  
Author(s):  
E. Burns ◽  
S. Lemons ◽  
W. Ruml ◽  
R. Zhou

To harness modern multicore processors, it is imperative to develop parallel versions of fundamental algorithms. In this paper, we compare different approaches to parallel best-first search in a shared-memory setting. We present a new method, PBNF, that uses abstraction to partition the state space and to detect duplicate states without requiring frequent locking. PBNF allows speculative expansions when necessary to keep threads busy. We identify and fix potential livelock conditions in our approach, proving its correctness using temporal logic. Our approach is general, allowing it to extend easily to suboptimal and anytime heuristic search. In an empirical comparison on STRIPS planning, grid pathfinding, and sliding tile puzzle problems using 8-core machines, we show that A*, weighted A* and Anytime weighted A* implemented using PBNF yield faster search than improved versions of previous parallel search proposals.

2002 ◽  
Vol 12 (6) ◽  
pp. 875-903 ◽  
Author(s):  
BART JACOBS

This paper introduces a temporal logic for coalgebras. Nexttime and lasttime operators are defined for a coalgebra, acting on predicates on the state space. They give rise to what is called a Galois algebra. Galois algebras form models of temporal logics like Linear Temporal Logic (LTL) and Computation Tree Logic (CTL). The mapping from coalgebras to Galois algebras turns out to be functorial, yielding indexed categorical structures. This construction gives many examples, for coalgebras of polynomial functors on sets. More generally, it will be shown how ‘fuzzy’ predicates on metric spaces, and predicates on presheaves, yield indexed Galois algebras, in basically the same coalgebraic manner.


2016 ◽  
Vol 57 ◽  
pp. 307-343 ◽  
Author(s):  
Nathan R. Sturtevant ◽  
Vadim Bulitko

Real-time agent-centered heuristic search is a well-studied problem where an agent that can only reason locally about the world must travel to a goal location using bounded computation and memory at each step. Many algorithms have been proposed for this problem and theoretical results have also been derived for the worst-case performance with simple examples demonstrating worst-case performance in practice. Lower bounds, however, have not been widely studied. In this paper we study best-case performance more generally and derive theoretical lower bounds for reaching the goal using LRTA*, a canonical example of a real-time agent-centered heuristic search algorithm. The results show that, given some reasonable restrictions on the state space and the heuristic function, the number of steps an LRTA*-like algorithm requires to reach the goal will grow asymptotically faster than the state space, resulting in ``scrubbing'' where the agent repeatedly visits the same state. We then show that while the asymptotic analysis does not hold for more complex real-time search algorithms, experimental results suggest that it is still descriptive of practical performance.


Author(s):  
Harvei Desmon Hutahaean

Search is the process of finding solutions in a problem until a solution or goal is found, or a movement in the state-space to search for trajectories from initial-state to goal-state. In a TIC TAC Toe game the process of finding a space situation is not enough to automate problem-solving behavior, in each of these situations there are only a limited number of choices that a player can make. The problems that will be faced can be solved by searching from the choices available, supported by the usual way of resolving. Best First Search works by searching for a directed graph which each node represents a point in a problem space.


2009 ◽  
Vol 34 ◽  
pp. 27-59 ◽  
Author(s):  
N. Meuleau ◽  
E. Benazera ◽  
R. I. Brafman ◽  
E. A. Hansen ◽  
Mausam

We consider the problem of optimal planning in stochastic domains with resource constraints, where the resources are continuous and the choice of action at each step depends on resource availability. We introduce the HAO* algorithm, a generalization of the AO* algorithm that performs search in a hybrid state space that is modeled using both discrete and continuous state variables, where the continuous variables represent monotonic resources. Like other heuristic search algorithms, HAO* leverages knowledge of the start state and an admissible heuristic to focus computational effort on those parts of the state space that could be reached from the start state by following an optimal policy. We show that this approach is especially effective when resource constraints limit how much of the state space is reachable. Experimental results demonstrate its effectiveness in the domain that motivates our research: automated planning for planetary exploration rovers.


2019 ◽  
Vol 2019 ◽  
pp. 1-13 ◽  
Author(s):  
Chung-Cheng Chen ◽  
Jian Ke ◽  
Yen-Ting Chen

The state-space formulation overcomes many limitations of traditional differential equation approach and is utilized as alternative to many traditional approaches in the modern electrical field. This paper proposes a new method of finding the state equation for degenerate circuit and coupling circuit that have not been systematically solved now. This paper also introduces some sound improvements to solve complicated dependent-source circuits. Four comparative examples are demonstrated to show the significant merits that our method owns over the traditional approaches.


2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Ji Chol ◽  
Ri Jun Il

Abstract The modeling of counter-current leaching plant (CCLP) in Koryo Extract Production is presented in this paper. Koryo medicine is a natural physic to be used for a diet and the medical care. The counter-current leaching method is mainly used for producing Koryo medicine. The purpose of the modeling in the previous works is to indicate the concentration distributions, and not to describe the model for the process control. In literature, there are no nearly the papers for modeling CCLP and especially not the presence of papers that have described the issue for extracting the effective components from the Koryo medicinal materials. First, this paper presents that CCLP can be shown like the equivalent process consisting of two tanks, where there is a shaking apparatus, respectively. It allows leachate to flow between two tanks. Then, this paper presents the principle model for CCLP and the state space model on based it. The accuracy of the model has been verified from experiments made at CCLP in the Koryo Extract Production at the Gang Gyi Koryo Manufacture Factory.


Author(s):  
Chung-Hao Wang

An analytical solution of the problem of a cylindrically anisotropic tube which contains a line dislocation is presented in this study. The state space formulation in conjunction with the eigenstrain theory is proved to be a feasible and systematic methodology to analyze a tube with the existence of dislocations. The state space formulation which expediently groups the displacements and the cylindrical surface traction can construct a governing differential matrix equation. By using Fourier series expansion and the well developed theory of matrix algebra, the asymmetrical solutions are not only explicit but also compact in form. The dislocation considered in this study is a kind of mixed dislocation which is the combination of edge dislocations and a screw dislocation and the dislocation line is parallel to the longitudinal axis of the tube. The degeneracy of the eigen relation and the technique to determine the inverse of a singular matrix are thoroughly discussed, so that the general solutions can be applied to the case of isotropic tubes, which is one of the novel features of this research. The results of isotropic problems, which are belong to the general solutions, are compared with the well-established expressions in the literature. The satisfied correspondences of these comparisons indicate the validness of this study. A cylindrically orthotropic tube is also investigated as an example and the numerical results for the displacements and tangential stress on the outer surface are displayed. The effects on surface stresses due to the existence of a dislocation appear to have a characteristic of localized phenomenon.


Sign in / Sign up

Export Citation Format

Share Document