1 / 30

MaxSea International

MaxSea International. Software editor for marine market MaxSea is distributed in 25 countries Available in 13 languages . 90.000 ships equiped. Our group. 75 Employes Turnover 2012: 6.2 M€ (+10%). Charts Bidart - France. Software Bidart - France. Holding Bidart - France.

gafna
Download Presentation

MaxSea International

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. MaxSea International Software editor for marine market MaxSeaisdistributed in 25 countries Available in 13 languages. 90.000shipsequiped

  2. Our group 75 Employes Turnover 2012: 6.2 M€ (+10%) Charts Bidart - France Software Bidart - France Holding Bidart - France Software Portland - USA Commercial, Sales, Marketing, support Barcelona - Spain

  3. Radar Overlay Strong collaboration with FURUNO Japan (1st worldwide marine electronics manufacturer).

  4. Cameras FLIR (IR, night vision…)

  5. Isochrones for minimum time route optimization • Wind polar • Wave polar • Set sail • Weatherprediction (wind, waves) • Currents • Optimal route

  6. DEMO

  7. Isochrone : Dynamicprogramming • Objective: • Maximize distance for a given time interval ∆t N D Step n →Isochrone at time ζ Reference : Knmipublicatie met nummer : 102.94 On minimal-time shiprouting S.J. Bijlsma 1975

  8. Isochrone : Dynamicprogramming N D Wind Polars

  9. Isochrone : Dynamicprogramming Whatis the shorterpath ? N d1 d2 a d3 d4 D

  10. Isochrone : Dynamic programming Direct construction of next point : normal to isochrone == normal to polar N D Wind polar

  11. Isochrone : Dynamic programming Repeat for all isochrone point, youconstructnext isochrone. N D

  12. Isochrone : Dynamic programming Next isochrone (dash) Optimizationbecomes a geometricaloptimization. Not easyto resolve, in good computational time, takingintoaccountnumericalprecision. Multiple path for optimal route at intersection point.

  13. Route optimization for motorboats • Main goal: fuel consumptionoptimization. But alsolimitweather conditions. • Several types of boats • Motor • Motorwithsail assistance • MotorSailing • Sailing

  14. 3D Routing • New problem : find best course (2d) and best motor speed (power) to minimize fuel consumption. • Motor and MotorSailboats have round speed polars (motoralways on) => isochrones are isodistance (shortestpath).

  15. Fuel Consumptionmodels • Motor : • Hydro & areodynamic forces + motorconsumptioncurve. • Approximation 2nddegreefrom speed inside speed limits (18-25kts) : Conso t/nm = 0.0036*V2 + 0.1015V + 0.8848 (not linear) • MotorSailing : mutilple Wind polar curves (for eachmotor power / sail %).

  16. FastMarchingMethodOrderedUpwindMethod • Wewanted a new method for 2D & 3D (more easy to implementthan 3D geometriccalculation). • Differentialequation : Consumption = f(x,y,t,course,motor power). • Front propagation. • Stronganisotropy : wind and wind polar (sailing) or waves.

  17. OrderedUpwindMethod Considered are sortedaccording to cost. Reference : SIAM J. Numer. Anal., 41(1), 325–363. (39 pages) Ordered Upwind Methods for Static Hamilton--Jacobi Equations: Theory and Algorithms

  18. OrderedUpwindMethod SmallestConsideredisremovedfromSorted Queue. It becomes the Last Accepted.

  19. OrderedUpwindMethod All Neighbors of Last Accepted are updated. Cost and Arrival Time are computed.

  20. OrderedUpwindMethod Again, smallestConsidered => Last Accepted

  21. OrderedUpwindMethod The Front advancedwith 2 new Accepted. Loopuntilarrival point isreached.

  22. 3D OUM

  23. OUM : 3 update methods • Direct Cost : from a node to horizontal, vertical or diagonal node. • Enumeration : minimise over 20 angles (original methodfromVladimirsky) • Gradiant : fromdownwindgradiant, select best speed vector in polar, use it to computeupwind.

  24. Enumeration Linearcost interpolation between U2 & U3. 20 angles tried for minimization.

  25. Gradiant, when 3 acceptedneighboors

  26. DEMO

  27. Experience • Difficult to validateresults : reference solution. • Gradiantwasworkingduring unit testing, wefoundproblemsduringintegration. • Parallelalgorithmis not evidence. • Software optimizationisneeded for interactive simulations.

More Related