Paper Info
Title
Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model.
Abstract
Two robots stand at the origin of the infinite line and are tasked with searching collaboratively for an exit at an unknown location on the line. They can travel at maximum speed b and can change speed or direction at any time. The two robots can communicate with each other at any distance and at any time. The task is completed when the last robot arrives at the exit and evacuates. We study time-energy tradeoffs for the above evacuation problem. The evacuation time is the time it takes the last robot to reach the exit. The energy it takes for a robot to travel a distance x at speed s is measured as \(xs^2\). The total and makespan evacuation energies are respectively the sum and maximum of the energy consumption of the two robots while executing the evacuation algorithm.
Year
DOI
Venue
2019
10.1007/978-3-030-24922-9_13
SIROCCO
Field
DocType
Volume
Discrete mathematics,Job shop scheduling,Wireless,Logarithm,Robot,Available energy,Energy consumption,Mathematics,Bounded function
Journal
abs/1905.06783
Citations 
PageRank 
References 
0
0.34
0
Authors
9
Name
Order
Citations
PageRank
Jurek Czyzowicz177874.35
Konstantinos Georgiou217125.73
Ryan Killick324.47
Evangelos Kranakis43107354.48
Danny Krizanc51778191.04
Manuel Lafond631.41
Lata Narayanan761362.78
Jaroslav Opatrny848144.39
Sunil M. Shende921824.35