Basic Information
In This Course We Will Study Different Algorithmic Approaches to Solve Motion-planning Problems. We Will Start With Exact Methods For Low-dimensional Configuration Spaces and Then Continue to High- Dimensional Spaces. We Will Then Study Approaches More Suitable For High-dimensional Spaces (sampling-based Methods and Heuristic-search). Finally, We Will Demonstrate How These Algorithms Are Integrated In Different Robotic Applications Such As Medical Devices. Learning Outcomes# The Students Are Expected By The End of The Course To#_1. Explain Fundamental Concepts and Challenges in Robot Motion Planning. 2. Analyze The Complexity of Motion-planning Algorithms. 3. Distinguish Between Different Algorithmic Approaches to Robot Motion Planning. 4. Rate The Suitability of Existing Motion-planning Algorithms For a Given Motion-planning Task.
Faculty: Computer Science
|Undergraduate Studies
|Graduate Studies
Pre-required courses
236501 - Introduction to Artificial Intelligence
Semestrial Information
Weekly Hours
2 Academic Credit • 2 Lecture Hours
Go to Course Page
Responsible(s)
Oren Salzman
Exams
Session A: 01-05-2024- אולמן 706. 707.
Registration Groups
|
|
Weekly Hours
2 Academic Credit • 2 Lecture Hours
Go to Course Page
Responsible(s)
Oren Salzman
Exams
Session A: 15-02-2023 Session B: 14-03-2023Registration Groups
|
|
Weekly Hours
2 Academic Credit • 2 Lecture Hours
Go to Course Page
Responsible(s)
Oren Salzman
Exams
Session A: 15-02-2022 13:00 - 16:00- טאוב 6.
- אולמן 309.
- אולמן 200.
Registration Groups
|
|