You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hi folks. I'm trying to compare temporal planners (tdf, optic, etc). Should I include aries or fape for non-hierarchical planning? It looks like aries is the current project, correct? I started with fape after reading some of Arthur's publications. Right now I'm unable to make performance comparisons because I seem to be calling fape incorrectly. No matter what I do, I get an exception on Windows 11 64bit machine. EDIT: I think the problem is my java environment. I'll change that.
The text was updated successfully, but these errors were encountered:
Aries currently supports non-temporal planning in the sense that it can translate a flat problem into its own representation and use its internal constraint solver to look for a solution.
However, there has been no effort in making the solving efficient for flat-problems (notably with branching heuristics and symmetry breaking) and as a result you will not get state-of-the-art performance for such problems. The current focus is on hierarchical planning for which much better results can be expected. We do have plan to improve the story for flat planning but I cannot give a timeline at the moment.
Hi folks. I'm trying to compare temporal planners (tdf, optic, etc). Should I include aries or fape for non-hierarchical planning? It looks like aries is the current project, correct? I started with fape after reading some of Arthur's publications. Right now I'm unable to make performance comparisons because I seem to be calling fape incorrectly. No matter what I do, I get an exception on Windows 11 64bit machine. EDIT: I think the problem is my java environment. I'll change that.
The text was updated successfully, but these errors were encountered: