An ant colony algorithm for solving discrete minimum constraint removal problem

DOI10.16183/J.CNKI.JSJTU.2015.03.023MaRDI QIDQ3461440zbMATH OpenFDO

Authors Bo Xu, Huaqing Min, Fangxiong Xiao

Publication date 15 January 2016

Full work available at URL https://doi.org/10.16183/J.CNKI.JSJTU.2015.03.023

zbMATH Keywords

ant colony algorithmdiscrete minimum constraint removalmotion planning problemrobot path planning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence for robotics (68T40)

Recommendations

• Advances in Intelligent Data Analysis VI
• An ant colony algorithm for solving a continuous function optimization problem based on pheromone distributive functions
• Novel degree constrained minimum spanning tree algorithm based on an improved multicolony ant algorithm
• scientific article; zbMATH DE number 1900792
• Ant colony approach to constrained redundancy optimization in binary systems

Cited in

(2)

• A TWO-STATE ANT COLONY ALGORITHM FOR SOLVING THE MINIMUM GRAPH BISECTION PROBLEM
• Advances in Intelligent Data Analysis VI

This page was built for publication: An ant colony algorithm for solving discrete minimum constraint removal problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3461440)