Object Placement on Cluttered Surfaces: A Nested Local Search Approach

06/20/2019
by   Abdul Rahman Dabbour, et al.
3

For planning rearrangements of objects in a clutter, it is required to know the goal configuration of the objects. However, in real life scenarios, this information is not available most of the time. We introduce a novel method that computes a collision-free placement of objects on a cluttered surface, while minimizing the total number and amount of displacements of the existing moveable objects. Our method applies nested local searches that perform multi-objective optimizations guided by heuristics. Experimental evaluations demonstrate high computational efficiency and success rate of our method, as well as good quality of solutions.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset