Julian Fletcher

This research focuses on the development, implementation, and optimization of two related methods for computing shortest paths subject to turn constraints. The work involves improving an existing modification to Dijkstra's algorithm to efficiently handle turn angle and length requirements when finding paths.

The project aims to demonstrate comparable performance to previous methods despite solving a more complex problem.

The project utilized a Turn-Angle Restricted shortest paths algorithm to create restricted isochrones in London, UK. The project demonstrated the potential impacts of considering vehicle restrictions in reachability analysis.

Future work will focus on refining the approach and exploring applications outside of road networks, and in complex environments.