Search papers, labs, and topics across Lattice.
O. Daube and O. Salzman are with the Faculty of Computer Science, Technion, Haifa, Israel. E-mail: {omer.daube, osalzman}@cs.technion.ac.il
1
0
2
Nested branch-and-bound search slashes computation time by up to two orders of magnitude for robots collaborating on timed missions with spatial constraints.