Linear time constant factor approximation algorithm for the Euclidean Freeze-Tag robot awakening problem
Publish Year: 1394
نوع سند: مقاله ژورنالی
زبان: English
View: 682
This Paper With 8 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_ACSIJ-4-5_013
تاریخ نمایه سازی: 7 آذر 1394
Abstract:
The Freeze-Tag Problem (FTP) arises in the study of swarm robotics. The FTP is a combinatorial optimization problem that starts by locating a set of robots in a Euclidean plane. Here, weare given a swarm of n asleep (frozen or inactive) robots and a single awake (active) robot. In order to activate an inactive robotin FTP, the active robot should either be in the physical proximity to the inactive robot or touch it. The new activatedrobot starts moving and can wake up other inactive robots. Thegoal is to find an optimal activating schedule with the minimum time required for activating all robots. In general, FTP is an NPHardproblem and in the Euclidean space is an open problem. In this paper, we present a recursive approximation algorithm with aconstant approximation factor and a linear running time for the Euclidean Freeze-Tag Problem
Keywords:
Authors
Mohammad Javad Namazifar
Computer Engineering & IT Department, Qazvin Branch, Islamic Azad University Qazvin, Iran
Alireza Bagheri
Computer Engineering & IT Department, Amirkabir University of Technology Tehran, Iran
Keivan Borna
Department of Computer Science, Kharazmi University, Faculty of Mathematics and Computer Science Tehran, Iran