Energy-optimal broadcast and exploration in a tree using mobile agents
References
[1]
J. Anaya, J. Chalopin, J. Czyzowicz, A. Labourel, A. Pelc, Yann Vaxés, Collecting information by power-aware mobile agents, in: Proc. DISC, 2012, pp. 46–60.
[2]
S. Albers, Energy-efficient algorithms, Commun. ACM 53 (5) (2010) 86–96.
[3]
S. Albers, M.R. Henzinger, Exploring unknown environments, SIAM J. Comput. 29 (4) (2000) 1164–1188.
[4]
C. Ambühl, L. Gasieniec, A. Pelc, T. Radzik, X. Zhang, Tree exploration with logarithmic memory, ACM Trans. Algorithms 7 (4) (2011).
[5]
J. Augustine, S. Irani, C. Swamy, Optimal powerdown strategies, SIAM J. Comput. 37 (2008) 1499–1516.
[6]
I. Averbakh, O. Berman, A heuristic with worst-case analysis for minimax routing of two traveling salesmen on a tree, Discrete Appl. Math. 68 (1996) 17–32.
[7]
B. Awerbuch, O. Goldreich, D. Peleg, R. Vainish, A trade-off between information and communication in broadcast protocols, J. ACM 37 (2) (1990) 238–256.
[8]
Y. Azar, On-line load balancing, in: A. Fiat, G. Woeginger (Eds.), Online Algorithms: The State of the Art, in: LNCS, vol. 1442, Springer, 1998, pp. 178–195.
[9]
R.A. Baeza-Yates, R. Schott, Parallel searching in the plane, Comput. Geom. 5 (1995) 143–154.
[10]
E. Bampas, S. Das, D. Dereniowski, C. Karousatou, Collaborative delivery by energy-sharing low-power mobile robots, in: ALGOSENSORS, 2017, pp. 1–12.
[11]
R. Bar-Yehuda, O. Goldreich, A. Itai, On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization, J. Comput. Syst. Sci. 45 (1) (1992) 104–126.
[12]
A. Bärtschi, Efficient Delivery with Mobile Agents, PhD thesis ETH, Zurich, December 2017.
[13]
A. Bärtschi, J. Chalopin, S. Das, Y. Disser, B. Geissmann, D. Graf, A. Labourel, M. Mihalák, Collaborative delivery with energy-constrained mobile robots, in: Proc. of SIROCCO, 2016, pp. 258–274.
[14]
A. Bärtschi, J. Chalopin, S. Das, Y. Disser, D. Graf, J. Hackfeld, P. Penna, Energy-efficient delivery by heterogeneous mobile agents, in: Proc. of STACS, 2017.
[15]
J. Chalopin, R. Jacob, M. Mihalak, P. Widmayer, Data delivery by energy-constrained mobile agents on a line, in: Proc. ICALP (2), 2014, pp. 423–434.
[16]
J. Czyzowicz, K. Diks, J. Moussi, W. Rytter, Communication problems for mobile agents exchanging energy, in: Proceedings of SIROCCO, 2016, pp. 275–288.
[17]
J. Czyzowicz, K. Diks, J. Moussi, W. Rytter, Energy-optimal broadcast in a tree with mobile agents, in: ALGOSENSORS, 2017, pp. 98–113.
[18]
J. Czyzowicz, K. Diks, J. Moussi, W. Rytter, Broadcast with energy-exchanging mobile agents distributed on a tree, in: Proceedings of SIROCCO, 2018, pp. 209–225.
[19]
S. Das, D. Dereniowski, C. Karousatou, Collaborative exploration of trees by energy-constrained mobile robots, Theory Comput. Syst. 62 (5) (2018) 1223–1240.
[20]
M. Dynia, M. Korzeniowski, C. Schindelhauer, Power-aware collective tree exploration, in: Proc. of ARCS, 2006, pp. 341–351.
[21]
P. Fraigniaud, L. Gasieniec, D. Kowalski, A. Pelc, Collective tree exploration, Networks 48 (3) (2006) 166–177.
[22]
S. Irani, S.K. Shukla, R. Gupta, Algorithms for power savings, ACM Trans. Algorithms 3 (4) (2007).
[23]
P. Toth, D. Vigo, Vehicle Routing: Problems, Methods, and Applications, MOS-SIAM Series on Optimization, 2014.
[24]
F.F. Yao, A.J. Demers, S. Shenker, A scheduling model for reduced CPU energy, in: Proc. of 36th FOCS, 1995, pp. 374–382.
Index Terms
- Energy-optimal broadcast and exploration in a tree using mobile agents
Index terms have been assigned to the content through auto-classification.
Recommendations
Graph Exploration by Energy-Sharing Mobile Agents
Structural Information and Communication ComplexityAbstractWe 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, ...
Collaborative Exploration of Trees by Energy-Constrained Mobile Robots
We study the problem of exploration of a tree by mobile agents (robots) that have limited energy. The energy constraint bounds the number of edges that can be traversed by a single agent. We use a team of agents to collectively explore the tree and the ...
Mobile-C: a mobile agent platform for mobile C-C++ agents
This article presents the design, implementation and application of Mobile-C, an IEEE Foundation for Intelligent Physical Agents (FIPA) compliant agent platform for mobile C/C++ agents. IEEE FIPA standards are a set of specifications designed to ensure ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Elsevier B.V.
Publisher
Elsevier Science Publishers Ltd.
United Kingdom
Publication History
Published: 26 November 2019
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 19 Feb 2025