Leírás
Abstract:
We discuss an open problem from path planning (also n the hope to get
some fresh ideas): A number of equidistant points are located on a line
segment. Every point must be perpetually visited by some ``robot'',
always within some prescribed individual waiting time. Specifically, two
robots can share this task. They can move at unit speed on the line, and
it is not important which robot visits which point. Even though the
setting appears simple, the problem appears to be surprisingly deep. Its
computational complexity is open. We provide some background and then
informally report ongoing work on practical solution heuristics.
Here is the zoom link (for the whole semester). If a password is needed, it is 074746
https://zoom.us/j/93881000227?pwd=N1RKNFh6SkIzZmRqY3J3cWJPSm0yUT09