Study On The Planning Of Shipping Route

Path planning problem is one of the classical research fields of computer science. There are many mature path planning algorithms for urban transportation networks, tourism planning, pipeline layout, etc. Along with the development of marine technology, marine transport plays an important role in the transportation system. The proportion of maritime transport is increasing, also the transport flow of ocean. So, it is needed to formulate an economic safety shipping route.Now, along with the rapid development of digital ocean technology, shipping routes are no longer restricted to the original fixed routes. People can obtain the optimal routes with more precise marine data. This paper points out the difference between the marine network and urban transportation network. According to the problems of ships sailing on the ocean, we have to deal with characteristic of marine network with large empty areas and dense obstacles. The marine environment can't simply expressed by the points and lines. Thereby, a new algorithm for path planning is designed and applied to the design of shipping route.Classic path planning methods mostly derive from robot path planning, geographic information system fields. Robot path planning gets information through sensors, and it is always a local path planning method. The path planning of geographic information system is often aimed at urban transportation network. Roads and buildings are abstracted as edges and points. A global access map is constructed, it has some fixed routes.The path planning method contains environment expression, search strategy, path optimization three aspects. In environment expression aspect, each obstacle is identified (complicated obstacle is expressed by simple bounding boxes). In search strategy, according to the principle of the shortest path between two points, delimit the search scope according to the elective start point and end point. This method narrows the search scope and improves efficiency of the algorithm. Take obstacles as processing unit makes the path smooth. Shipping routes always along the direction of end point to sail, around obstacle and search path. At last, the shortest path is selected from these generating paths and is optimized.This main work of this paper includes: bitmap data processing, recognition and expression of obstacles, algorithm design of searching path, the design of path storage, path optimizing. This method is verified by the program. Experimental result shows that the method can effectively simplify the problem of path searching, achieves the desired results, and can be applied to the design of typhoon avoidance.