A Planning Algorithm With Temporal Constraints in the Working Procedures
Temporal planning is a broad research area in automated planning.In most real-world applications such as the problems of working procedures planning,many real planning problems often require the planning goals can be satisfied in shorter time and some temporal constraints should be satisfied in the planning answer.In this paper,the ant colony algorithm under the temporal constraints is presented which with the heuristic control rules and the evaluation tactics in the framework of the ant colony planning algorithm.The searching way of the algorithm has the character of global and parallel.And it has the ability of convergence acceleration in the solution searching.
temporal constraints intelligence planning ant colony planning algorithm heuristic tactics working procedures planning
Xiaolong CHAI
Department of Mathematics and Computing Science,Guangdong University of Business Studies,Guangzhou 510320,China;Key Lab of E-commerce Market Application Technology of Guangdong Province,Guangzhou 510320,China
国际会议
郑州
英文
1350-1353
2013-10-19（万方平台首次上网日期，不代表论文的发表时间）