Access route optimization for harvestable resources

Patent metadata

Field	Value
Publication number	US-9528836-B2
Application number	US-201514853218-A
Country	US
Kind code	B2
Filing date	Sep 14, 2015
Priority date	Dec 11, 2014
Publication date	Dec 27, 2016
Grant date	Dec 27, 2016

Abstract

Methods and apparatuses for generating a route plan for accessing harvestable resources is provided. A processor receives a node layout for a location with harvestable resources, wherein the location includes at least two parcels. A processor determines a first route network for the location at a first time step. A processor determines a second route network for the location at a second time step. A processor generates a first route plan is based, at least in part, on the first route network and the second route network.

First claim

What is claimed is:

1. A method of generating a route plan for accessing harvestable resources, the method comprising:
receiving, by one or more processors, a node layout for a location with harvestable resources, wherein the location includes at least two parcels;
determining, by the one or more processors, a first route network for the location at a first time step;
determining, by the one or more processors, a second route network for the location at a second time step;
determining, by the one or more processors, a first cost-benefit ratio of a path of the first route network;
determining, by the one or more processors, a second cost-benefit ratio of the path of the second route network;
updating, by the one or more processors, the first route network and the second route network based, at least in part, on a differential between the first cost-benefit ratio and the second cost-benefit ratio, wherein the differential includes a weight that is based, at least in part, on a difference between the first time step and the second time step; and
generating, by the one or more processors, a first route plan is based, at least in part, on the first route network and the second route network.

2. The method of claim 1 , wherein the weight is inversely proportional to the difference between the first time step and the second time step.

3. The method of claim 1 , the method further comprising:
determining, by the one or more processors, a total cost of the first route network;
determining, by the one or more processors, a total cost of the updated first route network; and
generating, by the one or more processors, a second route plan in response to the total cost of the updated first route network having a smaller cost than the total cost of the first route network, wherein the second route plan is based, at least in part, on the updated first route network and the second route network.

4. The method of claim 1 , the method further comprising:
determining, by the one or more processors, locations of a plurality of nodes in the node layout based, at least in part, on (i) one or more boundaries between the at least two parcels and (ii) one or more directionalities of resources of the at least two parcels.

5. The method of claim 1 , wherein the first route network and the second route network are determined using a minimum cost-flow model.

Assignees

• IBM

Inventors

• Aas Cecilia J
• Glover Raymond S

Classifications

• G06Q10/06313

  Resource planning in a project environment · CPC title

• G01C21/20 Primary

  Instruments for performing navigational calculations (G01C21/24, G01C21/26 take precedence) · CPC title

• G01C21/34

  Route searching; Route guidance · CPC title

• G06Q10/047

  Optimisation of routes or paths, e.g. travelling salesman problem · CPC title

• G06Q50/02 Primary

  Agriculture; Fishing; Forestry; Mining · CPC title