1 / 7

EXERCISES – Path planning

EXERCISES – Path planning. & ROS ISSUES. By Vuk Vujovic. APPLICATIONS OF PATH PLANNING. Potential Field approach vs. graph approach. A* Algorithm - recap. http://ashblue.github.io/javascript-pathfinding/. A* approach – discussion. Manhattan distance Euclidean distance

brandon-hopper
Download Presentation

EXERCISES – Path planning

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. EXERCISES – Path planning & ROS ISSUES By Vuk Vujovic

  2. APPLICATIONS OF PATH PLANNING

  3. Potential Field approach vs. graph approach

  4. A* Algorithm - recap http://ashblue.github.io/javascript-pathfinding/

  5. A* approach – discussion • Manhattan distance • Euclidean distance • Which one works better for you and why? • 4-connected or 8-connected? • Which one is better for our case? THINK ABOUT HOW IS YOUR ROBOT MOVING! HEURISTIC SHOULD APPROXIMATE THE OPTIMAL DISTANCE FROM CURRENT NODE TO GOAL

  6. ROS tf why and how? • System for describing relations among different coordinate frames • Keeps track of relations for you • Perfect for models with multiple bodies like robotic arms and humanoid robots http://www.ros.org/news/resources/2009/nao_rviz.png

  7. QUESTIONS? http://www.globalrobots.com/uploads/images/Question%20mark%20robot.jpg

More Related