Project graded + Final grades updated | |
|
Hi guys, I enjoyed reading your reports for the final project and the direction each one of you took. Nice job! To grade the project I evaluated your report (was it written clearly and thoroughy? did your writing exhibit strong algorithmic intuition? did you provide some complexity analysis?) and your approach (is the algorithmic approach sound? is it scalable? how did your algorithm perform in practice?). For those of you that wanted to participate in the competition: (*) the first place are IDs ending in 7033 and 1927 (3 extra points) (*) the second place is ID ending in 7920 (2 extra points) (*) the third place are two groups tied, IDs ending in 2058, 1115, 2101and 0150 (1 extra points) I updated the final grade of the course and am pleased to announce that we have a well-deserved average grade of 91 - well done! Oren |
| עדכון אחרון ב-26/3/2023, 23:02:54 Last updated on 26/3/2023, 23:02:54 Последняя модификация26/3/2023, 23:02:54 تمت الحتلنة الأخيرة ب-26/3/2023, 23:02:54 |
HW3 Grades published | |
|
Hi guys, I hope you all had a good exam period and I wish you an exciting and fruitfull new semester. HW3 was graded and the results were great, nice job. Here is a key for how it was graded, if you want personal feedback, please feel free to reach out to me. (*) Computation times (-) if computation times were VERY long (>3min for motion planning or >5 min for inspection planning) I took off 4 points (namely either -4 or -8). As a comparison, the fastest team completed the moion-planning task on average in 1 sec and the inspection task on average in 2 secs. (-) if you could not solve the inspection task for 0.9 coverage on my machine in <5 min I deduced 2 extra points (*) If you failed to explain *clearly* the algorithmic logic behind your planner and / or I could not be 100% that it was based on strong alg intuition, I took off 4 points. (*) If the approach you took to perform goal biasing was ad hoc and not using generalizable alg tools (such as informed sampling, rewiring etc), I took off 4 points. (*) If you did not submit any text on 2.2, I took off 4 points. Looking forward to reading your reports on the final project, Oren |
| עדכון אחרון ב-19/3/2023, 09:02:06 Last updated on 19/3/2023, 09:02:06 Последняя модификация19/3/2023, 09:02:06 تمت الحتلنة الأخيرة ب-19/3/2023, 09:02:06 |
Final project: Important fix for map #2 | |
|
There was a technical issue in the second map that blocked users from reaching coverage 0.6. The file Source.zip was just updated in the assignments section and you can now write your results for map #2 in your report. Please make sure to use the newest version. The updated files are example.gif, map_plan_p2.json, and plan_mp_p2.txt. Thanks to Yaron for finding this issue. As a result, 3 more days were added to the project's deadline. Notice! For those who want to participate in the competition, we will test your code with maps that might be harder to solve than the two that were supplied. If you want to further test your improvements, we encourage you to (i) test your code for coverage higher than 0.6, and (ii) change map properties (e.g., starting point and obstacles) to test your code for different scenarios. Good luck, Course Staff |
| עדכון אחרון ב-27/2/2023, 15:41:53 Last updated on 27/2/2023, 15:41:53 Последняя модификация27/2/2023, 15:41:53 تمت الحتلنة الأخيرة ب-27/2/2023, 15:41:53 |
HW3 Extension | |
|
Due to multiple requests, HW3 submission deadline was extended by 7 days (New submission date is March 7). The homework was published well in advance and no further extensions will be given. Good luck, Course staff |
| עדכון אחרון ב-26/2/2023, 12:03:38 Last updated on 26/2/2023, 12:03:38 Последняя модификация26/2/2023, 12:03:38 تمت الحتلنة الأخيرة ب-26/2/2023, 12:03:38 |
Final project | |
|
The final project of the course is available in the assignments and is due on 15.3. For any technical assistance (such as Python-related questions), please contact our TA Dean Zadok (udeanzadokatcampus.technion.ac.il) Good luck! |
| פורסם ב-29/1/2023, 15:30:13 Created on 29/1/2023, 15:30:13 Создано29/1/2023, 15:30:13 تم النشر ب-29/1/2023, 15:30:13 |
HW3 published | |
|
HW3 published and is due 28.2. For any technical assistance (such as Python-related questions), please contact our TA Dean Zadok (udeanzadokatcampus.technion.ac.il) Good luck! Oren |
| פורסם ב-11/1/2023, 13:28:24 Created on 11/1/2023, 13:28:24 Создано11/1/2023, 13:28:24 تم النشر ب-11/1/2023, 13:28:24 |
HW2 Graded | |
|
Hi guys, HW2 is graded. All in all - nice job with all grades above 85. Most issues arised in Q3 and Q4a - formalization of your responses is something that you still struggle with and could use polishing. I uploaded a response to Q3 under course material but here are the general things people missed: (*) Path structure - you were expected to explicitly say that the path follows the edges along the visibility graph (we discussed this in class). (*) It is important to track how the signature evolves over time (some of you assumed that it does not change). (*) It is important to note that there may be *multiple* possible goal vetices depending on their respective homotopy class. (*) When describining node extension, it was important to *formaly* describe how paths were tracked. (*) Many descriptions of the final search were informal and unclear. At this point of the course I expect you to formalize your answers (this helps in crystalizing what is interetsting and what is not). For each previously mentioned issue I deduced between 2-3pts. Regarding Q4a: (*) Inflating the heuristic did not help in this case. Some of you did not explain *why* this happend correctly. General comments (*) Give results in a meaningful way - saying that path quality is 591.9441187678988 is just cumbersome. 592 or 591.95 would suffice - this is not being petty is shows that you understand what is important (big picture) and what is not. Technical deduction of points: (*) Late submissions were deduced 4 pts. (*) Word (and not pdf) submissions were deduced 1 pts. |
| עדכון אחרון ב-10/1/2023, 11:48:56 Last updated on 10/1/2023, 11:48:56 Последняя модификация10/1/2023, 11:48:56 تمت الحتلنة الأخيرة ب-10/1/2023, 11:48:56 |
HW2 - extension | |
|
HW2 have been extended. Please submit the HW by Sunday, Jan 1st, end of day. Oren |
| פורסם ב-27/12/2022, 08:16:04 Created on 27/12/2022, 08:16:04 Создано27/12/2022, 08:16:04 تم النشر ب-27/12/2022, 08:16:04 |
New Material | |
|
Hi guys, I added the slides presented yesterday as well as the recording of the lecture (all under course material). See you all next week, Oren |
| פורסם ב-26/12/2022, 13:59:39 Created on 26/12/2022, 13:59:39 Создано26/12/2022, 13:59:39 تم النشر ب-26/12/2022, 13:59:39 |
No meeting today & (small) correction to HW2 | |
|
Just a reminder that today we will *not* have a meeting. In addition, for Q3.1 in HW2 - it should be "describe the structure of a *shortest* path from a start to target configuration" (added the word shortest). Oren |
| פורסם ב-18/12/2022, 08:28:49 Created on 18/12/2022, 08:28:49 Создано18/12/2022, 08:28:49 تم النشر ب-18/12/2022, 08:28:49 |
Final course meetings | |
|
Hi guys, As promissed, here is the schedule for the final meetings of the course. This Sunday (Dec 11th), we will meet to continue discussing Inspection planning and path following. For this you need to see the last lecture on task-space planning. The following week (Dec18th), we will take a break so you can catch up on all the material and your course work. On Dec 25th, we will meet to discuss the projects and wrap up the formal part of the course. On Sunday Jan 1st, we will have a guest lecture by Sven Koenig from USC, a leading AI researcher on Multi-agent Path Finding. This is an active area of research and next semester I am giving a dedicated seminar on this subject. We are very lucky to have such a guest lecturer and I encourage everyone to attend. Sven is both a great speaker and a leading researcher. In addition we may also have David Zarrouk from BGU (we are still coordinating details) who will talk about the mechanical side of building robots. Oren |
| עדכון אחרון ב-8/12/2022, 10:37:12 Last updated on 8/12/2022, 10:37:12 Последняя модификация8/12/2022, 10:37:12 تمت الحتلنة الأخيرة ب-8/12/2022, 10:37:12 |
HW1 - grades (non-integer values) | |
|
Hi guys, Since I only wanted to deduce 0.5 points in Q1b, the system did not accept non-integer values. I deduced a whole point in these cases but I will retun them when calculating the final grade. Thanks for understanding, Oren |
| פורסם ב-6/12/2022, 14:16:21 Created on 6/12/2022, 14:16:21 Создано6/12/2022, 14:16:21 تم النشر ب-6/12/2022, 14:16:21 |
HW1 graded | |
|
Hi guys, I finished grading HW1 - nice job! If for some reason you can't see your grade - please reach out to me. The system is weird and I am not 100% sure that everything went through (I have a local copy where I keep the grades so there is nothing to worry about) Here is some feedback / common mistakes / point deduction key: ++++++++++++++++++++ Dry part: ++++++++++++++++++++ All of you got a perfect score on Q1a and Q1c - you made me proud ;-) You all got the idea of Q1b but some points were deducted depending on the level of your description: (*) I deduced half a point for those that mentioned that the Mink sum of two disks is a disk but not stating that the new center is the Mink sum of the original disk's centers (*) I deduced a whole point if you just mentioned that the Mink sum of two disks is a disk (without talking about the radius or the center). (*) I deducted two points if you were very informal about your answers (e.g., stating that the Mink sum of two points is a point shifted in space). ++++++++++++++++++++ Wet part: ++++++++++++++++++++ (*) Some of you forgot to add a visualization of the test we provided for which I deduced 6 points. (*) Some of you forgot to add an extra instance of your own for which I deduced 6 points (*) Some of you gave no complexity analysis or no details on how you obtained the result for which I deduced 2 points / section (total 6 points) (*) If I ran your code on an instance and got wrong results I could not explain, I deduced 15 points (*) If I ran your code on an instance and got wrong results I could immediately explain (e.g., you forgot to add polygon edges as visibility edges), I deduced 5 points ++++++++++++++++++++ General: ++++++++++++++++++++ Late submissions got 4 points deduced. |
| עדכון אחרון ב-5/12/2022, 22:24:52 Last updated on 5/12/2022, 22:24:52 Последняя модификация5/12/2022, 22:24:52 تمت الحتلنة الأخيرة ب-5/12/2022, 22:24:52 |
HW2 published | |
|
HW2 published and is due 29.12. For any technical assistance (such as Python-related questions), please contact our TA Dean Zadok (udeanzadokatcampus.technion.ac.il) Good luck! Oren |
| פורסם ב-3/12/2022, 20:21:16 Created on 3/12/2022, 20:21:16 Создано3/12/2022, 20:21:16 تم النشر ب-3/12/2022, 20:21:16 |
HW1 - extension | |
|
I extended the due date of HW1 to Thuesday, Dec1st. Oren |
| פורסם ב-28/11/2022, 11:30:47 Created on 28/11/2022, 11:30:47 Создано28/11/2022, 11:30:47 تم النشر ب-28/11/2022, 11:30:47 |
HW1 published | |
|
HW1 published and is due 29.11. For any technical assistance (such as Python-related questions), please contact our TA Dean Zadok (udeanzadokatcampus.technion.ac.il) Good luck! Oren |
| פורסם ב-8/11/2022, 13:20:38 Created on 8/11/2022, 13:20:38 Создано8/11/2022, 13:20:38 تم النشر ب-8/11/2022, 13:20:38 |
All videos uploaded | |
|
Under course material you can find a list of all the videos that you will be asked to watch. Oren |
| פורסם ב-7/11/2022, 08:38:51 Created on 7/11/2022, 08:38:51 Создано7/11/2022, 08:38:51 تم النشر ب-7/11/2022, 08:38:51 |
Material for third class (Nov 13) | |
|
For the next class (third class, Nov 13), please watch the following two recordings: Lec 4 - https://youtu.be/Zr-Kacxd_z4 Lec 5 - https://youtu.be/KrfV-ZEPB2g The slides are under "course material / /lectures". In addition, a proof that I typically cover on the board can be found in the same folder. Oren |
| פורסם ב-7/11/2022, 08:11:49 Created on 7/11/2022, 08:11:49 Создано7/11/2022, 08:11:49 تم النشر ب-7/11/2022, 08:11:49 |
Video link for Lec 1 | |
|
For those interested, the first recorded lecture can be found in the following link: https://youtu.be/F5iuAqc7EVE Enjoy |
| פורסם ב-31/10/2022, 16:34:44 Created on 31/10/2022, 16:34:44 Создано31/10/2022, 16:34:44 تم النشر ب-31/10/2022, 16:34:44 |
Slides from yesterdays lecture uploaded to "course material/lectures" |
| עדכון אחרון ב-31/10/2022, 09:02:33 Last updated on 31/10/2022, 09:02:33 Последняя модификация31/10/2022, 09:02:33 تمت الحتلنة الأخيرة ب-31/10/2022, 09:02:33 |
Material for second class (Nov 6) | |
|
For the next class (second class, Nov 6), please watch the following two recordings: Lec 2 - https://youtu.be/auH6mMDHiUo Lec 3 - https://youtu.be/aiz15rJcUw8 The slides are under "course material / /lectures". In addition, proofs that I typically cover on the board can be found in the same folder. Oren |
| עדכון אחרון ב-31/10/2022, 09:02:50 Last updated on 31/10/2022, 09:02:50 Последняя модификация31/10/2022, 09:02:50 تمت الحتلنة الأخيرة ب-31/10/2022, 09:02:50 |
Anonymous comments / feedback / suggestions for flipped classroom form | |
|
Hi guys, I opened a gogle doc (https://docs.google.com/document/d/1MXcbWasPihn20bOsI73dV6D-QwS4Idnni89xpQoAQ3s/edit?usp=sharing) where you can give any comments on the flipped classroom. Please be constructive and respectful. Oren |
| פורסם ב-31/10/2022, 08:51:27 Created on 31/10/2022, 08:51:27 Создано31/10/2022, 08:51:27 تم النشر ب-31/10/2022, 08:51:27 |