D2CoPlan: A Differentiable Decentralized Planner for Multi-Robot Coverage

被引:1
作者
Sharma, Vishnu Dutt [1 ]
Zhou, Lifeng [2 ]
Tokekar, Pratap [1 ]
机构
[1] Univ Maryland, Dept Comp Sci, College Pk, MD 20742 USA
[2] Drexel Univ, Dept Elect & Comp Engn, Philadelphia, PA 19104 USA
来源
2023 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, ICRA | 2023年
基金
美国国家科学基金会;
关键词
GRAPH; NETWORKS;
D O I
10.1109/ICRA48891.2023.10160341
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Centralized approaches for multi-robot coverage planning problems suffer from the lack of scalability. Learning-based distributed algorithms provide a scalable avenue in addition to bringing data-oriented feature generation capabilities to the table, allowing integration with other learningbased approaches. To this end, we present a learning-based, differentiable distributed coverage planner (D2COPLAN) which scales efficiently in runtime and number of agents compared to the expert algorithm, and performs on par with the classical distributed algorithm. In addition, we show that D2COPLAN can be seamlessly combined with other learning methods to learn end-to-end, resulting in a better solution than the individually trained modules, opening doors to further research for tasks that remain elusive with classical methods.
引用
收藏
页码:3425 / 3431
页数:7
相关论文
empty
未找到相关数据