Minimizing movement

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 258-267

  Demaine, Erik D ^a   Hajiaghayi, MohammadTaghi ^a,b   Mahini, Hamid ^c   Sayedi Roshkhar, Amin S ^c   Oveisgharan, Shayan ^c   Zadimoghaddam, Morteza ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Carnegie Mellon University   (United States)

^c SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; IMAGE MATCHING; MULTICASTING; ROBOT PROGRAMMING;

APPROXIMABILITY; COORDINATED MOTION; GEOMETRIC ALGORITHM; GLOBAL PROPERTIES; INAPPROXIMABILITY; MINIMIZING MOVEMENTS; PERFECT MATCHINGS; ROBOT SWARMS;

APPROXIMATION ALGORITHMS;

EID: 84969268054     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. [ABF+02] Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell, and Martin Skutella. The freeze-tag problem: how to wake up a swarm of robots. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 568-577, San Francisco, California, 2002.
2. [ABG03] Esther M. Arkin, Michael A. Bender, and Dongdong Ge. Improved approximation algorithms for the freeze-tag problem. In Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 295-303, San Diego, California, USA, 2003.
3. [BDHR05] Jonathan L. Bredin, Erik D. Demaine, Mohammad-Taghi Hajiaghayi, and Daniela Rus. Deploying sensor networks with guaranteed capacity and fault tolerance. In Proceedings of the 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC 2005), pages 309-319, Urbana-Champaign, Illinois, May 25-28 2005.
4. [CCC+99] Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, and Ming Li. Approximation algorithms for directed steiner problems. Journal of Algorithms, 33(1):73-91, 1999.
5. [CFKR98] Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, and André Raspaud. Optimized broadcasting and multicasting protocols in cut-through routed networks. IEEE Transactions on Parallel and Distributed Systems, 9(8):788-802, 1998.
6. [CHP+04a] P. Corke, S. Hrabar, R. Peterson, D. Rus, S. Saripalli, and G. Sukhatme. Autonomous deployment of a sensor network using an unmanned aerial vehicle. In Proceedings of the 2004 International Conference on Robotics and Automation, New Orleans, USA, 2004.
7. [CHP+04b] P. Corke, S. Hrabar, R. Peterson, D. Rus, S. Saripalli, and G. Sukhatme. Deployment and connectivity repair of a sensor net with a flying robot. In Proceedings of the 9th International Symposium on Experimental Robotics, Singapore, 2004.
8. [Coh98] Johanne Cohen. Broadcasting, multicasting and gossiping in trees under the all-port line model. In Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 164-171, Puerto Vallarta, Mexico, 1998.
9. [DMM+97] Srinivas Doddi, Madhav V. Marathe, Andy Mirzaian, Bernard M. E. Moret, and Binhai Zhu. Map labeling and its generalizations. In Proceedings of the 8th Annual ACMSIAM Symposium on Discrete Algorithms, pages 148-157, New Orleans, LA, 1997.
10. [GHMM02] M. Ghodsi, M.T. Hajiaghayi, M. Mahdian, and V. S. Mirrokni. Length-constrained path-matchings in graphs. Networks, 39(4):210-215, 2002.
11. [GK99] Sudipto Guha and Samir Khuller. Improved methods for approximating node weighted steiner trees and connected dominating sets. Information and Computation, 150(1):57-74, 1999.
12. [HAB+03] T.-R. Hsiang, E. M. Arkin, M. A. Bender, S. P. Fekete, and Joseph S. B. Mitchell. Algorithms for rapidly dispersing robot swarms in unknown environments. In J.-D. Boissonnat, J. Burdick, K. Goldberg, and S. Hutchinson, editors, Algorithmic Foundations of Robotics V, volume 7 of Springer Tracts in Advanced Robotics, pages 77-94. Springer-Verlag, 2003.
13. [JBQZ04] Minghui Jiang, Sergey Bereg, Zhongping Qin, and Binhai Zhu. New bounds on map labeling with circular labels. In Proceedings of the 15th International Symposium on Algorithms and Computation, volume 3341 of Lecture Notes in Computer Science, pages 606-617, Hong Kong, China, December 2004.
14. [JQQ+03] Minghui Jiang, Jianbo Qian, Zhongping Qin, Binhai Zhu, and Robert Cimikowski. A simple factor-3 approximation for labeling points with circles. Information Processing Letters, 87(2):101-105, 2003.
15. [KR95] Philip N. Klein and R. Ravi. A nearly best-possible approximation algorithm for node-weighted steiner trees. Journal of Algorithms, 19(1):104-115, 1995.
16. [LaV06] S. M. La Valle. Planning Algorithms. Cambridge University Press, 2006. http://msl.cs.uiuc.edu/planning/.
17. [RW95] John H. Reif and Hongyan Wang. Social potential fields: a distributed behavioral control for autonomous robots. In Proceedings of the Workshop on Algorithmic Foundations of Robotics, pages 331-345, 1995.
18. [SABM04] Marcelo O. Sztainberg, Esther M. Arkin, Michael A. Bender, and Joseph S. B. Mitchell. Theoretical and experimental analysis of heuristics for the "freeze-tag" robot awakening problem. IEEE Transactions on Robotics and Automation, 20(4):691-701, 2004.
19. [SPS03] Alan C. Schultz, Lynne E. Parker, and Frank E. Schneider, editors. Multi-Robot Systems: From Swarms to Intelligent Automata. Springer, 2003. Proceedings from the 2003 International Workshop on Multi-Robot Systems.
20. [SW01] Tycho Strijk and Alexander Wolff. Labeling points with circles. International Journal of Computational Geometry & Applications, 11(2):181-195, 2001.
21. [Wes96] Douglas B. West. Introduction to Graph Theory. Prentice Hall Inc., Upper Saddle River, NJ, 1996.