Skip to main content
SpringerLink
Log in

Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots

  • Conference paper
  • First Online:
Algorithms for Sensor Systems (ALGOSENSORS 2017)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 10718))

Abstract

We study two variants of delivery problems for mobile robots sharing energy. Each mobile robot can store at any given moment at most two units of energy, and whenever two robots are at the same location, they can transfer energy between each other, respecting the maximum capacity. The robots operate in a simple graph and initially each robot has two units of energy. A single edge traversal by an robot reduces its energy by one unit and the robot can only perform such move initially having at least one unit of energy. There are two distinguished nodes s and t in the graph and the goal for the robots is to deliver the package initially present on s to the node t. The package can be passed from one robot to another when they are colocated. In the first problem we study, the robots are initially placed at some given nodes of the graph and the question is whether the delivery is feasible. We prove that this problem is \(\mathsf {NP}\)-complete. In the second problem, the initial positions of the robots are not fixed but a subset of nodes H of the graph is given as input together with an integer k, and the question is as follows: is there a placement of k robots at nodes in H such that the delivery is possible? We prove that this problem can be solved in polynomial time.

Partially supported by National Science Centre (Poland) grant number 2015/17/B/ST6/01887 and the project ANR-ANCOR (anr-14-CE36-0002-01).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Anaya, J., Chalopin, J., Czyzowicz, J., Labourel, A., Pelc, A., Vaxès, Y.: Convergecast and broadcast by power-aware mobile agents. Algorithmica 74(1), 117–155 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  2. Awerbuch, B., Betke, M., Rivest, R.L., Singh, M.: Piecemeal graph exploration by a mobile robot. Inf. Comput. 152(2), 155–172 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bärtschi, A., Chalopin, J., Das, S., Disser, Y., Geissmann, B., Graf, D., Labourel, A., Mihalák, M.: Collaborative delivery with energy-constrained mobile robots. In: Suomela, J. (ed.) SIROCCO 2016. LNCS, vol. 9988, pp. 258–274. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-48314-6_17

    Chapter  Google Scholar 

  4. Bärtschi, A., Chalopin, J., Das, S., Disser, Y., Graf, D., Hackfeld, J., Penna, P.: Energy-efficient delivery by heterogeneous mobile agents. In: Vollmer, H., Vallée, B. (eds.) 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017. LIPIcs, 8–11 March 2017, Hannover, Germany, vol. 66, pp. 10:1–10:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)

    Google Scholar 

  5. Bärtschi, A., Graf, D., Penna, P.: Truthful mechanisms for delivery with mobile agents. CoRR abs/1702.07665 (2017)

    Google Scholar 

  6. Betke, M., Rivest, R.L., Singh, M.: Piecemeal learning of an unknown environment. Mach. Learn. 18(2), 231–254 (1995)

    Google Scholar 

  7. Biló, D., Disser, Y., Gualá, L., Mihal’ák, M., Proietti, G., Widmayer, P.: Polygon-constrained motion planning problems. In: Flocchini, P., Gao, J., Kranakis, E., Meyer auf der Heide, F. (eds.) ALGOSENSORS 2013. LNCS, vol. 8243, pp. 67–82. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-642-45346-5_6

    Chapter  Google Scholar 

  8. Chalopin, J., Das, S., Mihal’ák, M., Penna, P., Widmayer, P.: Data delivery by energy-constrained mobile agents. In: Flocchini, P., Gao, J., Kranakis, E., Meyer auf der Heide, F. (eds.) ALGOSENSORS 2013. LNCS, vol. 8243, pp. 111–122. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-642-45346-5_9

    Chapter  Google Scholar 

  9. 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 Part II. LNCS, vol. 8573, pp. 423–434. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-43951-7_36

    Google Scholar 

  10. 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

    Chapter  Google Scholar 

  11. Czyzowicz, J., Kranakis, E., Krizanc, D., Lambadaris, I., Narayanan, L., Opatrny, J., Stacho, L., Urrutia, J., Yazdani, M.: On minimizing the maximum sensor movement for barrier coverage of a line segment. In: Ruiz, P.M., Garcia-Luna-Aceves, J.J. (eds.) ADHOC-NOW 2009. LNCS, vol. 5793, pp. 194–212. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04383-3_15

    Chapter  Google Scholar 

  12. Das, S., Dereniowski, D., Karousatou, C.: Collaborative exploration by energy-constrained mobile robots. In: Scheideler, C. (ed.) Structural Information and Communication Complexity. LNCS, vol. 9439, pp. 357–369. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-25258-2_25

    Chapter  Google Scholar 

  13. Demaine, E.D., Hajiaghayi, M., Mahini, H., Sayedi-Roshkhar, A.S., Oveisgharan, S., Zadimoghaddam, M.: Minimizing movement. ACM Trans. Algorithms 5(3), 1–30 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  14. Dereniowski, D., Disser, Y., Kosowski, A., Pająk, D., Uznański, P.: Fast collaborative graph exploration. Inf. Comput. 243, 37–49 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  15. Dobrev, S., Durocher, S., Hesari, M.E., Georgiou, K., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J., Shende, S.M., Urrutia, J.: Complexity of barrier coverage with relocatable sensors in the plane. Theoret. Comput. Sci. 579, 64–73 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  16. Duncan, C.A., Kobourov, S.G., Kumar, V.S.A.: Optimal constrained graph exploration. In: 12th ACM Symposium on Discrete Algorithms, SODA 2001, pp. 807–814 (2001)

    Google Scholar 

  17. Dynia, M., Korzeniowski, M., Schindelhauer, C.: Power-aware collective tree exploration. In: Grass, W., Sick, B., Waldschmidt, K. (eds.) ARCS 2006. LNCS, vol. 3894, pp. 341–351. Springer, Heidelberg (2006). https://doi.org/10.1007/11682127_24

    Chapter  Google Scholar 

  18. 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

    Chapter  Google Scholar 

  19. Fraigniaud, P., Ga̧sieniec, L., Kowalski, D.R., Pelc, A.: Collective tree exploration. Networks 48(3), 166–177 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  20. Ortolf, C., Schindelhauer, C.: Online multi-robot exploration of grid graphs with rectangular obstacles. In: 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2012, pp. 27–36 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIF, Aix-Marseille University and CNRS, Marseille, France

    Evangelos Bampas, Shantanu Das & Christina Karousatou

  2. Faculty of Electronics, Telecommunications and Informatics, Gdańsk University of Technology, Gdańsk, Poland

    Dariusz Dereniowski

Authors
  1. Evangelos Bampas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shantanu Das
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dariusz Dereniowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Christina Karousatou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shantanu Das .

Editor information

Editors and Affiliations

  1. IMDEA Networks Institute, Leganés, Spain

    Antonio Fernández Anta

  2. University of Wrocław, Wroclaw, Poland

    Tomasz Jurdzinski

  3. Pace University, New York, USA

    Miguel A. Mosteiro

  4. Rutgers University, North Brunswick, New Jersey, USA

    Yanyong Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bampas, E., Das, S., Dereniowski, D., Karousatou, C. (2017). Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots. In: Fernández Anta, A., Jurdzinski, T., Mosteiro, M., Zhang, Y. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2017. Lecture Notes in Computer Science(), vol 10718. Springer, Cham. https://doi.org/10.1007/978-3-319-72751-6_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-72751-6_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-72750-9

  • Online ISBN: 978-3-319-72751-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation