Embedded Motion Control 2012 Group 1: Difference between revisions

From Control Systems Technology Group
Jump to navigation Jump to search
No edit summary
No edit summary
Line 36: Line 36:


==Week 1==
==Week 1==
<ul>
* Installed all required software on our computers :)
<li>Installed all required software on our computers :)</li>
* Everybody gained some knowledge about Unix, ROS and C++.
<li>Everybody gained some knowledge about Unix, ROS and C++.</li>
</ul>


==Week 2==
==Week 2==
<ul>
 
<li>Everybody gained more knowledge about Unix, ROS and C++.</li>
* Everybody gained more knowledge about Unix, ROS and C++.
<li>Looked at Gazebo, Rviz, Turtlebot_simulator, PR2_simulator, Jazz_robot_simulator</li>
* Looked at Gazebo, Rviz, Turtlebot_simulator, PR2_simulator, Jazz_robot_simulator
<li>Managed to create 2D map with Jazz Robot Simulator: http://www.youtube.com/watch?v=Cmh8dMrmgN0</li>
* Managed to create 2D map with Jazz Robot Simulator: http://www.youtube.com/watch?v=Cmh8dMrmgN0
<li>Made presentation of Chapter 1: Introduction, Link to the presentation: http://cstwiki.wtb.tue.nl/images/Powerpoint_Chapter_1.pdf</li>
* Made presentation of Chapter 1: Introduction, Link to the presentation: http://cstwiki.wtb.tue.nl/images/Powerpoint_Chapter_1.pdf
</ul>


==Week 3==
==Week 3==
[[File:Mapping.jpg|thumb|300px|''Optimized map'']]
[[File:Mapping.jpg|thumb|300px|''Optimized map'']]
<ul>
* Thought about an efficient algorithm to solve the 'maze'-problem. Depth-First-Search is proposed as a candidate algorithm.
  <li>Thought about an efficient algorithm to solve the 'maze'-problem. Depth-First-Search is proposed as a candidate algorithm.</li>
* Started with arrow recognition using the OpenCV package.
  <li>Started with arrow recognition using the OpenCV package.</li>
* Started with map-processing to build up a tree of the maze which can be used by the decision algorithm.
  <li>Started with map-processing to build up a tree of the maze which can be used by the decision algorithm.</li>
* Optimized mapping algorithm and did some processing on the map. See Figure "Optimized map"
  <li>Optimized mapping algorithm and did some processing on the map. See Figure "Optimized map" <br /> </li>
* tarted with navigation node for autonomous navigation of the jazz
  <li>Started with navigation node for autonomous navigation of the jazz</li> 
Tasks for Week 4:
</ul>
Tasks for Week 4: <br />
- Process map; add markers at crossings and define paths between these markers for navigation
- Process map; add markers at crossings and define paths between these markers for navigation
<br> <br> <br> <br> <br> <br>
<br> <br> <br> <br> <br> <br>
Line 64: Line 59:
==Week 4==
==Week 4==
[[File:Detected corners straight map 22-5-12.png|thumb|300px|''Corner detection'']]
[[File:Detected corners straight map 22-5-12.png|thumb|300px|''Corner detection'']]
<ul>
* Arrows can be detected by camera with use of the OpenCV package.
  <li>Arrows can be detected by camera with use of the OpenCV package.</li>
* Robot can detect its position in a corridor with use of its laser data and can drive autonomous.
  <li>Robot can detect its position in a corridor with use of its laser data and can drive autonomous.</li>
* Corner detection; extracted out of the occupancy-grid. See Figure "Corner detection".
  <li>Corner detection; extracted out of the occupancy-grid. See Figure "Corner detection" <br /> </li>
</ul>
<br> <br> <br> <br> <br> <br> <br> <br> <br> <br> <br> <br> <br>
<br> <br> <br> <br> <br> <br> <br> <br> <br> <br> <br> <br> <br>


Line 79: Line 72:


==Week 6==
==Week 6==
<ul>
* Did tests with the real Jazz Robot; some issues were find concerning the update-rate; perhaps a new navigation strategy is needed. http://youtu.be/_g9S24xXes4
  <li>Did tests with the real Jazz Robot; some issues were find concerning the update-rate; perhaps a new navigation strategy is needed. http://youtu.be/_g9S24xXes4</li>
* New navigation strategy implemented. Still a couple of bugs that have to be fixed; this is for next week.
  <li>New navigation strategy implemented. Still a couple of bugs that have to be fixed; this is for next week.</li>
* Created a visualization-class to visualize the node-structure for better perception of the algorithm.
  <li>Created a visualization-class to visualize the node-structure for better perception of the algorithm.</li>
* Finished DFS algorithm; algorithm works now if there are no loops. http://www.youtube.com/watch?v=KSjsA6BR-Bs&feature=channel&list=UL
  <li>Finished DFS algorithm; algorithm works now if there are no loops. http://www.youtube.com/watch?v=KSjsA6BR-Bs&feature=channel&list=UL</li>
Tasks for Week 7:  
</ul>
- Debug navigation node; fix issue with no 'corridor' between 'corners'.
Tasks for Week 7: <br />
- Debug algorithm; try to find some errors.
- Debug navigation node; fix issue with no 'corridor' between 'corners'.<br />
- Corridor competition
- Debug algorithm; try to find some errors.<br />
- Corridor competition<br />
- Test on real robot
- Test on real robot


Line 94: Line 85:
[[File:maze solved.png|thumb|300px|''Original maze solved'']]
[[File:maze solved.png|thumb|300px|''Original maze solved'']]
[[File:Big_maze.jpg|thumb|300px|"Big maze solved]]
[[File:Big_maze.jpg|thumb|300px|"Big maze solved]]
<ul>
* Navigation node debugged, fixed issue with no corridor between corners.
  <li>Navigation node debugged, fixed issue with no corridor between corners.</li>
Original maze without loops solved: http://www.youtube.com/watch?v=eQblXU57aeU&feature=youtu.be
</ul>
Original maze without loops solved: http://www.youtube.com/watch?v=eQblXU57aeU&feature=youtu.be<br>
Figure "Original map solved" also shows the how the original given maze looks in Rviz when it is solved the robot.
Figure "Original map solved" also shows the how the original given maze looks in Rviz when it is solved the robot.
<br> <br> <br> <br> <br> <br> <br> <br> <br> <br> <br> <br> <br>
<br> <br> <br> <br> <br> <br> <br> <br> <br> <br> <br> <br> <br>
Line 105: Line 94:


==Week 8==
==Week 8==
<ul>
* Some adaptions on code with new simulator; result: http://www.youtube.com/watch?v=tgHOjsxDUjk&feature=plcp
  <li>Some adaptions on code with new simulator; result: http://www.youtube.com/watch?v=tgHOjsxDUjk&feature=plcp</li>
</ul>

Revision as of 11:18, 14 June 2012

Group Members

Name: Student id: Email:
Rein Appeldoorn 0657407 r.p.w.appeldoorn@student.tue.nl
Jeroen Graafmans 0657171 j.a.j.graafmans@student.tue.nl
Bart Peeters 0748906 b.p.j.j.peeters@student.tue.nl
Ton Peters 0662103 t.m.c.peters@student.tue.nl
Scott van Venrooij 0658912 s.j.p.v.venrooij@student.tue.nl

Tutor: Jos Elfring

Week 1

  • Installed all required software on our computers :)
  • Everybody gained some knowledge about Unix, ROS and C++.

Week 2

Week 3

Optimized map
  • Thought about an efficient algorithm to solve the 'maze'-problem. Depth-First-Search is proposed as a candidate algorithm.
  • Started with arrow recognition using the OpenCV package.
  • Started with map-processing to build up a tree of the maze which can be used by the decision algorithm.
  • Optimized mapping algorithm and did some processing on the map. See Figure "Optimized map"
  • tarted with navigation node for autonomous navigation of the jazz

Tasks for Week 4: - Process map; add markers at crossings and define paths between these markers for navigation





Week 4

Corner detection
  • Arrows can be detected by camera with use of the OpenCV package.
  • Robot can detect its position in a corridor with use of its laser data and can drive autonomous.
  • Corner detection; extracted out of the occupancy-grid. See Figure "Corner detection".














Week 5

  • Map-processing is cancelled, since the used package (hector_mapping) creates incorrect maps.
  • Now working on processing the laserdata to let the Jazz drive "autonomously"
  • Writing an algorithm by using depth-first-search, this algorithm obtains the kind of crossing, the position of the Robot and the angle of the Robot and sends the new direction to the Robot

Week 6

  • Did tests with the real Jazz Robot; some issues were find concerning the update-rate; perhaps a new navigation strategy is needed. http://youtu.be/_g9S24xXes4
  • New navigation strategy implemented. Still a couple of bugs that have to be fixed; this is for next week.
  • Created a visualization-class to visualize the node-structure for better perception of the algorithm.
  • Finished DFS algorithm; algorithm works now if there are no loops. http://www.youtube.com/watch?v=KSjsA6BR-Bs&feature=channel&list=UL

Tasks for Week 7: - Debug navigation node; fix issue with no 'corridor' between 'corners'. - Debug algorithm; try to find some errors. - Corridor competition - Test on real robot

Week 7

Original maze solved
"Big maze solved
  • Navigation node debugged, fixed issue with no corridor between corners.

Original maze without loops solved: http://www.youtube.com/watch?v=eQblXU57aeU&feature=youtu.be Figure "Original map solved" also shows the how the original given maze looks in Rviz when it is solved the robot.












Big maze solving also possible: http://www.youtube.com/watch?v=HEO7ETBTaDs&feature=youtu.be' The big maze solved can also be seen in Figure "Big maze solved".














Week 8