Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots-Reference-Cited by-同舟云学术

Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots

Published:2017 Issue: Volume: Page:1-12
ISSN:0302-9743
Container-title:Algorithms for Sensor Systems
language:
Short-container-title:

Author:

Bampas Evangelos,Das Shantanu,Dereniowski Dariusz,Karousatou Christina

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-72751-6_1

Reference20 articles.

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)

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

3. Lecture Notes in Computer Science;A Bärtschi,2016

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)

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

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Collaborative delivery on a fixed path with homogeneous energy-constrained agents;Theoretical Computer Science;2021-05

2. Gossiping by energy-constrained mobile agents in tree networks;Theoretical Computer Science;2021-03

3. Near-gathering of energy-constrained mobile agents;Theoretical Computer Science;2021-01

4. Asymptotic Connectedness of Random Interval Graphs in a One Dimensional Data Delivery Problem;Advances in Probability and Mathematical Statistics;2021

5. Graph Exploration by Energy-Sharing Mobile Agents;Structural Information and Communication Complexity;2021