Aggregating robots compute: An adaptive heuristic for the Euclidean Steiner tree problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5040 LNAI, Issue , 2008, Pages 447-456

  Hamann, Heiko ^a   Wörn, Heinz ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AGENTS; AGGLOMERATION; FAULT TOLERANCE; HEURISTIC METHODS; METAL CLADDING; MOBILE AGENTS; MULTI AGENT SYSTEMS; NUCLEAR PROPULSION; QUALITY ASSURANCE; RELIABILITY; ROBOTICS; ROBOTS; SENSOR NETWORKS;

A-PLANE; ADAPTIVE; ADAPTIVE BEHAVIORS; APPROXIMATED SOLUTIONS; BIO-INSPIRED; EMERGENT PROPERTIES; EUCLIDEAN STEINER TREE PROBLEMS; HARD PROBLEMS; HEURISTIC; LARGE-SCALE; NP-HARD; SELF-ORGANIZATION; SENSORS AND ACTUATORS;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 54249138631     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69134-1_44     Document Type: Conference Paper

References (19)

1. Aaronson, S.: NP-complete problems and physical reality, ACM SIGACT News 36(1), 30-52 (2005)
2. Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence: From Natural to Artificial Systems. Oxford Univ. Press, Oxford (1999)
3. Chlebík, M., Chlebíková. J.: Approximation hardness of the Steiner Tree problem on graphs. in: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol. 2368, pp. 170-179. Springer, Heidelberg (2002)
4. Dorigo, M., Caro, G.D.: Ant Colony Optimization: A new meta-heuristic. In: Angeline, P.J., Michalewicz, Z., Schoenauer, M., Yao, X., Zalzala, A. (eds.) Proceedings of the 1999 Congress on Evolutionary Computation (CEC 1999), Piscataway, NJ, pp. 1470-1477. IEEE Press, Los Alamitos (1999)
5. Garey, M.R., Graham, R.L., Johnson, D.S.: Some NP-complete geometric problems. In: Annual ACM Symp. on Theory of Computing, pp. 10-22 (1976)
6. Hales, T.C.: The honeycomb conjecture. Discrete and Computational Geometry 25(1), 1-22 (2001)
7. Hamann, H.: Modeling and investigation of robot swarms. Master's thesis, University of Stuttgart, Germany (2006)
8. Hamann, H., Wörn, H.: Embodied computation. Parallel Processing Letters 17(3), 287-298 (2007)
9. Hofstadter, D.R.: Gödel, Escher, Bach. Basic Books (1979)
10. Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem. North-Holland, Amsterdam (1992)
11. Kolb, M., Herrmann, H.J.: The sol-gel transition modelled by irreversible aggregation of clusters. J. Physics A 18(8), L435-L441 (1985)
12. LaValle, S.M., Kuffner, J.J.: Rapidly-exploring random trees: Progress and prospects. In: Donald, B.R., Lynch, K.M., Rus, D. (eds.) Algorithmic and Computational Robotics, Wellesley, MA, USA, pp. 293-308. A. K. Peters (2001)
13. Litus, Y., Zebrowski, P., Vaughan, R.: Energy-efficient multi-robot rendezvous: Parallel solutions by embodied approximation. In: Workshop on Algorithmic equivalencies between biological and robotic swarms, Atlanta, USA (June 2007)
14. Payton, D., Daily, M., Estowski, R., Howard, M., Lee, C.: Pheromone robotics. Autonomous Robots 11(3), 319-324 (2001)
15. Robins, G., Zelikovsky, A.: Improved Steiner Tree approximation in graphs. In: 11th ACM-SIAM Symposium on Discrete Algorithms, pp. 770-779 (2000)
16. Seyfried, J., Szymanski, M., Bender, N., Estaña, R., Thiel, M., Wörn, H.: The I-SWARM project. In: Şahin, E., Spears, W.M. (eds.) Swarm Robotics Workshop, pp. 70-83. Springer, Heidelberg (2005)
17. Tom, J., Witten, A., Sander, L.M.: Diffusion-limited aggregation, a kinetic critical phenomenon. Phys. Rev. Lett. 19, 1400-1403 (1981)
18. Warme, D., Winter, P., Zachariasen, M.: Geosteiner homepage, http://www.diku.dk/geosteiner/
19. Zachariasen, M., Winter, P.: Concatenation-based greedy heuristics for the Steiner tree problem in the Euclidean plane. Algorithmica 25, 418-437 (1999)