A Planning Algorithm with Temporal Constraints in the Working Procedures
2013 ◽
Vol 760-762
◽
pp. 1786-1789
Keyword(s):
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.
Keyword(s):
2021 ◽
Vol 2095
(1)
◽
pp. 012062
Keyword(s):
Keyword(s):
2011 ◽
Vol 422
◽
pp. 3-9
◽
Keyword(s):
2014 ◽
Vol 716-717
◽
pp. 1662-1665
Keyword(s):
2021 ◽
Vol 2083
(4)
◽
pp. 042033
Keyword(s):