MERIDIAN

1
Shown here is an example of Meridian in action on
a 500 x 500 raster map. The application uses two
bitmaps images one greyscale image that stores
the collision data, and a second image used
purely for display purposes.
navigation through the binary sea
AIM To improve upon the path-finding theories
discussed in A Method for Searching Optimal
Routes with Collision Avoidance on Raster Charts.
FINAL PATH this is the shortest route as
calculated by the 8-step A algorithm
NAUTICAL NAVIGATION In the modern age, ships are
becoming ever more reliant on electronic
navigation charts and GPS applications to
determine their route across the oceans. With the
focus on reducing human intervention, a need for
efficient path-finding algorithms that can detect
collision-free routes in real-time from
navigation raster charts is clear.
SEA ships can move into any of these cells
An 8-step search pattern.
MERIDIAN Meridian implements an 8-step A
algorithm, which can be proven to be a very
efficient search method in cases where the
destination point is known. A second-level
algorithm that searches through groups of cells,
rather than individual cells, is also implemented
to reduce the total number of cells that must be
explored in a map. To increase efficiency
further, Meridian also uses a binary heap to
store its list of explored areas, removing the
need to sort with each iteration and thereby
greatly improve its performance on large maps.
This ensures that Meridian can locate the optimal
route in as short a time as is possible.
LAND this is impassable terrain and isnt
factored into the algorithm calculations
Meridian is programmed in C using the win32 and
DirectX APIs.
a third-year project by Alan Warner-Grieve
(aw54_at_kent.ac.uk)...