Optimal and Conforming Motion of a Point in a Constrained Plane

[+] Author and Article Information
C. Ahrikencheikh, A. A. Seireg

Mechanical Engineering Department, University of Wisconsin-Madison, Madison, WI 53706

B. Ravani

Computer Integrated Design and Manufacturing Laboratory, Department of Mechanical Engineering, University of California-Davis, Davis, CA 95616

J. Mech. Des 116(2), 474-479 (Jun 01, 1994) (6 pages) doi:10.1115/1.2919403 History: Received March 01, 1990; Online June 02, 2008


This paper deals with automatic generation of the motion of a point under both geometric and kinematic constraints. Optimal point paths are generated which are not only free of collisions with polygonal obstacles representing geometric constraints but also conform to kinematic constraints such as limits on velocity and acceleration. A specified minimum clearance from the boundaries of the obstacles is also satisfied. The new computational tools employed are an efficient representation of the free space, and a new motion generation algorithm with a computational time complexity of only O(n3 log n), where n is the total number of obstacle vertices. The algorithm finds the shortest or fastest curved path that also conforms with preset constraints on the motion of the point.

Copyright © 1994 by The American Society of Mechanical Engineers
Topics: Motion
Your Session has timed out. Please sign back in to continue.





Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In