Integration of Knowrob with task planning algorithms
Dear Knowrob developers,
I studied about Knowrob papers and there is some doubt regarding task planning process.
As I understood, based on task planning with the Knowrob, sequence of actions are certain (for instance, which actions occur before or after which actions) that can be ordered with the "orderingConstraints" property and also they may be decomposed into other sub-tasks. My question is the structure used to find all sub-tasks to make a pancake whether we can call this similar to HTN !!
Moreover, Can we integrate other task planning algorithms such as STRIPS or Graphplan with the Knowrob? If yes, is there any library which already implements this type of planning inside Prolog language? because it could be interesting to benchmark different task planning.
Thanks in advance
