Most mobile robots which use the operating systems (ROS) employ costmap-based path planner for navigation in environment. Besides the systems, in which robotic devices function in completely autonomous manner, also such systems exist, where user specifies in a self-contained interface the target point for robot motion, without using any costmap-related data. In such settings, the robot sometimes cannot reach the user-specified point because it is treated as an obstacle on the costmap. To solve this problem an algorithm was developed, which accepts the coordinates of the target point, specified through user interface, and finds possible target points in vicinity of the specified one, regarding the predefined distance constraints. Conceptually, the search of possible points consists in looping through costmap cells of the global cost planner in orthogonally related directions from the obtained point and in defining of the preferable target points, upon reaching which the task is considered to be completed. In this paper, the algorithm was tested as part of the navigational module of the robot. Experiments were performed, particularly, in the Gazebo simulation environment; robot model TURTLEBOT3 Waffle Pi was also utilized. The experimental results showed that this module can be combined with any planner. When the value of validation step was set at the minimum value of 0.01 m, it was required no more than 55 ms to find a target point. The minimum duration of such search was 1 ms.