Configuration Space of Moving Object

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Configuration space methods are commonly used in motion planning algorithms. Algorithms for defining the configuration space of moving objects use Minkowski sum, but it is applicable only for convex objects. If the obstacle is non-convex, triangle subdivision to convex objects must be performed. This complicates the algorithms for object movement planning. In the present paper is presented an algorithm for defining configuration space which is applicable for non-convex objects.

Author(s): Yankov K.,

Language: English
Commentary: 1552727
Tags: Автоматизация;Робототехнические системы (РТС);Промышленная робототехника