Maze - Revision history

Robot: /* Improvements */

2010-07-09T12:38:27Z

‎Improvements

2010-07-09T12:37:54Z

‎Project Files

2010-07-09T12:35:23Z

‎Improvements

2010-07-09T12:34:59Z

‎Improvements

2010-07-09T12:33:46Z

‎Project Files

2010-07-09T12:30:13Z

‎Project Files

2010-07-09T12:29:15Z

‎Overview

2010-07-09T12:19:40Z

‎Overview

2010-07-09T12:14:09Z

2010-07-09T12:13:46Z

‎Overview

@@ Line 23: / Line 23: @@
 == Improvements==
-First improvement of this maze-solving robot is finding path with no dead-ends. Robot would once find the way out remembering crossroads and every other time it would pass the maze ignoring dead-ends (complete algorithm is described in [[Media: detailedView!.txt|detailedView.txt]]). Another possibiliy is to map complete maze and then use Dijkstra's algorihm to find the shortest way (values should be time needed to pass a way, rather than lengths)
+First improvement of this maze-solving robot is finding path with no dead-ends. Robot would once find the way out remembering crossroads and every other time it would pass the maze ignoring dead-ends (complete algorithm is described in [[Media: detailed-View.txt|detailedView.txt]]). Another possibiliy is to map complete maze and then use Dijkstra's algorihm to find the shortest way (values should be time needed to pass a way, rather than lengths)
 Further improvememnts are to be made in robot's speed and elegance of movements.

@@ Line 220: / Line 220: @@
 | Project sourcecode || [[Media: SourceCode.txt]]
 |-
-| Project detailed view|| [[Media: detailed view!.txt]]
+| Project detailed view|| [[Media: detailed-view.txt]]
 |-
 |}
 Go back to the [[Summer_School_2010#Projects|List of the projects]]
 [[Category:Projects]]

@@ Line 23: / Line 23: @@
 == Improvements==
-First improvement of this maze-solving robot is finding path with no dead-ends. Robot would once find the way out remembering crossroads and every other time it would pass the maze ignoring dead-ends (complete algorithm is described in [[Media: detailed view.txt|detailedView.txt]]). Another possibiliy is to map complete maze and then use Dijkstra's algorihm to find the shortest way (values should be time needed to pass a way, rather than lengths)
+First improvement of this maze-solving robot is finding path with no dead-ends. Robot would once find the way out remembering crossroads and every other time it would pass the maze ignoring dead-ends (complete algorithm is described in [[Media: detailedView!.txt|detailedView.txt]]). Another possibiliy is to map complete maze and then use Dijkstra's algorihm to find the shortest way (values should be time needed to pass a way, rather than lengths)
 Further improvememnts are to be made in robot's speed and elegance of movements.

@@ Line 23: / Line 23: @@
 == Improvements==
-First improvement of this maze-solving robot is finding path with no dead-ends. Robot would once find the way out remembering crossroads and every other time it would pass the maze ignoring dead-ends (complete algorithm is described in [[Media: detailedView.txt|detailedView.txt]]). Another possibiliy is to map complete maze and then use Dijkstra's algorihm to find the shortest way (values should be time needed to pass a way, rather than lengths)
+First improvement of this maze-solving robot is finding path with no dead-ends. Robot would once find the way out remembering crossroads and every other time it would pass the maze ignoring dead-ends (complete algorithm is described in [[Media: detailed view.txt|detailedView.txt]]). Another possibiliy is to map complete maze and then use Dijkstra's algorihm to find the shortest way (values should be time needed to pass a way, rather than lengths)
 Further improvememnts are to be made in robot's speed and elegance of movements.

@@ Line 220: / Line 220: @@
 | Project sourcecode || [[Media: SourceCode.txt]]
 |-
-| Project detailed view|| [[Media: detailed view.txt]]
+| Project detailed view|| [[Media: detailed view!.txt]]
 |-
 |}
 Go back to the [[Summer_School_2010#Projects|List of the projects]]
 [[Category:Projects]]

@@ Line 1: / Line 1: @@
 = Project: Maze =
 == Overview ==
-[[Image:ivan_daniel_robot1.jpg|thumb|Maze following robot|500px|right|The maze following robot]]
+[[Image:ivan_daniel_robot1.jpg|thumb|Maze following robot|400px|right|The maze following robot]]
 '''Authors: ''' Daniel Slenders, Ivan Gavran <BR>
 '''Countries: ''' Belgium, Croatia <BR>
 '''Date: ''' 09.07.2010 <BR>
 '''Activity: ''' R.U.R. - Summer School 2010 <BR>
 ==Abstract ==