Sciweavers

9 search results - page 2 / 2
» Solving geometric TSP with ants
Sort
View
CEC
2008
IEEE
14 years 17 hour ago
DEACO: Hybrid Ant Colony Optimization with Differential Evolution
—Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm for the approximate solution of combinatorial optimization problems that has been inspired by the for...
Xiangyin Zhang, Haibin Duan, Jiqiang Jin
TASE
2010
IEEE
13 years 8 days ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
PPAM
2005
Springer
13 years 11 months ago
The Distributed Stigmergic Algorithm for Multi-parameter Optimization
Abstract. The paper presents a new distributed Multilevel Ant Stigmergy Algorithm (MASA) for minimizing the power losses in an electric motor by optimizing the independent geometri...
Jurij Silc, Peter Korosec
ICRA
2006
IEEE
114views Robotics» more  ICRA 2006»
13 years 11 months ago
Multi-level Free-space Dilation for Sampling narrow Passages in PRM Planning
— Free-space dilation is an effective approach for narrow passage sampling, a well-recognized difficulty in probabilistic roadmap (PRM) planning. Key to this approach are method...
David Hsu, Gildardo Sánchez-Ante, Ho-Lun Ch...