期刊名称：International Journal of Soft Computing & Engineering
电子版ISSN：2231-2307
出版年度：2012
卷号：2
期号：2
页码：471-474
出版社：International Journal of Soft Computing & Engineering
摘要：Mobile robot path planning problem is an important combinational content of artificial intelligence and robotics. Its mission is to be independently movement from the starting point to the target point make robots in their work environment while satisfying certain constraints. Constraint conditions are as follows: not a collision with known and unknown obstacles, as far as possible away from the obstacle, sports the shortest path, the shortest time, robot-consuming energy minimization and so on. In essence, the mobile robot path planning problem can be seen as a conditional constraint optimization problem. To overcome this problem, ant colony optimization algorithm is used.
