IP Library Granted Patent US 12,277,527
Granted Patent B2
US 12,277,527 · App. 18/500,949 · Granted Apr 15, 2025

Carrier path prediction based on dynamic input data

Inventors: Ioannis Martinos (Athens, GR); Dimitrios Tasoulis (Athens, GR); Michail Epitropakis (Athens, GR); Roussos Paschopoulos (Athens, GB); Emilio Frazzoli (Boston, MA)
Assignee: Signal Ocean Ltd
G06Q10/08355H04L67/10B63B79/40G06F16/29
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,277,527
App. No.
18/500,949
Granted
Apr 15, 2025
Kind
B2
Abstract

A method and system for managing carrier vessel information are provided. A carrier path and shipment planning system receives carrier information associated with individual carrier vessels from a plurality of carrier information sources. Based on the carrier information the carrier path and shipment planning system processes the carrier information to form complete path scenarios. The carrier path and shipment planning system associates control rules to the complete path scenarios to determine one or more candidate paths. The carrier path and shipment planning system can then generate various interfaces for identifying selected, ranked paths, information associated with a competitive marketplace and availability information for contracting for cargo shipment. A user can then further manipulate the user interfaces for scenario planning or filtering available selections.

Claims (39)

1. A computer-implemented method comprising:

obtaining a set of carrier information for individual identifiable vessels;

forming a plurality of skeleton scenario paths for the individual identifiable vessels from the set of carrier information, wherein each skeleton scenario path of the plurality of skeleton scenario paths for the individual identifiable vessels is defined by one or more anchor points;

selecting a first portion of a plurality of target paths corresponding to a first portion of the skeleton paths;

assigning attributes to the first portion of the plurality of target paths, wherein an attribute associated with individual target paths is based on a determined probability that the individual target path is a correct travel path for the identifiable vessel; and

generating a ranked list of the plurality of target paths for the individual identifiable vessels based on application of a scoring function, wherein the scoring function is at least in part based on the attributes.

2. The computer-implemented method as claim 1 further comprising automatically combining a second portion of the plurality of skeleton scenario paths to form a second portion of the plurality of target paths for the individual identifiable vessels, wherein the second portion of the plurality of skeleton scenario paths are combined according to common anchor points.

3. The computer-implemented method as recited in claim 2 , further comprising assigning attributes to the second portion of the plurality of target paths.

4. The computer-implemented method as recited in claim 1 wherein the determined probability that the individual target path is a correct travel path for the identifiable vessel includes historical voyage information.

5. The computer-implemented method as recited in claim 1 further comprising for defined locations, generating a value indicator associated with a density of at least subset of individual identifiable vessels.

6. The computer-implemented method as recited in claim 1 wherein the first portion of the plurality of skeleton paths include skeleton paths in the plurality of skeleton paths that are not combinable by anchor points.

7. The computer-implemented method as recited in claim 1 further comprising adjusting the ranked list based on additional inputs.

8. The computer-implemented method as recited in claim 1 , wherein application of the scoring function includes scoring the plurality of target paths according to control rules recalled from a control rules memory and defining a scoring function to be applied to the target path, wherein the control rules are applied to the plurality of target paths.

9. The computer-implemented method of claim 8 , wherein the control rules applied by a carrier path and shipment planning service associate a score to a target path based on a determined degree of suitability for the target path.

10. The computer-implemented method of claim 8 , wherein the control rules applied by a carrier path and shipment planning service associate a score to a target path based on a determined degree of feasibility for the target path.

11. The computer-implemented method as recited in claim 1 further comprising receiving the set of carrier information from a plurality of carrier information sources.

12. The computer-implemented method as recited in claim 1 , wherein the set of carrier information is received in accordance with specific application programming information, wherein individual application programming information corresponds to a different format of carrier information.

13. The computer-implemented method of claim 1 , wherein generating a ranked list of the plurality of target paths for the individual identifiable vessels based on application of a scoring function includes applying a penalty model to the plurality of target paths, the penalty model reflective of location information included in the plurality of target paths.

14. The computer-implemented method as recited in claim 1 wherein generating a ranked list of the plurality of target paths for the individual identifiable vessels is further based on application of a penalty model.

15. The computer-implemented method as recited in claim 14 wherein application of a penalty model comprises applying a penalty for repairs, stops, loading, or discharging.

16. The computer-implemented method as recited in claim 1 further comprising generating a graph representative of the first portion of the plurality of target paths.

17. The computer-implemented method as recited in claim 16 wherein the graph is based on the probability that the individual target path is correct.

18. A computer-implemented method comprising:

forming a plurality of skeleton scenario paths for individual identifiable vessels from a set of carrier information, wherein each skeleton scenario path of the plurality of skeleton scenario paths for the individual identifiable vessels is defined by one or more anchor points;

identifying a first subset of a plurality of target paths corresponding to a portion of the plurality of skeleton paths;

assigning individual attributes to individual target paths in the first subset of the plurality of target paths, wherein a attribute associated with each individual target path is based on a characterization of probability of the first individual target paths accurately encompasses a path of travel for the identifiable vessel; and

automatically combining a second subset of the plurality of skeleton scenario paths to form a second portion of the plurality of target paths for the individual identifiable vessels, wherein the second subset of the plurality of skeleton scenario paths are combined according to common anchor points; and

scoring the plurality of target paths according to control rules recalled from a control rules memory and defining a scoring function to be applied to the target path, wherein the control rules are applied to the plurality of target paths and are at least in part based on attributes.

19. The computer-implemented method as recited in claim 18 , wherein the probabilities are at least in part based on historical voyage information.

20. The computer-implemented method as recited in claim 18 further comprising generating an interface responsive to a request, the interface including density information of at least subset of individual identifiable vessels.

21. The computer-implemented method as recited in claim 18 wherein the first subset of the plurality of skeleton paths are not combinable by anchor points.

22. The computer-implemented method as recited in claim 18 , wherein scoring the plurality of target paths includes scoring the plurality of target paths continuously during a voyage.

23. A computer-implemented method comprising:

forming a plurality of skeleton scenario paths for individual identifiable vessels from information associated with activities attributable to the individual identifiable vessels and wherein each skeleton scenario path of the plurality of skeleton scenario paths for the individual identifiable vessels is defined by one or more anchor points;

for a first subset of a plurality of target paths, associating a probability that individual target paths of the first subset of the plurality of target paths is correct;

assigning attributes to the first subset of the plurality of target paths, wherein a attribute associated with individual target paths is based on the associated probability that the individual target paths of the first subset of the plurality of target paths is correct; and

scoring the plurality of target paths according to control rules recalled from a control rules memory and defining a scoring function to be applied to the plurality of target paths, wherein the control rules are applied to the plurality of target paths to generate a ranked list of target paths and are at least in part based on the attributes.

24. The computer-implemented method of claim 23 , wherein the information associated with activities attributable to the individual identifiable vessels is based on a plurality of carrier information sources.

25. The computer-implemented method as recited in claim 23 , wherein the probabilities are based on historical voyage information.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 11, 2025
From: MARTINOS, IOANNIS; TASOULIS, DIMITRIOS; EPITROPAKIS, MICHAIL; PASCHOPOULOS, ROUSSOS; FRAZZOLI, EMILIO
To: SIGNAL MARITIME LONDON LTD
Reel/Frame 070184/0399 →
CHANGE OF NAME Recorded Feb 11, 2025
From: SIGNAL MARITIME LONDON LTD
To: SIGNAL OCEAN LTD
Reel/Frame 070184/0452 →
Continuity (3)
Continuation 17228452 · Apr 12, 2021
Continuation 16000641 · Jun 5, 2018
Related Publication 20240062149A1 · Feb 22, 2024
References Cited (85)
US 6865476B1 · Jokerst, Sr. · 2005 [cited by applicant]
US 6885919B1 · Wyant et al. · 2005 [cited by applicant]
US 7471995B1 · Robinson · 2008 [cited by applicant]
US 7930102B2 · Brent et al. · 2011 [cited by applicant]
US 8155811B2 · Noffsinger et al. · 2012 [cited by applicant]
US 9030353B2 · Kubota · 2015 [cited by examiner]
US 9037406B2 · Mason et al. · 2015 [cited by applicant]
US 9157756B2 · Mason et al. · 2015 [cited by applicant]
US 9228846B2 · Deluca et al. · 2016 [cited by applicant]
US 9541403B2 · Ohmori · 2017 [cited by examiner]
US 9552564B1 · Martenis · 2017 [cited by applicant]
US 9581461B1 · Chintakindi et al. · 2017 [cited by applicant]
US 9727976B1 · Perkins et al. · 2017 [cited by applicant]
US 9959647B1 · Brost et al. · 2018 [cited by applicant]
US 10048075B2 · Wang · 2018 [cited by applicant]
US 10054443B1 · Patel et al. · 2018 [cited by applicant]
US 10077983B2 · Okuda · 2018 [cited by examiner]
US 10281920B2 · Frazzoli · 2019 [cited by examiner]
US 10526059B2 · Morita · 2020 [cited by examiner]
US 10977605B2 · Martinos · 2021 [cited by examiner]
US 11112793B2 · Frazzoli · 2021 [cited by examiner]
US 11378955B2 · Censi · 2022 [cited by examiner]
US 11392120B2 · Censi · 2022 [cited by examiner]
US 11460842B2 · Frazzoli · 2022 [cited by examiner]
US 20040193367A1 · Cline · 2004 [cited by applicant]
US 20050119923A1 · Ladonnikov et al. · 2005 [cited by applicant]
US 20050124291A1 · Hart et al. · 2005 [cited by applicant]
US 20050216182A1 · Hussain et al. · 2005 [cited by applicant]
US 20050256639A1 · Aleksic et al. · 2005 [cited by applicant]
US 20050265582A1 · Buehler et al. · 2005 [cited by applicant]
US 20060161337A1 · Ng · 2006 [cited by applicant]
US 20080010006A1 · Schwarzmann · 2008 [cited by applicant]
US 20080125958A1 · Boss et al. · 2008 [cited by applicant]
US 20080249667A1 · Horvitz et al. · 2008 [cited by applicant]
US 20080255757A1 · Bruce et al. · 2008 [cited by applicant]
US 20090063032A1 · Das · 2009 [cited by applicant]
US 20090161797A1 · Cowles et al. · 2009 [cited by applicant]
US 20090210142A1 · Couckuyt et al. · 2009 [cited by applicant]
US 20100191461A1 · Zeng · 2010 [cited by applicant]
US 20100280750A1 · Chen et al. · 2010 [cited by applicant]
US 20110118978A1 · Li · 2011 [cited by applicant]
US 20110215948A1 · Borgerson et al. · 2011 [cited by applicant]
US 20110257819A1 · Chen et al. · 2011 [cited by applicant]
US 20120084000A1 · Wang et al. · 2012 [cited by applicant]
US 20120130570A1 · Pease · 2012 [cited by applicant]
US 20130022234A1 · U S et al. · 2013 [cited by applicant]
US 20130063300A1 · O'Regan et al. · 2013 [cited by applicant]
US 20130124088A1 · Bruce et al. · 2013 [cited by applicant]
US 20130262162A1 · Haney et al. · 2013 [cited by applicant]
US 20140058775A1 · Siig et al. · 2014 [cited by applicant]
US 20140067267A1 · Kolbe et al. · 2014 [cited by applicant]
US 20140164390A1 · Hampapur et al. · 2014 [cited by applicant]
US 20140180566A1 · Malhotra · 2014 [cited by applicant]
US 20140218242A1 · Platzer · 2014 [cited by applicant]
US 20140309931A1 · Ohmori · 2014 [cited by examiner]
US 20150067599A1 · Germain et al. · 2015 [cited by applicant]
US 20150168161A1 · Raychev et al. · 2015 [cited by applicant]
US 20150168169A1 · Caceres et al. · 2015 [cited by applicant]
US 20150330803A1 · Okuda · 2015 [cited by examiner]
US 20170087996A1 · Lin · 2017 [cited by examiner]
US 20170253308A1 · Morita · 2017 [cited by examiner]
US 20170277193A1 · Frazzoli · 2017 [cited by examiner]
US 20190370746A1 · Martinos · 2019 [cited by examiner]
US 20230081665A1 · Izumikawa · 2023 [cited by examiner]
FR 3053780A1 · 2018 [cited by examiner]
WO WO2016042932A1 · 2016 [cited by examiner]
WO WO2016160853 · 2016 [cited by applicant]
WO WO2016160853A1 · 2016 [cited by examiner]
Data Collection for Career Path Prediction Based on Analysing Body of Knowledge of Computer Science Degrees (Year: 2018). [cited by examiner]
Data Collection for Career Path Prediction Based on Analysing Body of Knowledge of Computer Science Degree (Year 2018) (Year: 2018). [cited by examiner]
Alexandrer Artikis, “Event Recognition for Maritime Surveillance”, EDBT, 2015, all pages (Year: 2015). [cited by applicant]
Claramunt, “Maritime data integration and analysis: Recent progress and research challenges”. Advances in Database Technology—EDBT, 2017, pp. 192-197 (Year: 2017). [cited by applicant]
Dimitrios Zissis, “Real time vessel behavior prediction”, published by Springer-Verlag in 2015 (Year: 2015). [cited by applicant]
Fabio Mazzarella and “Knowledge based vessel position prediction using historical AIS data”, published by IEEE Xplore, on Dec. 17, 2015, all pages (Year: 2015). [cited by applicant]
Gerben De Vries, “Comparing Vessel Trajectories using Geographical Domain Knowledge and Alignments”, IEEE, 2010, all pages. (Year: 2010). [cited by applicant]
Giuliana Pallota, “Vessel Pattern Knowledge Discovery from AIS Data: A Framework for Anomaly Detection and Route Prediction”, entropy journal, 2013, all pages (Year: 2013). [cited by applicant]
Nicolas Le Guillarme, “Unsupervised Extraction of Knowledge from S-AIS Data for Maritime Situational Awareness”, ISIF, 2013, all pages (Year: 2013). [cited by applicant]
Niels Willems, “Visualization of vessel movements”, IEEE, 2009, all pages (Year: 2009). [cited by applicant]
O.M. Mevassvik, “Fusion of Radar Tracks, Reports and Plans”, ISIF, 2000, all pages (Year: 2000). [cited by applicant]
Peiguo Fu, “Finding Abnormal Vessel Trajectories Using Feature Learning”, IEEE, 2017, all pages (Year: 2017). [cited by applicant]
Ralph Lange, “efficient real time trajectory tracking”, Springer, 2011, all pages (Year: 2011). [cited by applicant]
Wayan Wijaya, “Predicting Ship Behavior Navigating Through Heavily Trafficked Fairways by Analyzing AIS Data on Apache HBase”, FISCN, 2013, all pages (Year: 2013). [cited by applicant]
Xianbin Wu, “Vessel Trajectory Partitioning Based on Hierarchical Fusion of Position Data”, published by 18th International Conference on Informaiton Fusion, in 2015 (Year: 2015). [cited by applicant]
Yan Li, “Trajectory Compression-Guided Visualization of Spatio-Temporal AIS Vessel Density”, published in 2016 8th International Conference on Wireless Communications & Signal Processing, in 2016 (Year: 2016). [cited by applicant]
Zhixian Yan, “Semantic Trajectories: Mobility Data Computation and Annotation”, ACM transactions on Intelligent Systems and Technology, vol. 4, No. 3, 2013, all pages. (Year: 2013). [cited by applicant]