- Level Professional
- المدة 39 ساعات hours
- الطبع بواسطة University of Colorado Boulder
-
Offered by
عن
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 starting Fall 2, 2023. 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الوحدات
Course Welcome
1
Discussions
- Introduce Yourself!
3
Videos
- Introduction to the Specialization
- Meet the Instructor
- Introduction to "Robotic Path Planning and Task Execution"
3
Readings
- Earn Academic Credit for your Work!
- Course Support
- Course Activities
Video Lecture
1
Videos
- Path Planning
Introduction to Robotic Path Planning
2
Readings
- Why Planning?
- More on Graphs to Represent Computational Problems
1
Quiz
- Planning on Graphs
Graph Traversal Algorithms
3
Videos
- Graph Traversal using Breadth-First Search (BFS)
- Shortest Path on a Graph with BFS
- Shortest Path on a Grid with BFS
2
Readings
- The Shortest Path Problem
- Graph Traversal
Dijkstra's Algorithm and A*
1
Videos
- From BFS to Dijkstra's on a Graph
3
Readings
- Dijkstra's Algorithm
- A* - Dijkstra's with Heuristic
- Decompression - The Micro Mouse Competition
Implementation in Webots
1
Quiz
- Implementing a Planner
Video Lecture
1
Videos
- Randomized Planning and Collision Avoidance
Rapidly Exploring Random Trees (RRT)
2
Readings
- Introduction to RRT
- The RRT Algorithm
1
Quiz
- Hands-On: Implementing RRT
Collision Checking
1
Readings
- Collision Checking
1
Quiz
- Hands-On: Implement Line-Based Collision Checking
Improving Optimality and Speed of RRT
1
Readings
- Improving Optimality and Speed of RRT
1
Quiz
- Improving RRT
Video Lecture
1
Videos
- Behavior Trees
Behavior Trees
1
Peer Review
- Mapping and Navigation with BTs
4
Readings
- Introduction
- Parallel Nodes, Decorators and Blackboards
- Exchanging Data Within BTs - Blackboards
- Behavior Tree Libraries
2
Quiz
- Sequence and Selector nodes
- Hands-On: Implementing Behavior Trees
Robotic Arms
1
Readings
- From Mobility to Manipulation - Forward and Inverse Kinematics
1
Quiz
- Hands-On: Controlling Arms and Fingers in Webots
Perception For Manipulation
1
Readings
- Perception for Manipulation
1
Quiz
- Hands-On: Instance-Based Segmentation in Webots
Putting It All Together
1
Peer Review
- Robotics Specialization Final Project
1
Videos
- Farewell - What Now?
Auto Summary
Embark on your journey into advanced robotics with the "Robotic Path Planning and Task Execution" course. This professional-level course, the final installment in the "Introduction to Robotics with Webots" specialization, delves into essential techniques for planning robot trajectories and sequencing tasks. You'll master algorithms such as Breadth-First Search, Dijkstra's, A*, and Rapidly Exploring Random Trees through hands-on exercises. Additionally, you'll implement Behavior Trees for task sequencing and experiment with the mobile manipulation robot "Tiago Steel." Designed for those who have completed the prior courses in the specialization, "Introduction to Robotics: Basic Behaviors" and "Robotic Mapping and Trajectory Generation," this course is ideal for recent graduates or working professionals looking to deepen their expertise in robotics. Offered by CU Boulder on the Coursera platform, this course can also count towards a fully accredited MS in Computer Science degree. The program features short 8-week sessions, pay-as-you-go tuition, and admission based on performance in preliminary courses, making it accessible and flexible. Whether you're seeking academic credit or aiming to enhance your professional skills, this course provides a comprehensive and practical approach to robotic path planning and task execution. Dive into the world of robotics and transform your career today. Learn more about the MS in Computer Science: [MS in Computer Science](https://coursera.org/degrees/ms-computer-science-boulder)

Nikolaus Correll