A polynomial-time algorithm to design push plans for sensorless parts sorting

M. Berg, de, X. Goaoc, A.F. van der Stappen

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

We consider the efficient computation of sequences of push actions that simultaneously orient two different polygons. Our motivation for studying this problem comes from the observation that appropriately oriented parts admit simple sensorless sorting. We study the sorting of two polygonal parts by first putting them in properly selected orientations. We give an O(n2 log n)-time algorithm to enumerate all pairs of orientations for the two parts that can be realized by a sequence of push actions and admit sensorless sorting. We then propose an O(n4 log2 n)-time algorithm for finding the shortest sequence of push actions establishing a given realizable pair of orientations for the two parts. These results generalize to the sorting of k polygonal parts.
Original languageEnglish
Title of host publicationProceedings of Robotics: Science and Systems (Cambridge MA, USA, June 8-11, 2005), Online
Place of PublicationCambridge MA, USA
PublisherMIT
Pages1-7
Publication statusPublished - 2005

Fingerprint

Dive into the research topics of 'A polynomial-time algorithm to design push plans for sensorless parts sorting'. Together they form a unique fingerprint.

Cite this