Explicit motion planning in digital projective product spaces

We introduce digital projective product spaces based on Davis' projective product spaces. We determine an upper bound for the digital LS-category of digital projective product spaces. In addition, we obtain an upper bound for the digital topological complexity of these spaces through an explicit motion planning construction, which shows digital perspective validity of results given by S. Fi?sekci? and L. Vandembroucq. We apply our outcomes on specific spaces in order to be more clear.