Dijkstra is good when you don't know the location of your destination. For example:
You want to go to the McDonalds but there are like 4 in town and you don't know their locations. Dijkstra will find the nearest much quicker than Astar but in rsps we actually know the location hence why the use of heuristics improves the algorithm to find the shortest path quicker.
Rsps pathfinding could use bidirectional pathfinding which in most cases will lower the amount of checked tiles before a path is found making it quicker. Also the general astar could be improved by using a different approach on heuristics etc.