动态调整操作序列的多机器人无碰运动规划

doi:10.13973/j.cnki.robot.2016.0651

摘要
图/表
参考文献
相关文章 (15)

全文: PDF (753 KB) HTML ( ) 输出: BibTeX \| EndNote (RIS)
引用本文:
吴鸿敏, 苏满佳, 管贻生, 陈新. 动态调整操作序列的多机器人无碰运动规划[J]. 机器人, 2016, 38(6): 651-658.DOI: 10.13973/j.cnki.robot.2016.0651. WU Hongmin, SU Manjia, GUAN Yisheng, CHEN Xin. Collision-free Motion Planning for Multiple Robots Using Dynamic Modification of Operating Sequence. ROBOT, 2016, 38(6): 651-658. DOI: 10.13973/j.cnki.robot.2016.0651.

摘要针对共享工作空间的多台机器人，提出了一种协调无碰运动规划方法．作为离线规划的解耦法，该方法主要分为2个阶段．第1阶段，根据任务需求在不考虑机器人间相互冲突的情况下，通过概率路径地图（PRM）法规划出各机器人与静态环境的无碰路径；第2阶段，把机器人的路径描述成连续的位形序列后构造系统的状态空间，形象地把所需解决的问题转换成高维状态空间中的连续路径搜索问题．在此基础上，提出了多机器人的避碰策略、运动序列优先级的动态调整方法和改进的A^*算法，实现了多机器人系统无碰协调运动规划．通过2个仿真案例验证了该方法的可行性及有效性．结果表明，所提方法能快速、有效地得到多机器人协调无碰运动路径．

	服务

	把本文推荐给朋友
	加入我的书架
	加入引用管理器
	E-mail Alert
	RSS
	作者相关文章
	吴鸿敏
	苏满佳
	管贻生
	陈新

关键词 ：多机器人, 运动规划, 位形空间, 概率路径地图, A^*算法

Abstract：A collision-free, coordinated motion planning is presented for multiple robots in a shared workspace. The proposed method consists of two phases. In the first phase, a collision-free path with respect to stationary obstacles for each robot is planned according to task requirements without considering the conflicts among the robots by employing the probabilistic roadmap (PRM) method. In the second phase, the robot path is described by continuous configuration sequences, the state space of the whole system is constructed, and the investigated problem is transformed into a continuous path search problem in a high dimensional state space. On this basis, a collision-avoidance strategy for multiple robots, a dynamic modification method of motion sequence priorities, and an improved A^* algorithm are proposed, and collision-free, coordinated motion planning for multiple robots are implemented. The feasibility and effectiveness of the proposed approach are demonstrated with 2 simulation cases. The results show that the proposed method can rapidly, effectively obtain the coordinated collision-free paths for multiple robots.

Key words： multiple robots motion planning configuration space probabilistic roadmap A^* algorithm

收稿日期: 2016-08-29 录用日期: 2016-11-30

TP242

基金资助:广东省自然科学基金重点项目（S2013020012797）；国家基金委-广东省联合基金重点项目（U1401240）；国家自然科学基金（51375095）；国际科技合作专项（2015DFA11700）；广东省前沿与关键技术创新专项（2014B090919002，2015B010917003，2016B090911002，2015B090922003）

通讯作者: 管贻生，ysguan@gdut.edu.cn E-mail: ysguan@gdut.edu.cn

作者简介: 吴鸿敏（1991-），男，博士生．研究领域：多机器人协调无碰运动规划．
苏满佳（1988-），男，博士生．研究领域：仿生柔体机器人．
管贻生（1966-），男，博士，教授．研究领域：仿生机器人，模块化机器人，智能制造与自动化

链接本文:

https://robot.sia.cn/CN/10.13973/j.cnki.robot.2016.0651 或 https://robot.sia.cn/CN/Y2016/V38/I6/651

[1] LaValle S M, Kuffner J J. Randomized kinodynamic planning[J]. International Journal of Robotics Research, 2001, 20(5): 378-400.
[2] Jaillet L, Cortes J, Simeon T. Sampling-based path planning on configuration-space costmaps[J]. IEEE Transactions on Robotics, 2010, 26(4): 635-646.
[3] Xie B Y, Zhuo J, Liu Y. Motion planning of reaching point movements for 7R robotic manipulators in obstacle environment based on rapidly-exploring random tree algorithm[J]. Journal of Mechanical Engineering, 2012, 48(3): 63-69.
[4] Erdmann M, Lozano-Perez T. On multiple moving objects[J]. Algorithmica, 1987, 2(4): 477-521.
[5] Kant K, Zucker S W. Toward efficient trajectory planning: The path-velocity decomposition[J]. International Journal of Robotics Research, 1986, 5(3): 72-89.
[6] Chiddarwar S S, Babu N R. Offline decoupled path planning approach for effective coordination of multiple robots[J]. Robotica, 2009, 28(4): 477-491.
[7] Chiddarwar S S, Babu N R. Conflict free coordinated path planning for multiple robots using a dynamic path modification sequence[J]. Robotics and Autonomous Systems, 2011, 59(7/8): 508-518.
[8] O'Donnell P A, Lozano-Perez T. Deadlock-free and collision-free coordination of two robot manipulators[C]//IEEE International Conference on Robotics and Automation. Piscataway, USA: IEEE, 1989: 484-489.
[9] Cheng X. On-line collision-free path planning for service and assembly tasks by a two-arm robot[C]//IEEE International Conference on Robotics and Automation. Piscataway, USA: IEEE, 1995: 1523-1528.
[10] Li T Y, Latombe J C. On-line manipulation planning for two robot arms in a dynamic environment[J]. International Journal of Robotics Research, 1997, 16(2): 144-167.
[11] Liu C L, Zhang K, Lee J. Research on collision algorithm for dual-robot under coordinative operation and simulation[J]. Robot, 2003, 25(2): 167-171.
[12] Li P, Meng Q X, Wang L Q. Analysis of collision for loosely coordinated two-robot system[J]. China Mechanical Engineering, 2005, 16(13): 1150-1153.
[13] Flordal H, Fabian M, Akesson K, et al. Automatic model generation and PLC-code implementation for interlocking policies in industrial robot cells[J]. Control Engineering Practice, 2007, 15(11): 1416-1426.
[14] Spensieri D, Carlson J S, Ekstedt F, et al. An iterative approach for collision free routing and scheduling in multirobot stations[J]. IEEE Transactions on Automation Science and Engineering, 2016, 13(2): 950-962.
[15] Qadeer U, Sualeh M. Automatic coordination and collision avoidance using sequence planning and process simulate[D]. Gothenburg, Sweden: Chalmers University of Technology, 2011.
[16] Bengtsson K, Bergagard P, Thorstensson C, et al. Sequence planning using multiple and coordinated sequences of operations[J]. IEEE Transactions on Automation Science and Engineering, 2012, 9(2): 308-319.
[17] Kannan A, Gupta P, Tiwari R, et al. Robot motion planning using adaptive hybrid sampling in probabilistic roadmaps[J]. Electronics, 2016, 5(2): No.16.
[18] Sanchez G, Latombe J C. On delaying collision checking in PRM planning: Application to multi-robot coordination[J]. International Journal of Robotics Research, 2002, 21(1): 5-26.
[19] GAMMA Group at the University of North Carolina. Proximity Query Packages[EB/OL].[2016-08-25]. http://gamma.cs.unc.edu/SSV/.