Share Your Research, Maximize Your Social Impacts
Linear time constant factor approximation algorithm for the Euclidean ``Freeze-Tag`` robot awakening problem
Journal: Advances in Computer Science : an International Journal(ACSIJ) (Vol.4, No. 5)Publication Date: 2015-09-30
Authors : Mohammad Javad Namazifar; Alireza Bagheri; Keivan Borna;
Page : 87-94
Keywords : Freeze Tag Problem; Recursive Algorithm; Optimization; Swarm Robotics; Computational Geometry;
Source : Download
Find it from : Google Scholar
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, we are given a swarm of n asleep (frozen or inactive) robots and a sing
Other Latest Articles
- Finding the highest performance for one-to-many content distribution in peer-to-peer networks based on the clustering and loading bandwidth of peer Nodes
- Discrepancies Detection in Arabic and English Documents
- Composite Local Path Planning for Multi-Robot Obstacle Avoidance and Formation Navigation
- Applying Website Usability Testing Techniques to Promote E-services
- The Regional Electronic Commerce Development Level Evaluation Technique based on ELECTRE-IV Method
Last modified: 2015-10-08 21:45:18