If there are infinitely many Woodins, then every projective set is determined, whence every projective set has the perfect set property (PSP). Since determinacy is such a stronger property than the PSP, it seems this should be overkill, and we should be able to prove that every projective set has the PSP from weaker assumptions. Indeed, in terms of consistency strength (rather than outright implication) we do know the gap: projective determinacy needs the Woodins while the PSP for projective sets only needs one inaccessible.
It's clear that no large cardinal consistent with $V = L$ suffices. And Solovay's work mentioned in this related question and this other related question gives an epsilon more precise lower bound. But there's a pretty big gap from that to infinitely many Woodins.
Are more precise bounds known?