Potential-based bounded-cost search and Anytime Non-Parametric A*

First Page		Document Content
Date: 2014-05-28 11:56:44 Graph theory Admissible heuristic Uniform-cost search Heuristic function Beam search Motion planning Branch and bound Local search Hill climbing Search algorithms Mathematics Applied mathematics		Potential-based bounded-cost search and Anytime Non-Parametric A* Add to Reading List Source URL: ieor.berkeley.edu Download Document from Source Website File Size: 2,35 MB Share Document on Facebook

	AltAlt: Combining the Advantages of Graphplan and Heuristic State Search Romeo Sanchez Nigenda, XuanLong Nguyen & Subbarao Kambhampati Department of Computer Science and Engineering Arizona State University, Tempe AZ 852 DocID: 1nrAT - View Document
	Artificial Intelligence–123 Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search ✩ XuanLong Nguyen 1 , Subbarao Kambhampati ∗ , Romeo S. Nigenda Depart DocID: 1mDLh - View Document
	Informed RRT*: Optimal Sampling-based Path Planning Focused via Direct Sampling of an Admissible Ellipsoidal Heuristic Jonathan D. Gammell1 , Siddhartha S. Srinivasa2 , and Timothy D. Barfoot1 Abstract— Rapidly-explori DocID: 19sVk - View Document
	Generating and Evaluating Unsolvable STRIPS Planning Instances for Classical Planning Bachelor’s Thesis Natural Science Faculty of the University of Basel DocID: 18Yz0 - View Document
	A Normal Form for Classical Planning Tasks Florian Pommerening and Malte Helmert University of Basel Basel, Switzerland {florian.pommerening,malte.helmert}@unibas.ch DocID: 18YlY - View Document