MaxSea International Software editor for marine market MaxSea is distributed in 25 countries Available in 13 languages. 90.000 ships equiped.

Slides:



Advertisements
Similar presentations
Reactive and Potential Field Planners
Advertisements

Hadi Goudarzi and Massoud Pedram
SE301: Numerical Methods Topic 8 Ordinary Differential Equations (ODEs) Lecture KFUPM Read , 26-2, 27-1 CISE301_Topic8L8&9 KFUPM.
CSE 390B: Graph Algorithms Based on CSE 373 slides by Jessica Miller, Ruth Anderson 1.
Label Placement and graph drawing Imo Lieberwerth.
CSE 380 – Computer Game Programming Pathfinding AI
Motion Planning CS 6160, Spring 2010 By Gene Peterson 5/4/2010.
Chapter 5 Projectile motion. 1. Recall: a projectile is an object only acted upon by gravity.
Performance Prediction and Design Optimization
Operations Research: Inquiring Minds Want to Know! Evan Glazer Thomas Jefferson High School for Science and Technology.
1 Lecture #5 Variational Approaches and Image Segmentation Lecture #5 Hossam Abdelmunim 1 & Aly A. Farag 2 1 Computer & Systems Engineering Department,
Visibility Computations: Finding the Shortest Route for Motion Planning COMP Presentation Eric D. Baker Tuesday 1 December 1998.
Path Planning with the humanoid robot iCub Semester Project 2008 Pantelis Zotos Supervisor: Sarah Degallier Biologically Inspired Robotics Group (BIRG)
1 Processing & Analysis of Geometric Shapes Shortest path problems Shortest path problems The discrete way © Alexander & Michael Bronstein, ©
Final Exam Tuesday, December 9 2:30 – 4:20 pm 121 Raitt Hall Open book
Berkeley slides were used for this tutorial 1 Internet Networking Spring 2003 Tutorial 3 DUAL Algorithm.
Network Coding for Large Scale Content Distribution Christos Gkantsidis Georgia Institute of Technology Pablo Rodriguez Microsoft Research IEEE INFOCOM.
Numerical geometry of non-rigid shapes
Directed Graph Algorithms CSE 373 Data Structures Lecture 14.
Motion Analysis (contd.) Slides are from RPI Registration Class.
The Fourth WIM Meeting 1 Active Nearest Neighbor Queries for Moving Objects Jan Kolar, Igor Timko.
Greedy Algorithms Reading Material: Chapter 8 (Except Section 8.5)
1 Numerical geometry of non-rigid shapes A journey to non-rigid world objects Numerical methods non-rigid Alexander Bronstein Michael Bronstein Numerical.
Berkeley slides were used for this tutorial1 Internet Networking Spring 2006 Tutorial 2 DUAL Algorithm.
Informed Search Idea: be smart about what paths to try.
Package Transportation Scheduling Albert Lee Robert Z. Lee.
Mathematics for Computer Graphics (Appendix A) Won-Ki Jeong.
Particle Filter & Search
Packet-Switching Networks Routing in Packet Networks.
1 Fast Marching Method for generic Shape From Shading E. Prados & S. Soatto RFIA 2006 January 2006, Tours, France.
Geometry Vectors CONFIDENTIAL.
Computational Geometry The systematic study of algorithms and data structures for geometric objects, with a focus on exact algorithms that are asymptotically.
Introduction This chapter gives you several methods which can be used to solve complicated equations to given levels of accuracy These are similar to.
Chapter 1 Computing Tools Analytic and Algorithmic Solutions Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Distributed Algorithms Rajmohan Rajaraman Northeastern University, Boston May 2012 Chennai Network Optimization WorkshopDistributed Algorithms1.
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Chapter 5 Network Layer.
References: Wikipedia PHYSICS + VECTORS.  Why physics?  Good for every game developer to know.  Physics formulae are often vector-based  A good chance.
Chapter 1 Computing Tools Analytic and Algorithmic Solutions Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
Dot Product Second Type of Product Using Vectors.
8-6 Vectors Holt Geometry.
Course 8 Contours. Def: edge list ---- ordered set of edge point or fragments. Def: contour ---- an edge list or expression that is used to represent.
CS 484 Load Balancing. Goal: All processors working all the time Efficiency of 1 Distribute the load (work) to meet the goal Two types of load balancing.
Chapter 10 Minimization or Maximization of Functions.
A Framework for Reliable Routing in Mobile Ad Hoc Networks Zhenqiang Ye Srikanth V. Krishnamurthy Satish K. Tripathi.
Systems Realization Laboratory Lecture 1: Course Overview Chris Paredis G.W. Woodruff School of Mechanical Engineering Manufacturing Research Center Georgia.
Multiplication of vectors Two different interactions (what’s the difference?)  Scalar or dot product : the calculation giving the work done by a force.
Adaptive Radio Interferometric Positioning System Modeling and Optimizing Positional Accuracy based on Hyperbolic Geometry.
Example Apply hierarchical clustering with d min to below data where c=3. Nearest neighbor clustering d min d max will form elongated clusters!
Computing Reaction Path: A New Perspective of Old Problem Bijoy Dey “Basic research is what I am doing when I don’t know what I am doing.” Wernher von.
Dave Lattanzi’s Laplace Planner. Laplace Solution Store node charges as a dictionary – Originally used state variables and nodeList Find Laplace solution.
Chapter 14 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
UW EXTENSION CERTIFICATE PROGRAM IN GAME DEVELOPMENT 2 ND QUARTER: ADVANCED GRAPHICS Advanced Math.
6/12/2016© 2010 Raymond P. Jefferis IIILect The Network Layer.
Operations Research II Course,, September Part 2: Network Flow Operations Research II Dr. Aref Rashad.
Centralized vs Distributed Routing
Introduction to the Finite Element Method
Shortest Path from G to C Using Dijkstra’s Algorithm
Analytics and OR DP- summary.
Morphing and Shape Processing
Introduction to Graphics Modeling
Industrial Power Sails for Ocean Shipping
Single-Source Shortest Paths
Interpolating and extrapolating information
Chapter 7 Packet-Switching Networks
Directed Graph Algorithms
Directed Graph Algorithms
Chapter 2 A Survey of Simple Methods and Tools
CISE-301: Numerical Methods Topic 1: Introduction to Numerical Methods and Taylor Series Lectures 1-4: KFUPM CISE301_Topic1.
Vectors.
Presentation transcript:

MaxSea International Software editor for marine market MaxSea is distributed in 25 countries Available in 13 languages ships equiped

Our group H OLDING B IDART - F RANCE S OFTWARE B IDART - F RANCE C OMMERCIAL, S ALES, M ARKETING, SUPPORT B ARCELONA - S PAIN S OFTWARE P ORTLAND - USA C HARTS B IDART - F RANCE 75 E MPLOYES T URNOVER 2012: 6.2 M€ (+10%)

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

Cameras FLIR (IR, night vision…)

Isochrones for minimum time route optimization Wind polar Wave polar Set sail Weather prediction (wind, waves) Currents Optimal route

DEMO

Isochrone : Dynamic programming N Objective: Maximize distance for a given time interval ∆t DStep n →Isochrone at time ζ Reference : Knmi publicatie met nummer : On minimal-time ship routing S.J. Bijlsma 1975

N D Wind Polars Isochrone : Dynamic programming

N D a d1d1 d2d2 d3d3 d4d4 What is the shorter path ? Isochrone : Dynamic programming

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

N D Repeat for all isochrone point, you construct next isochrone. Isochrone : Dynamic programming

Next isochrone (dash) Optimization becomes a geometrical optimization. Not easy to resolve, in good computational time, taking into account numerical precision. Multiple path for optimal route at intersection point. Isochrone : Dynamic programming

Route optimization for motor boats Main goal: fuel consumption optimization. But also limit weather conditions. Several types of boats – Motor – Motor with sail assistance – Motor Sailing – Sailing

3D Routing New problem : find best course (2d) and best motor speed (power) to minimize fuel consumption. Motor and MotorSail boats have round speed polars (motor always on) => isochrones are isodistance (shortest path).

Fuel Consumption models Motor : – Hydro & areo dynamic forces + motor consumption curve. – Approximation 2 nd degree from speed inside speed limits (18-25kts) : Conso t/nm = *V V (not linear) Motor Sailing : mutilple Wind polar curves (for each motor power / sail %).

Fast Marching Method Ordered Upwind Method We wanted a new method for 2D & 3D (more easy to implement than 3D geometric calculation). Differential equation : Consumption = f(x,y,t,course,motor power). Front propagation. Strong anisotropy : wind and wind polar (sailing) or waves.

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

Ordered Upwind Method Smallest Considered is removed from Sorted Queue. It becomes the Last Accepted.

Ordered Upwind Method All Neighbors of Last Accepted are updated. Cost and Arrival Time are computed.

Ordered Upwind Method Again, smallest Considered => Last Accepted

Ordered Upwind Method The Front advanced with 2 new Accepted. Loop until arrival point is reached.

3D OUM

OUM : 3 update methods Direct Cost : from a node to horizontal, vertical or diagonal node. Enumeration : minimise over 20 angles (original method from Vladimirsky) Gradiant : from downwind gradiant, select best speed vector in polar, use it to compute upwind.

Enumeration Linear cost interpolation between U2 & U3. 20 angles tried for minimization.

Gradiant, when 3 accepted neighboors

DEMO

Experience Difficult to validate results : reference solution. Gradiant was working during unit testing, we found problems during integration. Parallel algorithm is not evidence. Software optimization is needed for interactive simulations.