关于此课程： Robotic systems typically include three components: a mechanism which is capable of exerting forces and torques on the environment, a perception system for sensing the world and a decision and control system which modulates the robot's behavior to achieve the desired ends. In this course we will consider the problem of how a robot decides what to do to achieve its goals. This problem is often referred to as Motion Planning and it has been formulated in various ways to model different situations. You will learn some of the most common approaches to addressing this problem including graph-based methods, randomized planners and artificial potential fields. Throughout the course, we will discuss the aspects of the problem that make planning challenging.
制作方： University of Pennsylvania
教学方： CJ Taylor, Professor of Computer and Information Science
School of Engineering and Applied Science
| 基本信息 | 课程 2（共 6 门，Robotics Specialization ） |
| 承诺学习时间 | 3 hours/week |
| 语言 | English, 字幕： Spanish |
| 如何通过 | 通过所有计分作业以完成课程。 |
| 用户评分 |
授课大纲
第 1 周
Introduction and Graph-based Plan Methods
Welcome to Week 1! In this module, we will introduce the problem of planning routes through grids where the robot can only take on discrete positions. We can model these situations as graphs where the nodes correspond to the grid locations and the edges to routes between adjacent grid cells. We present a few algorithms that can be used to plan paths between a start node and a goal node including the breadth first search or grassfire algorithm, Dijkstra’s algorithm and the A Star procedure.
5 个视频, 4 个阅读材料
- Reading: Computational Motion Planning Honor Code
- Reading: Getting Started with MATLAB
- Reading: Resources for Computational Motion Planning
- 视频: 1.2: Grassfire Algorithm
- 视频: 1.3: Dijkstra's Algorithm
- 视频: 1.4: A* Algorithm
- Reading: Graded MATLAB Assignments
- 视频: Getting Started with the Programming Assignments
- LTI Item: Practice MATLAB Problem
已评分: Graph-based Planning Methods
已评分: Assignment: Dijkstra Algorithm
已评分: Assignment: A Star Algorithm
第 2 周
Configuration Space
Welcome to Week 2! In this module, we begin by introducing the concept of configuration space which is a mathematical tool that we use to think about the set of positions that our robot can attain. We then discuss the notion of configuration space obstacles which are regions in configuration space that the robot cannot take on because of obstacles or other impediments. This formulation allows us to think about path planning problems in terms of constructing trajectories for a point through configuration space. We also describe a few approaches that can be used to discretize the continuous configuration space into graphs so that we can apply graph-based tools to solve our motion planning problems.
6 个视频
- 视频: 2.2: RR arm
- 视频: 2.3: Piano Mover’s Problem
- 视频: 2.4: Visibility Graph
- 视频: 2.5: Trapezoidal Decomposition
- 视频: 2.6: Collision Detection and Freespace Sampling Methods
已评分: Configuration Space
已评分: Assignment: Configuration Space (Part 1 of 2)
已评分: Assignment: Configuration Space (Part 2 of 2)
第 3 周
Sampling-based Planning Methods
Welcome to Week 3! In this module, we introduce the concept of sample-based path planning techniques. These involve sampling points randomly in the configuration space and then forging collision free edges between neighboring sample points to form a graph that captures the structure of the robots configuration space. We will talk about Probabilistic Road Maps and Randomly Exploring Rapid Trees (RRTs) and their application to motion planning problems.
3 个视频
- 视频: 3.2: Issues with Probabilistic Road Maps
- 视频: 3.3: Introduction to Rapidly Exploring Random Trees
已评分: Sampling-based Methods
已评分: Assignment: Random Sampling Approaches
第 4 周
Artificial Potential Field Methods
Welcome to Week 4, the last week of the course! Another approach to motion planning involves constructing artificial potential fields which are designed to attract the robot to the desired goal configuration and repel it from configuration space obstacles. The robot’s motion can then be guided by considering the gradient of this potential function. In this module we will illustrate these techniques in the context of a simple two dimensional configuration space.
4 个视频
- 视频: 4.2: Issues with Local Minima
- 视频: 4.3: Generalizing Potential Fields
- 视频: 4.4: Course Summary
已评分: Artificial Potential Fields
已评分: Assignment: Gradient Based Planner
常见问题解答
运作方式
Coursework
Each course is like an interactive textbook, featuring pre-recorded videos, quizzes and projects.
Help from Your Peers
Connect with thousands of other learners and debate ideas, discuss course material, and get help mastering concepts.
Certificates
Earn official recognition for your work, and share your success with friends, colleagues, and employers.
制作方
University of Pennsylvania
The University of Pennsylvania (commonly referred to as Penn) is a private university, located in Philadelphia, Pennsylvania, United States. A member of the Ivy League, Penn is the fourth-oldest institution of higher education in the United States, and considers itself to be the first university in the United States with both undergraduate and graduate studies.
价格
| 购买课程 | |
|---|---|
| 访问课程材料 | 可用 |
| 访问评分的材料 | 可用 |
| 收到最终成绩 | 可用 |
| 获得可共享的课程证书 | 可用 |
评分和审阅
a great course! interesting assignments.
The covered material is well presented, and everything felt useful and practical.
I feel they could have covered more topics. Also, the quizzes and programming exercises are short, easy, and don't cover all the techniques they mention.
slightly tough but challenging
awesome!!!