Worst-case & average-case Efficiency trade-offs for search problems
thesisposted on 24.05.2021, 12:14 by Preeti Sharma
Evacuation problems fall under the vast area of search theory and operations research. Problems of evacuation of two robots on a unit disc have been studied for an efficient evacuation time. Work done so far has focused on improving the ’worst-case’ evacuation time with deterministic algorithms. We study the ’average-case’ evacuation time (randomized algorithms) while considering the efficiency trade-off between worst-case and average-case costs. Our other contribution is to analyze average-case and worst-case costs for the cowpath problem (another search problem) which helped us to set a parallel method for the evacuation problem.