Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
