Path Planning Systems - Revision history

Kberzinch3: Text replacement - "Category: IGVC 2008" to "Category:2008-2009"

2018-07-19T02:05:32Z

2013-10-29T20:20:53Z

2008-01-27T22:28:27Z

‎TODO List: Added Splines as task.

2008-01-27T21:49:30Z

‎TODO List: Reorganized TODO list.

2008-01-27T21:37:55Z

Added (weekly) TODO list

2008-01-27T20:26:45Z

‎Books: Sold one of those books.

2007-12-19T01:48:15Z

‎Task List: Updated tasks.

2007-11-12T16:34:00Z

Added diagram of architecture.

2007-11-12T15:40:51Z

‎Task List: Completed "add obstacles" task.

2007-11-03T18:49:32Z

‎Task List

← Older revision		Revision as of 02:05, 19 July 2018
Line 76:		Line 76:
	**http://www.cs.dartmouth.edu/~brd/papers/siggraph/animation.pdf		**http://www.cs.dartmouth.edu/~brd/papers/siggraph/animation.pdf

−	[[Category: IGVC]][[Category: ~~IGVC~~ 2008]]	+	[[Category: IGVC]][[Category:2008-2009]]

← Older revision		Revision as of 20:20, 29 October 2013
Line 75:		Line 75:
	* Hassouna, Abdel-Hakim, Farag. "Robust Robotic Path Planning Using Level Sets." Proc. IEEE ICIP, pp 473-476, 2005.		* Hassouna, Abdel-Hakim, Farag. "Robust Robotic Path Planning Using Level Sets." Proc. IEEE ICIP, pp 473-476, 2005.
	**http://www.cs.dartmouth.edu/~brd/papers/siggraph/animation.pdf		**http://www.cs.dartmouth.edu/~brd/papers/siggraph/animation.pdf
		+
		+	[[Category: IGVC]][[Category: IGVC 2008]]

@@ Line 21: / Line 21: @@
 ** [ ] MATLAB
 *** [ ] Vectorization
 ** [ ] C
 *** [ ] Matrices/Vectors

@@ Line 23: / Line 23: @@
 ** [ ] C
 *** [ ] Matrices/Vectors
-*** [ ] Queues
+**** [ ] MTL http://osl.iu.edu/research/mtl/
-*** [ ] Occupancy Grid
+**** [ ] Meschach http://www.math.uiowa.edu/~dstewart/meschach/
 == Task List ==

@@ Line 15: / Line 15: @@
 * IGVC Work Day
 ** Saturday, 2-6pm, Tin Building
 == Task List ==

@@ Line 44: / Line 44: @@
 ** [[User:JinL|Jin Joo]] has a hard copy.
 * "Probabilistic Robotics" by Sebastian Thurn, Wolfram Burgard, Dieter Fox
 ** [[User:JeanPierreDLC|JP]] has a hard copy.

@@ Line 20: / Line 20: @@
 ** [x] Dijkstra's algorithm
 ** [ ] Gradient traversal
 ** [ ] A* algorithm
 ** [ ] D* algorithm
 * [ ] Cost Map
-** [ ] Sweeping Algorithm
+** [x] Sweeping Algorithm
 *** [x] implement manhattan distance
 *** [x] implement geometric approximation
 *** [x] add obstacles
-*** [ ] add variable start/goal locations
+*** [x] add variable start/goal locations
 == Resources ==

← Older revision		Revision as of 16:34, 12 November 2007
Line 1:		Line 1:
	The "Path Planning Systems" groups is responsible for find an optimal path through the environment, given a model of the environment from the data (provided by [[Data Filtering Systems]] group). This group will be developing the high-level code to control Candii during the autonomous and GPS waypoint navigation challenges--essentially, Candii's AI. Path planning algorithms, maps, and learning are the main focus points of this group.		The "Path Planning Systems" groups is responsible for find an optimal path through the environment, given a model of the environment from the data (provided by [[Data Filtering Systems]] group). This group will be developing the high-level code to control Candii during the autonomous and GPS waypoint navigation challenges--essentially, Candii's AI. Path planning algorithms, maps, and learning are the main focus points of this group.
		+
		+	[[Image:igvcpp.png\|thumb\|right\|480px\|Path Planning Systems Architecture]]

	== People ==		== People ==

@@ Line 15: / Line 15: @@
 == Task List ==
-* [ ] Path planning algorithms
+* [ ] Path Planning
-** [ ] Determine (research) relevant algorithms
+** [x] Dijkstra's algorithm
-*** [ ] for autonomous navigation challenge
+** [ ] Gradient traversal
-*** [ ] for GPS waypoint navigation challenge
+** [ ] A* algorithm
-** [ ] Add relevant resources to the "Resources" section.
+** [ ] D* algorithm
-* [ ] Maps
+* [ ] Cost Map
-** [ ] Determine best type of map
+** [ ] Sweeping Algorithm
-** [ ] Coordinate with [[Data Filtering Systems]] group
+*** [x] implement manhattan distance
-* [ ]  Machine learning
+*** [x] implement geometric approximation
-** [ ] Algorithms for learning
+*** [ ] add obstacles
-** [ ] Evaluating effectiveness of cost function
+*** [ ] add variable start/goal locations
 == Resources ==