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

	PDF Document DocID: 17a1f - View Document
	Principles of Artificial Intelligence Fall 2005 Handout #2 Goal-Based Agents Vasant Honavar Artificial Intelligence Research Laboratory DocID: XIAc - View Document
	Uninformed Search Hal Daumé III Computer Science University of Maryland [removed] CS 421: Introduction to Artificial Intelligence DocID: EtiC - View Document
	Potential-based bounded-cost search and Anytime Non-Parametric A* DocID: yyCf - View Document