Commit 1b6db0bf authored by Markus Klinik's avatar Markus Klinik
Browse files

cite KoopmanP2009

parent cb95877c
Subproject commit eb75a4872df90d5b13962e172e92c9614075823f
Subproject commit df02f1da6ca87dcbc86ae9ea9f2dd5374b2f680d
......@@ -69,4 +69,10 @@ In \cref{sec:scheduling} we will see how each of them can be expressed in the mo
For the planner, we are for now content with a more modest goal.
An order constraint between two tasks should express that the tasks are not commutative and not parallelizable.
Unconstrained tasks should be commutative and parallelizable.
The planner can not identify tasks related by the remaining two combinations.
In classical partial-order planning, unconstrained tasks are commutative, but not necessarily parallelizable.
That is the reason why we developed the method described in the next section.
\subsection{Plan Synthesis Using Generic Programming}
\citet{KoopmanP2009}
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment