On a grid with obstacles and guards who each watch in one direction until blocked, can a thief reach the target without entering any guard's line of sight?

A room is a grid with free tiles, obstacles, a thief T, a target R and guards that each look in one fixed direction (<, >, ^, v) until an obstacle blocks their view (other guards do not block it). Return whether the thief can reach R without entering any guard's line of sight or stepping on a guard.