Complexity of concurrent temporal planning
We consider the problem of temporal planning in which a given goal is reached by taking a number of actions which may temporally overlap and interfere, and the interference may be essential for reaching the goals. We formalize a general temporal planning
|Collections||ANU Research Publications|
|Source:||Proceedings of The 17th International Conference on Automated Planning and Scheduling (ICAPS 2007)|
|01_Rintanen_Complexity_of_concurrent_2007.pdf||177.03 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.