We describe the spatio-temporally constrained motion planning problem (stcmp) using the example of harvesting crop with multi-ple cooperative vehicles. The vehicles have to meet at rendezvous points observing time, location, orientation and velocities to interact. Due to vehicle constraints, the stcmp involves two combinatorial optimization problems that are restricting each other in space and time.