University of Colorado Boulder - Robotic Path Planning and Task Execution
- Offered byCoursera
Robotic Path Planning and Task Execution at Coursera Overview
Duration | 42 hours |
Start from | Start Now |
Total fee | Free |
Mode of learning | Online |
Official Website | Explore Free Course  |
Credential | Certificate |
Robotic Path Planning and Task Execution at Coursera Highlights
- Earn a certificate of completion
- Add to your LinkedIn profile
- 9 quizzes
Robotic Path Planning and Task Execution at Coursera Course details
- What you'll learn
- Use discrete planning techniques such as Dijkstra and A* to compute optimal robot trajectories.
- Implement complex sequences of behaviors using behavior trees.
- Plan and implement a complex robotic controller for autonomous mobile manipulation behavior.
- This course, which is the last and final course in the Introduction to Robotics with Webots specialization, will teach you basic approaches for planning robot trajectories and sequence their task execution. In "Robotic Path Planning and Task Execution", you will develop standard algorithms such as Breadth-First Search, Dijkstra's, A* and Rapidly Exploring Random Trees through guided exercises. You will implement Behavior Trees for task sequencing and experiment with a mobile manipulation robot "Tiago Steel".
- It is recommended that you complete the first and second courses of this specialization, - - Introduction to Robotics: Basic Behaviors and "Robotic Mapping and Trajectory Generation" , before beginning this one.
- This course can be taken for academic credit as part of CU Boulder's MS in Computer Science degrees offered on the Coursera platform. These fully accredited graduate degrees offer targeted courses, short 8-week sessions, and pay-as-you-go tuition. Admission is based on performance in three preliminary courses, not academic history. CU degrees on Coursera are ideal for recent graduates or working professionals. Learn more:
- MS in Computer Science: https://coursera.org/degrees/ms-computer-science-boulder
Robotic Path Planning and Task Execution at Coursera Curriculum
Path Planning
Introduction to the Specialization
Meet the Instructor
Introduction to "Robotic Path Planning and Task Execution"
Path Planning
Graph Traversal using Breadth-First Search (BFS)
Shortest Path on a Graph with BFS
Shortest Path on a Grid with BFS
From BFS to Dijkstra's on a Graph
Earn Academic Credit for your Work!
Course Support
Course Activities
Why Planning?
More on Graphs to Represent Computational Problems
The Shortest Path Problem
Graph Traversal
Dijkstra's Algorithm
A* - Dijkstra's with Heuristic
Decompression - The Micro Mouse Competition
Planning on Graphs
Implementing a Planner
Introduce Yourself!
Collision Checking and Randomized Algorithms
Randomized Planning and Collision Avoidance
Introduction to RRT
The RRT Algorithm
Collision Checking
Improving Optimality and Speed of RRT
Hands-On: Implementing RRT
Hands-On: Implement Line-Based Collision Checking
Improving RRT
Behavior Trees
Behavior Trees
Introduction
Parallel Nodes, Decorators and Blackboards
Exchanging Data Within BTs - Blackboards
Behavior Tree Libraries
Sequence and Selector nodes
Hands-On: Implementing Behavior Trees
Mapping and Navigation with BTs
Basic Manipulation
Final Project for This Specialization
Farewell - What Now?
Robotics Specialization Final Project
Robotic Path Planning and Task Execution at Coursera Admission Process
Important Dates
Other courses offered by Coursera
Student Forum
Anything you would want to ask experts?
Emerging TechnologiesRoboticsRobotics and Autonomous MachinesRobotic Path Planning and Task Execution