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

First Page		Document Content
Date: 2014-07-22 11:25:05 Heuristics Artificial intelligence Rapidly-exploring random tree Robot control Combinatorial optimization Routing algorithms Heuristic function A* search algorithm Motion planning Search algorithms Mathematics Applied mathematics		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 Add to Reading List Source URL: www.ri.cmu.edu Download Document from Source Website File Size: 1,98 MB Share Document on Facebook

	Heuristic Evaluation Functions for General Game Playing DocID: 1qSuo - View Document
	Automatic Construction of a Heuristic Search Function for General Game Playing Stephan Schiffel and Michael Thielscher Department of Computer Science Dresden University of Technology {stephan.schiffel,mit}@inf.tu-dresden DocID: 1pxnr - View Document
	Distributed Computing Prof. R. Wattenhofer Bachelor’s thesis: Ranking alternatives offline DocID: 1mZq5 - View Document
	Games and Economic Behavior–385 www.elsevier.com/locate/geb Identifying individual differences: An algorithm with application to Phineas Gage Daniel Houser a,∗ , Antoine Bechara b , Michael Keane c , DocID: 1gnph - View Document
	PNBA*: A Parallel Bidirectional Heuristic Search Algorithm Luis Henrique Oliveira Rios1 , Luiz Chaimowicz1 1 Departamento de Ciˆencia da Computac¸a˜ o Universidade Federal de Minas Gerais (UFMG) – Belo Horizonte, MG DocID: 1gfQN - View Document