By Topic

Motion Planning Algorithm for Homogeneous Combinatorial Robots in Time-Varying Environment

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)
Hong-Fa Ho ; Department of Industrial Education and Institute of Applied Electronic Technology, National Taiwan Normal University, Taipei, Taiwan, 106, R.O.C. e-mail: ; Wen-Cheng Liu

This paper introduces the concept of homogeneous combinatorial robots, specifying their properties and algorithms needed to solve the problems in motion-planning. In this paper, "homogeneous combinatorial robots" are a set of robots that can be combined and separated freely in motion. The complexity and obstacles of motion planning are explained in terms of the principle of optimality. To plan the optimal paths in time-varying environment for those robots, a dynamic programming algorithm is developed and proposed in the paper. Suppose eta is the maximum number of vertices of the time-varying graph, n is the number of robots, and k is the number of steps of the motion plan. The time complexity of this problem is O(eta2nk ).

Published in:

2007 IEEE 22nd International Symposium on Intelligent Control

Date of Conference:

1-3 Oct. 2007