A prisoner has escaped from the maximum security prison in puzzlevania! Apparently, the prison's security system - which was composed of guards who either always tell the truth or lie and doors with lions behind them - proved insufficient for her mastery of paradoxes (which, mind you, was how she got in there in the first place). The police would really like to get her back, but they're having trouble because she's way less lazy than they are. Thankfully, the chase obeys a very strict set of rules and so is easily to analyze:
The chase takes place in a series of discrete turns on an $a\times b$ grid of squares. Each turn, first, the fugitive can make any number (i.e. zero or more) of moves left, right, up or down, so long as no move brings her in the same square as a police officer. Then, a single police officer may make a single move to an adjacent unoccupied square. The police can only capture the fugitive if they surround her completely, leaving her no legal moves. Moves may "wrap around" the edges of the board, so one may move upwards from the top row and end up on the bottom row, and similarly for left and right rows. (For the mathematically minded, that means this board is a torus)
In particular, this chase takes place on a $a\times b$ board with $3\leq a\leq b$. At the start, there are $2a$ police officers distributed randomly across the board and the fugitive is allowed to choose their position from any available one (after seeing the arrangement of the police).
Can the police ensure the capture of the fugitive? How?