About this document
Energy-Constrained Tree Exploration Algorithm by khoa1052005 is a document available to read on EtoBox.
This paper addresses the exploration of an unknown tree by a team of k mobile agents with limited energy budgets, aiming to maximize the number of distinct nodes visited. The authors propose an algorithm that balances breadth-first and depth-first exploration, achieving a competitive ratio of 3 compared to an optimal offline solution. Additionally, they establish a lower bound of 2.17 for any online algorithm, highlighting the challenges of energy constraints in graph exploration.
- Author
- khoa1052005
- Language
- EN