Experimental Analysis of Different Pheromone Structures in Ant Colony Optimization for Robotic Skin Design.

The optimization of the wire routing in an artificial skin for robots consists in selecting a subset of links between adjacent tactile sensors in order to connect them to a finite set of microcontrollers with a minimum cost. The problem has been modelled as a minimum cost Constrained Spanning Forest problem with solution-dependent costs on arcs. The problem is NP-hard. A MIP formulation, which applicability is limited, is given. An Ant Colony Optimization (ACO) algorithm, recently introduced, is also described for tackling large scale problems. This paper introduces several different alternative pheromone structures, whose effectiveness is evaluated through experimental tests, performed on both real and synthetically generated instances.

[1]  Marco Dorigo,et al.  Ant colony optimization theory: A survey , 2005, Theor. Comput. Sci..

[2]  Massimo Paolucci,et al.  A New Ant Colony Optimization Approach for the Single Machine Total Weighted Tardiness Scheduling Problem , 2008 .

[3]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[4]  Jérôme Monnot,et al.  The path partition problem and related problems in bipartite graphs , 2007, Oper. Res. Lett..

[5]  Giorgio Metta,et al.  Methods and Technologies for the Implementation of Large-Scale Robot Tactile Sensors , 2011, IEEE Transactions on Robotics.

[6]  Giulio Sandini,et al.  An embedded artificial skin for humanoid robots , 2008, 2008 IEEE International Conference on Multisensor Fusion and Integration for Intelligent Systems.

[7]  Maurizio Valle,et al.  Modular skin for humanoid robot systems , 2010 .

[8]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[9]  Larry Wasserman,et al.  Forest Density Estimation , 2010, J. Mach. Learn. Res..

[10]  Fulvio Mastrogiovanni,et al.  Heuristic approaches for the optimal wiring in large scale robotic skin design , 2012, Comput. Oper. Res..

[11]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[12]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[13]  Leonid Khachiyan,et al.  A greedy heuristic for a minimum-weight forest problem , 1993, Oper. Res. Lett..

[14]  Zsolt Tuza,et al.  Complexity and approximation of the Constrained Forest problem , 2011, Theor. Comput. Sci..