Lockheed Martin Corporation

General Electric Company

Lockhead Martin Corp.

Louis John Hoebel

Boris Yamrom

Virginia Ann DiDomizio

Robert J Szczerba

Abha Moitra

Robert Marcel Mattheyses

Walter Vincent Dixon, Iii

John Michael Lizzi

Rajesh Venkat Subbu

Daniel Joseph Cleary

Steven Eric Linthicum

Christopher Richard Volpe

Gerald Bowden Wise

Jonathan Peter Stillman

Scott D Epter

Osman Rifki Oksoy

Russell Scott Blue

Jonathan Dehn

Tomek Strzalkowski

Liviu Nedelescu

Craig Arthur Silber

Paul W Mettus

Jennifer M Corman

Bradley A Culbertson

Systems and methods for airspace demand prediction with improved sector level demand prediction are provided. In one embodiment, an air traffic demand prediction system () operable to predict demand within an airspace divided into sectors includes an expanded route predictor () operable to generate predicted two-dimensional expanded route information () associated with at least one requested flight (), a trajectory modeler () operable to generate predicted four-dimensional expanded route information (), a sector crossing predictor () operable to generate predicted sector crossing information (), a departure time predictor () operable to generate predicted departure time information (), and a demand modeler () operable to generate a demand model (), the demand model () including predicted time intervals associated with the at least one requested flight indicating when it is expected to be present within one or more sectors of the airspace.

Air traffic demand prediction

A method routes a predefined number of entities () through a predetermined area for scanning the content of the predetermined area. The method comprises the steps of: partitioning the predetermined area into a first set of cells (); grouping the first set of cells () into a number of corridors () equal to the number of entities (); determining a starting cell for each entity () in each corridor (); initiating a scan of cells of each of the corridors () from the starting cell of each of the entities () and determining the content of each of the scanned cells; and determining a total cost for each entity () to travel to each of the scanned cells scanned by each entity () and performing a scan from each of the scanned cells by each entity ().

Real-time team coordination system for reconnaissance and surveillance missions

A method routes an entity () through a predetermined area for scanning the content of the predetermined area. The method comprises the steps of: partitioning the predetermined area into cells (); determining a starting cell for the entity (); initiating a scan of a number of the cells from the starting cell and determining the content of each of the number of cells; and determining a total cost for the entity () to travel to each of the scanned cells and to perform a scan from each of the scanned cells.

Real-time route and sensor planning system with variable mission objectives

A system and computer implemented method for enabling field service of machines and training of field service personnel. The method comprises the steps of generating at least one validated sequence of instructions for at least one maintenance task and delivering the at least one validated sequence for use in performing the at least one maintenance task.

Method and system for automated maintenance and training instruction generation and validation

A method routes an entity ( ) through a predetermined area for scanning the content of the predetermined area. The method includes the steps of: partitioning the predetermined area into cells ( ); determining a starting cell for the entity ( ); initiating a scan of a number of the cells from the starting cell and determining the content of each of the number of cells; and determining a total cost for the entity ( ) to travel to each of the scanned cells and to perform a scan from each of the scanned cells.

A method routes a plurality of entities ( ) through a predetermined area. The method includes the steps of: providing a plan; providing a deterministic method for computing the plan for the plurality of entities ( ), the plan including a plurality of routes and sets of scan points for each of the entities ( ); and performing the method by each of the plurality of entities ( ) independently from the other of the plurality of entities ( ).

Architecture for real-time maintenance of distributed mission plans

A method analyzes a plan for scanning the content of a predetermined area. The method includes the steps of: providing a plan for at least one entity ( ), the plan including a route and a set of scan points; and assigning an associated score for the plan in order to compare the plan to other plans, the score indicating the quality of the plan.

Architecture for automatic evaluation of team reconnaissance and surveillance plans

A method and system for accessing information or data from distributed databases is disclosed. Generally, the method includes the steps of receiving an unstructured query from a user, generalizing the query to expand the query, receiving from the user selected terms of the expanded query, searching a directory for database tables and/or attributes matching the selected terms, and generating a pictorial query using database tables suggested as relevant by the search. Thereafter, an SQL query may be generated to retrieve the relevant data from the actual distributed databases.

Method and system for universal querying of distributed databases

Growing community of inventors

Burnt Hills, NY, United States of America

Louis John Hoebel