DocumentCode
3645729
Title
A Simulated Annealing Approach for the Freeze-Tag Problem
Author
Hamidreza Keshavarz;Alireza Bagheri;Kamran Layeghi; Seyed Iman Mahdavi
Author_Institution
Department of Computer Engineering, Tehran North Branch, Islamic Azad University, Iran
fYear
2011
Firstpage
94
Lastpage
98
Abstract
The Freeze-Tag Problem is a scenario in which there is “n” number of robots; n-1 ones are “asleep” and one is “awake”. Any awake robot can move and awaken another robot by touching it. The woken up robot can wake up other robots. The optimal goal is to minimize the required time to awaken all the sleeping robots. We present a simulated annealing approximation which improves an existing solution and runs in a short period of time.
Keywords
"Robots","Simulated annealing","Heuristic algorithms","Temperature","Approximation algorithms","Traveling salesman problems","Approximation methods"
Publisher
ieee
Conference_Titel
Recent Trends in Information Systems (ReTIS), 2011 International Conference on
Print_ISBN
978-1-4577-0790-2
Type
conf
DOI
10.1109/ReTIS.2011.6146847
Filename
6146847
Link To Document