任务(项目管理)
计算机科学
机器人
树(集合论)
自动机
线性时序逻辑
理论计算机科学
人工智能
数学
工程类
数学分析
系统工程
作者
Lin Li,Ziyang Chen,Hao Wang,Zhen Kan
标识
DOI:10.1109/lra.2023.3290531
摘要
This work develops a fast task allocation framework for heterogeneous multi-robot systems subject to both temporal logic and inter-task constraints. The considered inter-task constraints include unrelated tasks, compatible tasks, and exclusive tasks. To specify such inter-task relationships, we extend conventional atomic proposition to batch atomic propositions, which gives rise to the LTL$^{\mathcal {T}}$formula. The Task Batch Planning Decision Tree (TB-PDT) is then developed, which is a variant of conventional decision tree specialized for temporal logic and inter-task constraints. The TB-PDT is built incrementally to represent the task progress and does not require sophisticated product automaton, which significantly reduces the search space. Based on TB-PDT, the search algorithm, namely Intensive Inter-task Relationship Tree Search (IIRTS), is developed for the fast task allocation of heterogeneous multi-robot systems. It is shown that the solution time of finding a satisfactory task allocation grows almost quadratically with the number of automaton states. Extensive simulation and experiment demonstrate the validity, the effectiveness, and the transferability of IIRTS.
科研通智能强力驱动
Strongly Powered by AbleSci AI