Let I be a 2-dimensional polygonal rigid object (with m edges) moving amidst polygonal obstacles E (with n edges) and let P init and P end be two free placements of I, where the interior of I does not intersect E. We investigate here the problem of finding a continuous motion of I from P init to P end , such that during this motion the interior of I does not intersect E, or to establish that no such motion exists. This problem is an instance of the well known ”Piano Movers' Problem”. We have shown in [2] that it is possible to compute an exact description of free space in time O(m 3 n 3log(mn)). We show in this paper that, using this description, a motion can be found in time O(m 3 n 3). The actual complexity of our algorithm inmany practical situations is much smaller. In particular, for the so called situation of local bounded complexity often encontered in robotics, the complexity of computing free space is O(nlogn) and the complexity of planning a motion is O(n). The method has been implemented and experimental results are discussed.