Hierarchical Path Planning for Multi-Size Agents in Heterogeneous Environments Daniel Harabor† Abstract— Path planning is a central topic in games and other research areas, such as robotics. Despite this, very little

First Page		Document Content
Date: 2009-02-05 01:17:36 Graph theory Mathematics Routing algorithms Edsger W. Dijkstra Game artificial intelligence Search algorithms Pathfinding Line graph Graph A* search algorithm Directed graph Shortest path problem		Hierarchical Path Planning for Multi-Size Agents in Heterogeneous Environments Daniel Harabor† Abstract— Path planning is a central topic in games and other research areas, such as robotics. Despite this, very little Add to Reading List Source URL: www.csse.uwa.edu.au Download Document from Source Website File Size: 821,47 KB Share Document on Facebook

	An Interview with Edsger W. Dijkstra OH 330 Conducted by Philip L. Frana on DocID: 1t5Ar - View Document
	What can we learn from Edsger W. Dijkstra? by Tony Hoare. 0. Preamble I would like to start by joining all of you in the expression of deep gratitude to Schlumberger for the grant which set up a series of lectures to hon DocID: 1stfp - View Document
	PADTAD 2012 Curriculum for software development with concurrency - Jeremy S. Bradbury, João M. Lourenço, Ok-Kyoon Ha, In-Bon Kuh, Yong-Kee Jun Funding provided by: Concurrency – Education DocID: 1rqUv - View Document
	Parallel Processing Letters c World Scientific Publishing Company ⃝ SOME GPU ALGORITHMS FOR GRAPH CONNECTED COMPONENTS AND SPANNING TREE DocID: 1rqFm - View Document
	Call for Papers Programming for Separation of Concerns (6th edition) http://www.dmi.unict.it/~tramonta/PSC10/ DocID: 1rpw5 - View Document