Patents by Inventor Leonard B. Jansen

Leonard B. Jansen has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Computer-implemented systems and methods for planning a route
    Patent number: 9557182
    Abstract: Systems and methods are disclosed for determining shortest route(s) or path(s) to one or more destination nodes from one or more origin nodes. In accordance with one implementation, a computer-implemented method is provided that includes identifying a plurality of origin nodes associated with a route based on a threshold distance from at least one destination node, the origin nodes being options for a departure from the route to the at least one destination node. Further, the method may include calculating, using a processor, a cost associated with travelling from each of the origin nodes to at least one common intermediate node between the route and the at least one destination node, and determining a path to the at least one destination node based on the origin node having the lowest calculated cost.
    Type: Grant
    Filed: March 24, 2014
    Date of Patent: January 31, 2017
    Assignee: MapQuest, Inc.
    Inventors: David W. Nesbitt, Leonard B. Jansen
  • COMPUTER-IMPLEMENTED SYSTEMS AND METHODS FOR PLANNING A ROUTE
    Publication number: 20140207376
    Abstract: Systems and methods are disclosed for determining shortest route(s) or path(s) to one or more destination nodes from one or more origin nodes. In accordance with one implementation, a computer-implemented method is provided that includes identifying a plurality of origin nodes associated with a route based on a threshold distance from at least one destination node, the origin nodes being options for a departure from the route to the at least one destination node. Further, the method may include calculating, using a processor, a cost associated with travelling from each of the origin nodes to at least one common intermediate node between the route and the at least one destination node, and determining a path to the at least one destination node based on the origin node having the lowest calculated cost.
    Type: Application
    Filed: March 24, 2014
    Publication date: July 24, 2014
    Applicant: MapQuest, Inc.
    Inventors: David W. NESBITT, Leonard B. Jansen
  • Computer-implemented systems and methods for planning a route
    Patent number: 8681635
    Abstract: Systems and methods are disclosed for determining shortest route(s) or path(s) to one or more destination nodes from one or more origin nodes. In accordance with one implementation, a computer-implemented method is provided that includes identifying a plurality of origin nodes associated with a route based on a threshold distance from at least one destination node, the origin nodes being options for a departure from the route to the at least one destination node. Further, the method may include calculating, using a processor, a cost associated with travelling from each of the origin nodes to at least one common intermediate node between the route and the at least one destination node, and determining a path to the at least one destination node based on the origin node having the lowest calculated cost.
    Type: Grant
    Filed: December 30, 2010
    Date of Patent: March 25, 2014
    Assignee: MapQuest, Inc.
    Inventors: David W. Nesbitt, Leonard B. Jansen
  • COMPUTER-IMPLEMENTED SYSTEMS AND METHODS FOR PLANNING A ROUTE
    Publication number: 20110158232
    Abstract: Systems and methods are disclosed for determining shortest route(s) or path(s) to one or more destination nodes from one or more origin nodes. In accordance with one implementation, a computer-implemented method is provided that includes identifying a plurality of origin nodes associated with a route based on a threshold distance from at least one destination node, the origin nodes being options for a departure from the route to the at least one destination node. Further, the method may include calculating, using a processor, a cost associated with travelling from each of the origin nodes to at least one common intermediate node between the route and the at least one destination node, and determining a path to the at least one destination node based on the origin node having the lowest calculated cost.
    Type: Application
    Filed: December 30, 2010
    Publication date: June 30, 2011
    Inventors: David W. Nesbitt, Leonard B. Jansen