Strategies for coordinated multirobot exploration with recurrent connectivity constraints
During several applications, such as search and rescue, robots must discover new information about the environment and, at the same time, share operational knowledge with a base station through an ad hoc network. In this paper, we design exploration strategies that allow robots to coordinate with teammates to form such a network in order to satisfy recurrent connectivity constraints—that is, data must be shared with the base station when making new observations at the assigned locations. Current approaches lack in flexibility due to the assumptions made about the communication model. Furthermore, they are sometimes inefficient because of the synchronous way they work: new plans are issued only once all robots have reached their goals. This paper introduces two novel asynchronous strategies that work with arbitrary communication models. In this paper, ‘asynchronous’ means that it is possible to issue new plans to subgroups of robots, when they are ready to receive them. First, we propose a single-stage strategy based on Integer Linear Programming for selecting and assigning robots to locations. Second, we design a two-stage strategy to improve computational efficiency, by separating the problem of locations’ selection from that of robot-location assignments. Extensive testing both in simulation and with real robots show that the proposed strategies provide good situation awareness at the base station while efficiently exploring the environment.
KeywordsMultirobot systems Exploration Communication constraints Recurrent connectivity
- Álvarez-Miranda, E., Ljubić, I., & Mutzel, P. (2013). The rooted maximum node-weight connected subgraph problem. In Proceedings of CPAIOR (pp. 300–315). Springer.Google Scholar
- Arkin, R., Diaz, J. (2002). Line-of-sight constrained exploration for reactive multiagent robotic teams. In Proceedings of AMC, (pp. 455–461).Google Scholar
- Banfi, J., Quattrini, Li, A., Basilico, N., Amigoni, F. (2015). Communication-constrained multirobot exploration: Short taxonomy and comparative results. In IROS Workshop on On-line decision-making in multi-robot coordination.Google Scholar
- Banfi, J., Quattrini Li, A., Basilico, N., Amigoni, F., Rekleitis, I. (2016). Asynchronous multirobot exploration under recurrent connectivity constraints. In Proceedings of ICRA, pp. 5491–5498.Google Scholar
- Banfi, J., Quattrini Li, A., Basilico, N., Amigoni, F., Rekleitis, I. (2017). Multirobot online construction of communication maps. In Proceedings of ICRA, pp. 2577–2583.Google Scholar
- Burkard, R., Dell’Amico, M., & Martello, S. (2009). Assignment problems (pp. 79–87). Society for Industrial and Applied Mathematics.Google Scholar
- Clausen, T., & Jacquet, P. (2003). Optimized link state routing protocol (OLSR) (p. 3626). RFC: Technical Report.Google Scholar
- Garey, M., & Johnson, D. (1979). Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman.Google Scholar
- Gurobi (2015). Gurobi optimizer reference manual. http://www.gurobi.com.
- Hochbaum, D., Pathria, A. (1994). Node-optimal connected k-subgraphs. Manuscript, UC Berkeley, 1994. http://goo.gl/QoB8IB.
- de Hoog, J., Cameron, S., Visser, A. (2009). Role-based autonomous multi-robot exploration. In Proceedings of COGNITIVE, pp. 482–487.Google Scholar
- Howard, A., Roy, N. (2003). The robotics data set repository (Radish). http://radish.sourceforge.net/.
- Jensen, EA., Lowmanstone, L., Gini, M. (2016). Communication-restricted exploration for search teams. In Proceedings of DARS, (to appear).Google Scholar
- Kimelfeld, B., Sagiv, Y. (2006). New algorithms for computing Steiner trees for a fixed number of terminals. http://researcher.ibm.com/researcher/files/us-kimelfeld/papers-steiner06.pdf
- Mukhija, P., Krishna, K., & Krishna, V. (2010). A two phase recursive tree propagation based multi-robotic exploration framework with fixed base station constraint. In Proceedings of IROS, pp. 4806–4811.Google Scholar
- O’Kane, J.M. (2013). A Gentle Introduction to ROS. Independently published, available at http://www.cse.sc.edu/~jokane/agitr/.
- Quigley, M., Gerkey, B., Conley, K., Faust, J., Foote, T., Leibs, J., Berger, E., Wheeler, R., & Ng, A. (2009). ROS: an open-source robot operating system. In ICRA Workshop on Open Source Software.Google Scholar
- Rekleitis, I .(2013). Multi-robot simultaneous localization and uncertainty reduction on maps (MR-SLURM). In Proceedings of ROBIO, pp .1216–1221.Google Scholar
- Simmons, R. G., Apfelbaum, D., Burgard, W., Fox ,D., Moors, M., Thrun, S., & Younes, H. L. S .(2000). Coordination for multi-robot exploration and mapping. In Proceedings of AAAI, pp. 852–858.Google Scholar
- Spirin, V., Cameron. S., & de Hoog, J. (2013). Time preference for information in multiagent exploration with limited communication. In Proceedings of TAROS, pp. 34–45.Google Scholar
- Stump, E., Michal, N., Kumar, V., & Isler, V. (2011). Visibility-based deployment of robot formations for communication maintenance. In Proceedings of ICRA, pp. 4498–4505.Google Scholar
- Tadokoro, S. (2010). Rescue Robotics. Springer.Google Scholar
- Thrun, S. (2002). Robotic mapping: A survey. In: Exploring Artificial Intelligence in the New Millenium, Morgan Kaufmann, pp. 1–35.Google Scholar
- Thrun, S., Burgard, W., & Fox, D. (2005). Probabilistic robotics. The MIT Press.Google Scholar
- Visser, A., & Slamet, B. (2008). Including communication success in the estimation of information gain for multi-robot exploration. In Proceedings of WiOpt, pp. 680–687.Google Scholar
- Wurm, K. M., Stachniss, C., & Burgard, W. (2008). Coordinated multi-robot exploration using a segmentation of the environment. In Proceedings of IROS, pp. 1160–1165.Google Scholar
- Yamauchi, B. (1998) Frontier-based exploration using multiple robots. In Proceedings of AGENTS, pp. 47–53.Google Scholar
- Zhang, Q., Whitney, D., Shkurti, F., & Rekleitis, I. (2014). Ear-based exploration on hybrid metric/topological maps. In Proceedings of IROS, pp 3081–3088.Google Scholar