Time complexity of motion planning algorithm for homogeneous combinatorial robots

Ng Fa Ho*, Hong Shuo Tai

*此作品的通信作者

研究成果: 書貢獻/報告類型會議論文篇章

3 引文 斯高帕斯(Scopus)

摘要

Some properties and an algorithm of the motion planning problem of homogeneous combinatorial robots are presented. Homogeneous combinatorial robots can be combined and separated freely in the process of moving. The motion planning problem of homogeneous combinatorial robots in a static discrete environment is proven to be compliant to the principle of optimality. A backward dynamic motion planning algorithm is used to find the optimal motion plans. Suppose that|V| is the number of all vertices in the graph, n is the number of robots, and k is the number of stages robots passing the graph. The time complexity without considering the limitation function of this problem is 0(|V|2nk). Furthermore, the time complexity with the limitation function of the problem is presented.

原文英語
主出版物標題2006 SICE-ICASE International Joint Conference
頁面4280-4284
頁數5
DOIs
出版狀態已發佈 - 2006
對外發佈
事件2006 SICE-ICASE International Joint Conference - Busan, 大韓民國
持續時間: 2006 10月 182006 10月 21

出版系列

名字2006 SICE-ICASE International Joint Conference

會議

會議2006 SICE-ICASE International Joint Conference
國家/地區大韓民國
城市Busan
期間2006/10/182006/10/21

ASJC Scopus subject areas

  • 電腦科學應用
  • 控制與系統工程
  • 電氣與電子工程

指紋

深入研究「Time complexity of motion planning algorithm for homogeneous combinatorial robots」主題。共同形成了獨特的指紋。

引用此