Motion planning algorithm for homogeneous combinatorial robots in time-varying environment

Hong Fa Ho*, Wen Cheng Liu

*此作品的通信作者

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

1 引文 斯高帕斯(Scopus)

摘要

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 η 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(η2nk).

原文英語
主出版物標題22nd IEEE International Symposium on Intelligent Control, ISIC 2007. Part of IEEE Multi-conference on Systems and Control
發行者IEEE Computer Society
頁面77-82
頁數6
ISBN(列印)142440441X, 9781424404414
DOIs
出版狀態已發佈 - 2007
事件2007 IEEE 22nd International Symposium on Intelligent Control, ISIC 2007 - Singapore, 新加坡
持續時間: 2007 十月 12007 十月 3

出版系列

名字22nd IEEE International Symposium on Intelligent Control, ISIC 2007. Part of IEEE Multi-conference on Systems and Control

會議

會議2007 IEEE 22nd International Symposium on Intelligent Control, ISIC 2007
國家/地區新加坡
城市Singapore
期間2007/10/012007/10/03

ASJC Scopus subject areas

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

指紋

深入研究「Motion planning algorithm for homogeneous combinatorial robots in time-varying environment」主題。共同形成了獨特的指紋。

引用此