PRE2024 3 Group6: Difference between revisions
m added own student number |
mNo edit summary |
||
Line 12: | Line 12: | ||
paper 2: V. Mohanavel, C. Kailasanathan, T. Sathish, V. Kannadhasan, S. Vinoth Joe Marshal, K. Sakthivel, Modeling and fabrication of automatic blackboard dust remover, Materials Today: Proceedings, Volume 37, Part 2, 2021, Pages 527-530, ISSN 2214-7853, <nowiki>https://doi.org/10.1016/j.matpr.2020.05.487</nowiki>. | paper 2: V. Mohanavel, C. Kailasanathan, T. Sathish, V. Kannadhasan, S. Vinoth Joe Marshal, K. Sakthivel, Modeling and fabrication of automatic blackboard dust remover, Materials Today: Proceedings, Volume 37, Part 2, 2021, Pages 527-530, ISSN 2214-7853, <nowiki>https://doi.org/10.1016/j.matpr.2020.05.487</nowiki>. | ||
Geert: | |||
T. Kusnur and M. Likhachev, "Complete, Decomposition-Free Coverage Path Planning," ''2022 IEEE 18th International Conference on Automation Science and Engineering (CASE)'', Mexico City, Mexico, 2022, pp. 1431-1437, doi: 10.1109/CASE49997.2022.9926483. | |||
Could be used for finding the optimal cleaning path without being too computationally intensive. |
Revision as of 14:33, 13 February 2025
Dev, Geert Langhout - 1721704, Michiel Sweere - 1762435, Merlin, Haochen
https://docs.google.com/document/d/1pPDWfC-ANSb7UUsSuHuB8DjOFGSYxDZMXs8z4nUY1Wk/edit?usp=sharing
^shared document
PAPERS :
Michiel:
paper 1: Prashanth Pai Manihalla, Yathin Krishna, Nagaraja Anand Naik, Naveen Kumar, Rakshith, Rakshith Billava Ramappa; Design and fabrication of an electromechanical system to clean the blackboard. AIP Conf. Proc. 20 May 2020; 2236 (1): 050006. https://doi.org/10.1063/5.0007099
paper 2: V. Mohanavel, C. Kailasanathan, T. Sathish, V. Kannadhasan, S. Vinoth Joe Marshal, K. Sakthivel, Modeling and fabrication of automatic blackboard dust remover, Materials Today: Proceedings, Volume 37, Part 2, 2021, Pages 527-530, ISSN 2214-7853, https://doi.org/10.1016/j.matpr.2020.05.487.
Geert:
T. Kusnur and M. Likhachev, "Complete, Decomposition-Free Coverage Path Planning," 2022 IEEE 18th International Conference on Automation Science and Engineering (CASE), Mexico City, Mexico, 2022, pp. 1431-1437, doi: 10.1109/CASE49997.2022.9926483.
Could be used for finding the optimal cleaning path without being too computationally intensive.