Patents by Inventor M. Scott Wills

M. Scott Wills 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).

  • Patent number: 7558740
    Abstract: A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The scheduling system utilizes a cost reactive resource scheduler to minimize resource exception while at the same time minimizing the global costs associated with the solution. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system.
    Type: Grant
    Filed: August 18, 2004
    Date of Patent: July 7, 2009
    Assignee: Harris Corporation
    Inventors: William L. Matheson, Paul M. Julich, Michael S. Crone, Douglas A. Thomae, Thu V. Vu, M. Scott Wills
  • Patent number: 7539624
    Abstract: A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The scheduling system utilizes a cost reactive resource scheduler to minimize resource exception while at the same time minimizing the global costs associated with the solution. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system.
    Type: Grant
    Filed: May 16, 2003
    Date of Patent: May 26, 2009
    Assignee: Harris Corporation
    Inventors: William L. Matheson, Paul M. Julich, Michael S. Crone, Douglas A. Thomae, Thu V. Vu, M. Scott Wills
  • Patent number: 7343314
    Abstract: A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The scheduling system utilizes a cost reactive resource scheduler to minimize resource exception while at the same time minimizing the global costs associated with the solution. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system.
    Type: Grant
    Filed: May 16, 2003
    Date of Patent: March 11, 2008
    Assignee: Harris Corporation
    Inventors: William L. Matheson, Paul M. Julich, Michael S. Crone, Douglas A. Thomae, Thu V. Vu, M. Scott Wills
  • Patent number: 7340328
    Abstract: A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The scheduling system utilizes a cost reactive resource scheduler to minimize resource exception while at the same time minimizing the global costs associated with the solution. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system.
    Type: Grant
    Filed: May 16, 2003
    Date of Patent: March 4, 2008
    Assignee: Harris Corporation
    Inventors: William L. Matheson, Paul M. Julich, Michael S. Crone, Douglas A. Thomae, Thu V. Vu, M. Scott Wills
  • Patent number: 7222083
    Abstract: A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The scheduling system utilizes a cost reactive resource scheduler to minimize resource exception while at the same time minimizing the global costs associated with the solution. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system.
    Type: Grant
    Filed: May 16, 2003
    Date of Patent: May 22, 2007
    Assignee: Harris Corporation
    Inventors: William L. Matheson, Paul M. Julich, Michael S. Crone, Douglas A. Thomae, Thu V. Vu, M. Scott Wills
  • Publication number: 20040111309
    Abstract: A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The scheduling system utilizes a cost reactive resource scheduler to minimize resource exception while at the same time minimizing the global costs associated with the solution. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system.
    Type: Application
    Filed: May 16, 2003
    Publication date: June 10, 2004
    Inventors: William L. Matheson, Paul M. Julich, Michael S. Crone, Douglas A. Thomae, Thu V. Vu, M. Scott Wills, Michael S. Crone
  • Publication number: 20040093245
    Abstract: A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The scheduling system utilizes a cost reactive resource scheduler to minimize resource exception while at the same time minimizing the global costs associated with the solution. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system.
    Type: Application
    Filed: May 16, 2003
    Publication date: May 13, 2004
    Inventors: William L. Matheson, Paul M. Julich, Michael S. Crone, Douglas A. Thomae, Thu V. Vu, M. Scott Wills, Alan L. Polvika
  • Publication number: 20040034556
    Abstract: A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The scheduling system utilizes a cost reactive resource scheduler to minimize resource exception while at the same time minimizing the global costs associated with the solution. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system.
    Type: Application
    Filed: May 16, 2003
    Publication date: February 19, 2004
    Inventors: William L. Matheson, Paul M. Julich, Michael S. Crone, Douglas A. Thomae, Thu V. Vu, M. Scott Wills
  • Publication number: 20040010432
    Abstract: A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The scheduling system utilizes a cost reactive resource scheduler to minimize resource exception while at the same time minimizing the global costs associated with the solution. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system.
    Type: Application
    Filed: May 16, 2003
    Publication date: January 15, 2004
    Inventors: William L. Matheson, Paul M. Julich, Michael S. Crone, Douglas A. Thomae, Thu V. Vu, M. Scott Wills
  • Patent number: 5794172
    Abstract: A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system.
    Type: Grant
    Filed: January 23, 1997
    Date of Patent: August 11, 1998
    Assignee: Harris Corporation
    Inventors: William L. Matheson, Paul M. Julich, Michael S. Crone, Douglas A. Thomae, Thu V. Vu, M. Scott Wills
  • Patent number: 5623413
    Abstract: A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system.
    Type: Grant
    Filed: September 1, 1994
    Date of Patent: April 22, 1997
    Assignee: Harris Corporation
    Inventors: William L. Matheson, Paul M. Julich, Michael S. Crone, Douglas A. Thomae, Thu V. Vu, M. Scott Wills
  • Patent number: 5038398
    Abstract: A method of assigning communicaton links in a dynamic communication network, such as a network of earth orbiting satellites arranged, for example in three constellations. The assignments are made in phases, with the first phases assigning high priority link classes. Subsequent phases assign lower priority link classes. A set of constraints is established, and a high priority subset of these constraints can be assured by requiring that any assignment set to be accepted results in a network topology satisfying that subset of constraints even if existing links must be intentionally broken. Other constraints are met only if existing links need not be broken.
    Type: Grant
    Filed: August 9, 1989
    Date of Patent: August 6, 1991
    Assignee: Harris Corporation
    Inventor: M. Scott Wills