Hamidreza Keshavarz, A. Bagheri, Kamran Layeghi, Seyed Iman Mahdavi
{"title":"冻结标签问题的模拟退火方法","authors":"Hamidreza Keshavarz, A. Bagheri, Kamran Layeghi, Seyed Iman Mahdavi","doi":"10.1109/ReTIS.2011.6146847","DOIUrl":null,"url":null,"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.","PeriodicalId":137916,"journal":{"name":"2011 International Conference on Recent Trends in Information Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Simulated Annealing Approach for the Freeze-Tag Problem\",\"authors\":\"Hamidreza Keshavarz, A. Bagheri, Kamran Layeghi, Seyed Iman Mahdavi\",\"doi\":\"10.1109/ReTIS.2011.6146847\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":137916,\"journal\":{\"name\":\"2011 International Conference on Recent Trends in Information Systems\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Recent Trends in Information Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ReTIS.2011.6146847\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Recent Trends in Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ReTIS.2011.6146847","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Simulated Annealing Approach for the Freeze-Tag Problem
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
