首页 /研究 /HTN-based multi-robot path planning
SWARM

HTN-based multi-robot path planning

Suying Zeng, Yuancheng Zhu, Chao Qi

发表年份
2016
引用次数
7

摘要

In this paper, Hierarchical Task Network (HTN) method is applied to multi-robot path planning. A conflict resolution mechanism and time constraint method are also proposed for searching an optimal or approximate optimal collision-free path from start state to target state. Experiment indicates that HTN planning can manage the conflict situations and time constrains well, and provides more optimal route comparing with the traditional A* algorithm.

关键词

Motion planningConstraint (computer-aided design)Path (computing)Computer scienceRobotTask (project management)State (computer science)Mathematical optimizationTime constraintCollision avoidance

相关论文

查看 SWARM 分类全部论文