Warehouse Robot With Obstacles

This problem is part of solulu Pro

A warehouse is an m × n grid; 1 marks a shelf (blocked) and 0 is free floor. A robot starts at the top-left and must reach the bottom-right, moving only right or down. How many different paths avoid the shelves?