Complexity of planning for connected agents in a partially known environment

Arthur Queffelec, Ocan Sankur, François Schwarzentruber. Complexity of planning for connected agents in a partially known environment. Theoretical Computer Science, 941:202-220, 2023. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.