Motion planning algorithm for heterogeneous combinatorial robots

被引：0
作者：
Ho, Hong-Fa [1 ]
Ja, Jui-Chun [1 ]
Liao, Wen-Xiong [1 ]
机构：
[1] Natl Taiwan Normal Univ, Dept Ind Educ, Taipei, Taiwan
来源：
2007 INTERNATIONAL CONFERENCE ON CONTROL, AUTOMATION AND SYSTEMS, VOLS 1-6 | 2007年
关键词：
motion planning; heterogeneous combinatorial robots; algorithm;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Some properties and an algorithm of motion planning problem of heterogeneous combinatorial point robots are presented. Heterogeneous combinatorial point robots can be combined and separated freely during moving. It is proven that the problem in a static discrete environment is compliant to the principle of optimality. Dynamic programming algorithms are used to solve this problem. The superposition property of the problem is presented. The time complexity of this problem is O(vertical bar qV vertical bar(2k n Sigma)(C)(n)(t=1)(i)). The motion planning problem of homogeneous combinatorial point robots is a special case of that of heterogeneous ones. A probabilistic roadmap method is used in the experiments and it finds feasible motion plans efficiently.
引用
收藏
页码：2907 / 2912
页数：6
相关论文
共 24 条
[1]   Finding topology in a factory: Configuration spaces [J].
Abrams, A ;
Ghrist, R .
AMERICAN MATHEMATICAL MONTHLY, 2002, 109 (02) :140-150
[2]  
Amato NM, 1998, IEEE INT CONF ROBOT, P630, DOI 10.1109/ROBOT.1998.677043
[3]  
Amato NM, 1996, IEEE INT CONF ROBOT, P113, DOI 10.1109/ROBOT.1996.503582
[4]  
[Anonymous], ACM COMPUT SURV
[5]  
Avnaim F., 1988, Proceedings of the 1988 IEEE International Conference on Robotics and Automation (Cat. No.88CH2555-1), P1656, DOI 10.1109/ROBOT.1988.12304
[6]   SOLVING THE FIND-PATH PROBLEM BY GOOD REPRESENTATION OF FREE SPACE [J].
BROOKS, RA .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1983, 13 (02) :190-197
[7]  
CORTES J, 2003, THESIS I NATL POLYTE
[8]   A SEARCH ALGORITHM FOR MOTION PLANNING WITH 6-DEGREES OF FREEDOM [J].
DONALD, BR .
ARTIFICIAL INTELLIGENCE, 1987, 31 (03) :295-353
[9]  
HO HF, 2006, P CACS INT C AUT CON
[10]  
HO HF, 2006, P CACS AUT CONTR C S, P10
123