Robust Missions Planning
Internship / Scientific Programmer / Research Assistant | 2025-05-13About topic
Develop a novel algorithmic solutions/approach to find a robust plan for dynamic (and probabilistic) routing problems, such as robotic variants of the TSP or OP (TSP with profits)
Suitable for: Student(s) with interest in planning mobile robotics missions
Requirements: Python/C/C++/Julia/Rust and willingness to learn
Are you interested?
Contact faiglj@fel.cvut.cz!