Efficient method for generating pick-and-place trajectory over obstacles

  • James J. Potter
  • , Khalid L. Sorensen
  • , William E. Singhose

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

Abstract

This paper presents a method to compute a two-dimensional pick-and-place trajectory over an arbitrary number of obstacles. The method is computationally simple, making it well-suited for implementation on machines that must generate solutions in real time. The method finds a minimum trajectory height that yields a collision-free planar trajectory with minimum duration. The method employs a user-specified program to convert desired travel distances into velocity profiles. Two example programs are given. Velocity profile schemes can be designed to address trajectory objectives, such as in-plane time optimality, or vibration reduction. An industrial case study is presented.

Original languageEnglish
Title of host publicationProceedings of the IASTED International Conference on Robotics and Applications, RA 2010
Pages276-283
Number of pages8
DOIs
StatePublished - 2010
EventIASTED International Conference on Robotics and Applications, RA 2010 - Cambridge, MA, United States
Duration: Nov 1 2010Nov 3 2010

Publication series

NameProceedings of the IASTED International Conference on Robotics and Applications
ISSN (Print)1027-264X

Conference

ConferenceIASTED International Conference on Robotics and Applications, RA 2010
Country/TerritoryUnited States
CityCambridge, MA
Period11/1/1011/3/10

Keywords

  • Manufacturing automation
  • Motion planning

Fingerprint

Dive into the research topics of 'Efficient method for generating pick-and-place trajectory over obstacles'. Together they form a unique fingerprint.

Cite this