By Topic

Ensemble motion planning in trees

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
G. N. Frederickson ; Dept. of Comput. Sci., Purdue Univ., Lafayette, IN, USA ; D. J. Guan

The problem of transporting a set of objects between the vertices of a tree by a unit capacity vehicle that travels along the edges of the tree is considered. For the case in which any object can be dropped at intermediate vertices along its route and picked up later, the authors present algorithms for finding a minimum cost transportation that run in O(k+qn) time and in O(k+n log n) time, where n is the number of vertices in the tree, k is the number of objects to be moved, and q⩽min{k,n} is the number of nontrivial connected components in a related directed graph. In the case in which each object must be carried directly from its initial vertex to its destination, the problem is NP-hard. The authors present approximation algorithms that run in O(k +n) time with a performance ratio of 3/2 and in O(k+n log β(n,q)) time with performance ratio of 5/4

Published in:

Foundations of Computer Science, 1989., 30th Annual Symposium on

Date of Conference:

30 Oct-1 Nov 1989