Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Error in TimeTriggeredPlan.extract_epsilon algorithm (no mutex) #605

Open
Framba-Luca opened this issue May 24, 2024 · 1 comment
Open

Comments

@Framba-Luca
Copy link
Contributor

The TimeTriggeredPlan.extract_epsilon algorithm does not take into consideration if 2 events are mutex for the epsilon calculation.

This is not compliant with the wanted PDDL semantic.

@Framba-Luca
Copy link
Contributor Author

Debug info: the extract_epsilon method creates a Set of times of the events, and then computes the minimum distance between 2 events and outputs it as the plan epsilon.

The times should not be a Set[Fraction], but a Dict[FNode, Set[Fraction]], containing as keys the GROUNDED fluents involved in the event, and in the mapped set all the times of the corresponding events. Then the plan epsilon is the minimun between all the minimum distances in the Sets.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant