Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
