For the permutation group isomorphism problem, a permutational isomorphism between two permutation groups is sought. A closely related but seemingly easier problem arises, if an isomorphism between the groups is already fixed, and only a compatible (bijective) mapping of the sets where the groups act must be computed. Instead of fixing an isomorphism between the groups, we can also say that we have just a single group acting on two different sets.

This problem seems to be easier (than the permutation group isomorphism problem), because it seems to allow to directly exploit the fact that any group of size $n$ has a generator set of size at most $\log_2 n$. Such a generator set allows a construction similar to a Cayley graph, such that all that remains is to compute an isomorphism of the corresponding graphs. But I haven't found a suitable data structure for representing the automorphisms of such graphs yet, so I'm stuck at that point.

Because the problem doesn't feel too difficult, I wonder whether it has been solved already. An algorithm with run time polynomial in the size of the set and the size of the group (i.e. exponential in the size of a minimal generator set) would qualify as a solution, in the context of this question.