Content deleted Content added
Reverting edit(s) by 27.57.165.18 (talk) to rev. 1074823369 by GhostInTheMachine: Vandalism (RW 16.1) |
→Temporal planning: Clarified link between temporal planning and scheduling: added STNU scheduling framework and founding paper. Made the link between Dynamic Controllability of STNUs & Temporal Planning. |
||
Line 91:
===Temporal planning===
Temporal planning can be solved with methods similar to classical planning. The main difference is, because of the possibility of several, temporally overlapping actions with a duration being taken concurrently, that the definition of a state has to include information about the current absolute time and how far the execution of each active action has proceeded. Further, in planning with rational or real time, the state space may be infinite, unlike in classical planning or planning with integer time. Temporal planning is closely related to [[scheduling]] problems when uncertainty is involved and can also be understood in terms of [[timed automaton|timed automata]]. The Simple Temporal Network with Uncertainty (STNU) is a scheduling problem which involves controllable actions, uncertain events and temporal constraints. Dynamic Controllability for such problems is a type of scheduling which requires a temporal planning strategy to activate controllable actions reactively as uncertain events are observed so that all constraints are guaranteed to be satisfied. <ref>{{cite journal |last1=Vidal |first1=Thierry |title=Handling contingency in temporal constraint networks: from consistency to controllabilities |journal=Journal of Experimental & Theoretical Artificial Intelligence |date=January 1999 |volume=11 |issue=1 |page=23--45 |doi=10.1080/095281399146607 |url=https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.107.1065&rep=rep1&type=pdf}}</ref>
===Probabilistic planning===
| |||