How to implement on Discrete action space with size of 2^N

[PKUTAN]

Nice to meet you author!

Can I ask you a question of implementing Discrete SAC on large action space with size of 2^N?

To be specific, I have N locations , and for each step, agent output V which is a N*1 binary vector. if V[i] = 1 means that we choose location i and V[i] = 0 means we do not choose location i.

How can I implement this situation to your discrete SAC?

Thanks for your answering!