Abstract
We consider the problem of collective exploration of a known n-node edge-weighted graph by k mobile agents that have limited energy but are capable of energy transfers. The agents are initially placed at an arbitrary subset of nodes in the graph, and each agent has an initial, possibly different, amount of energy. The goal of the exploration problem is for every edge in the graph to be traversed by at least one agent. The amount of energy used by an agent to travel distance x is proportional to x. In our model, the agents can share energy when co-located: when two agents meet, one can transfer part of its energy to the other.
For an n-node path, we give an \(O(n+k)\) time algorithm that either finds an exploration strategy, or reports that one does not exist. For an n-node tree with \(\ell \) leaves, we give an \(O(n+ \ell k^2)\) algorithm that finds an exploration strategy if one exists. Finally, for the general graph case, we show that the problem of deciding if exploration is possible by energy-sharing agents is NP-hard, even for 3-regular graphs. In addition, we show that it is always possible to find an exploration strategy if the total energy of the agents is at least twice the total weight of the edges; moreover, this is asymptotically optimal.
Research supported in part by NSERC grants.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Albers, S., Henzinger, M.R.: Exploring unknown environments. SIAM J. Comput. 29(4), 1164–1188 (2000)
Albers, S., Kursawe, K., Schuierer, S.: Exploring unknown environments with obstacles. Algorithmica 32(1), 123–143 (2002). https://doi.org/10.1007/s00453-001-0067-x
Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Springer, Boston (2003). https://doi.org/10.1007/b100809
Baeza Yates, R., Culberson, J., Rawlins, G.: Searching in the plane. Inf. Comput. 106(2), 234–252 (1993)
Baeza-Yates, R., Schott, R.: Parallel searching in the plane. Comput. Geom. 5(3), 143–154 (1995)
Bampas, E., Das, S., Dereniowski, D., Karousatou, C.: Collaborative delivery by energy-sharing low-power mobile robots. In: Fernández Anta, A., Jurdzinski, T., Mosteiro, M.A., Zhang, Y. (eds.) ALGOSENSORS 2017. LNCS, vol. 10718, pp. 1–12. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-72751-6_1
Bärtschi, A.: Efficient delivery with mobile agents. Ph.D. thesis, ETH Zurich (2017)
Beck, A.: On the linear search problem. Israel J. Math. 2(4), 221–228 (1964). https://doi.org/10.1007/BF02759737
Burgard, W., Moors, M., Stachniss, C., Schneider, F.E.: Coordinated multi-robot exploration. IEEE Trans. Robot. 21(3), 376–386 (2005)
Chalopin, J., Das, S., Kosowski, A.: Constructing a map of an anonymous graph: applications of universal sequences. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol. 6490, pp. 119–134. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-17653-1_10
Chalopin, J., Jacob, R., Mihalák, M., Widmayer, P.: Data delivery by energy-constrained mobile agents on a line. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8573, pp. 423–434. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-43951-7_36
Czyzowicz, J., Diks, K., Moussi, J., Rytter, W.: Communication problems for mobile agents exchanging energy. In: Suomela, J. (ed.) SIROCCO 2016. LNCS, vol. 9988, pp. 275–288. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-48314-6_18
Czyzowicz, J., Diks, K., Moussi, J., Rytter, W.: Broadcast with energy-exchanging mobile agents distributed on a tree. In: Lotker, Z., Patt-Shamir, B. (eds.) SIROCCO 2018. LNCS, vol. 11085, pp. 209–225. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-01325-7_20
Czyzowicz, J., Diks, K., Moussi, J., Rytter, W.: Energy-optimal broadcast and exploration in a tree using mobile agents. Theor. Comput. Sci. 795, 362–374 (2019)
Czyzowicz, J., et al.: Graph exploration by energy-sharing mobile agents. arxiv.org/pdf/2102.13062 (2021)
Czyzowicz, J., et al.: Energy consumption of group search on a line. In: Proceedings of ICALP, pp. 137:1–137:15 (2019)
Deng, X., Kameda, T., Papadimitriou, C.: How to learn an unknown environment. In: Proceedings of FOCS, pp. 298–303. IEEE Computer Society (1991)
Deng, X., Papadimitriou, C.H.: Exploring an unknown graph. J. Graph Theory 32(3), 265–297 (1999)
Dereniowski, D., Disser, Y., Kosowski, A., Pajak, D., Uznański, P.: Fast collaborative graph exploration. Inf. Comput. 243, 37–49 (2015)
Dynia, M., Łopuszański, J., Schindelhauer, C.: Why robots need maps. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol. 4474, pp. 41–50. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-72951-8_5
Fraigniaud, P., Gasieniec, L., Kowalski, D.R., Pelc, A.: Collective tree exploration. Netw. Int. J. 48(3), 166–177 (2006)
Kleinberg, J.M.: On-line search in a simple polygon. In: Proceedings of SODA, pp. 8–15 (1994)
Koutsoupias, E., Papadimitriou, C., Yannakakis, M.: Searching a fixed graph. In: Meyer, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 280–289. Springer, Heidelberg (1996). https://doi.org/10.1007/3-540-61440-0_135
Kwan, M.-K.: Graphic programming using odd or even points. Acta Math. Sin. 10, 263–266 (1960). MR 0162630. Translated in Chinese Mathematics 1, 273–277 (1962)
Lovász, L.: Combinatorial Problems and Exercises. Elsevier, Amsterdam (1979)
Moussi, J.: Data communication problems using mobile agents exchanging energy. Ph.D. thesis, Université du Québec en Outaouais (2018)
Panaite, P., Pelc, A.: Exploring unknown undirected graphs. J. Algorithms 33(2), 281–295 (1999)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Czyzowicz, J. et al. (2021). Graph Exploration by Energy-Sharing Mobile Agents. In: Jurdziński, T., Schmid, S. (eds) Structural Information and Communication Complexity. SIROCCO 2021. Lecture Notes in Computer Science(), vol 12810. Springer, Cham. https://doi.org/10.1007/978-3-030-79527-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-030-79527-6_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-79526-9
Online ISBN: 978-3-030-79527-6
eBook Packages: Computer ScienceComputer Science (R0)