A Study on Motion Planning Algorithm of Homogeneous Combinatorial Robots in Time-Varying Environment
| Autor: | Wen-Cheng Liu, 劉文正 |
|---|---|
| Rok vydání: | 2007 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 95 This paper is going to introduce the concept of homogeneous combinatorial robots and some properties and algorithms of their motion planning problem. There are three important concepts, As follows: First, The so-called “homogeneous combinatorial robots,” in this paper, are a set of robots that can be combined and separated freely in motion. Second, The motion planning problem of homogeneous combinatorial robots in a discrete environment is compliant to the principle of optimality. Additionally, dynamic programming algorithm is used to solve this problem. Third, Suppose is the maximum number of vertices of the time-varying graph, n is the number of robots, and k is the number of step of the motion planning. The time complexity of this problem is. Motion Planning 、Homogeneous Combinatorial Robots 、Time-Varying Environment |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|