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

Ng Fa Ho*, Wen Xiong Liao

*此作品的通信作者

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

1 引文 斯高帕斯(Scopus)

摘要

This paper presents a novel solution to a motion planning problem of heterogeneous combinatorial point robots in a time-varying environment, involving some properties and an algorithm. These combinatorial point robots can be combined and separated freely during moving. The problem that is proven to be compliant to the principle of optimality in a time-varying environment can be solved using dynamic programming algorithms. Assume that y denotes the number of kinds of heterogeneous combinatorial point robots, ηf represents the maximum number of vertices of the time-varying graph, k denotes the number of steps, n denotes the total number of all robots, and cf denotes the number of fth kind of heterogeneous combinatorial point robots in the motion plan. The time complexity of this problem is proven to be O (Πf=1yηf2kn), where n = ∑f=1vcf.

原文英語
主出版物標題Proceedings of the IEEE International Conference on Automation and Logistics, ICAL 2007
頁面2988-2993
頁數6
DOIs
出版狀態已發佈 - 2007
對外發佈
事件2007 IEEE International Conference on Automation and Logistics, ICAL 2007 - Jinan, 中国
持續時間: 2007 8月 182007 8月 21

出版系列

名字Proceedings of the IEEE International Conference on Automation and Logistics, ICAL 2007

會議

會議2007 IEEE International Conference on Automation and Logistics, ICAL 2007
國家/地區中国
城市Jinan
期間2007/08/182007/08/21

ASJC Scopus subject areas

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

指紋

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

引用此