@inproceedings{6757be69d1a1407f901893ac15d3493d,
title = "Estimating the minimum number of robots to finish given multi-objects task",
abstract = "In this paper, we propose a method that could solve the problem of estimating the minimum number of robots to finish the given multi-objects task. The criterion of estimating the robots includes the time consumption of motion on the trajectory and the work on the multi-objects. Our proposed method builds the roadmap to compute the cost of motion between objects and then builds the network with the motion and work cost. To satisfy the specified efficiency, the optimization algorithm of network is used to compute the minimum number of robots which can finish the task. An implementation example is presented and possible further research directions are presented as well.",
keywords = "Bipartite Graph, Efficiency, Lower Bound, Network",
author = "Ji Guo and Bo Gao and Rongxin Cui and Ge, \{Shuzhi Sam\}",
year = "2011",
doi = "10.1109/ICCIS.2011.6070322",
language = "英语",
isbn = "9781612841984",
series = "Proceedings of the 2011 IEEE 5th International Conference on Cybernetics and Intelligent Systems, CIS 2011",
pages = "170--174",
booktitle = "Proceedings of the 2011 IEEE 5th International Conference on Cybernetics and Intelligent Systems, CIS 2011",
note = "2011 IEEE 5th International Conference on Cybernetics and Intelligent Systems, CIS 2011 ; Conference date: 17-09-2011 Through 19-09-2011",
}