General Electric Company

Lockheed Martin Corporation

Robert Marcel Mattheyses

Robert J Szczerba

Abha Moitra

Boris Yamrom

Louis John Hoebel

Virginia Ann DiDomizio

Avinash Vinayak Taware

James Kenneth Aragones

Ronald George Maruscik

Carol Lynn Kiaer

Kim P Gostelow

Per-Erik Danielsson

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 method for facilitating an optimization of a control space in n dimensions is provided. The control space includes a plurality of points, and the method includes removing at least one hyperplane of the control space, and perturbing the remaining points of the control space to lessen errors relative to the control space prior to the removal of at least one hyperplane.

Methods and apparatus for reducing hyperplanes in a control space

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 for determining the length of data strings on a distributed processing system is disclosed. The method assigns a sequential position value to each element in the string, the position value zero being assigned to the true head element. The sequential position value of each element exceeds by one the sequential position value of the immediately succeeding element in the string. After identification of the tail element of the string, the sequential value of the tail element is incremented by one to yield the string length.

String length determination on a distributed processing system

A distributed processing system comprising an array of elements each including a plurality of communication ports on which to send or receive data signals is disclosed. Each element further includes means, under program control, for transposing predetermined ones of the received data signals prior to selection of one data signal for processing. By performing data signal transposition in selected elements in the array, data signal propagation through the array can be arbitrarily controlled.

Distributed processing system including reconfigurable elements

A method for partitioning an original string of data elements into two substrings on a distributed processing system is disclosed. The elements are each of a first or a second type and the original string consists of a plurality of string fragments each composed of elements of only one type. The method operates to pass the identity of each fragment tail element to the head element of the next fragment, further from a true head element of the original string, composed of the same type elements as the tail element. The passed identities enable forming the two substrings from fragments of the same type elements.

Automated method implemented on a distributed data processing system for

A method for histogramming the pixel values of image data elements, on a distributed processing system, is disclosed. First, the data elements are formed into a data string. Next, the data string is partitioned into a plurality of homogeneous filaments each composed only of data elements having the same pixel value. Finally, the number of data elements composing each homogeneous filament is determined, the determined number being the histogram result for the pixel value corresponding to that homogeneous filament.

Histogramming of pixel values on a distributed processing system

A communication network, for transmitting message signals, comprising a plurality of routing nodes and a method for routing message signals through the network are disclosed. The network comprises a plurality of the routing nodes interconnected in stages. Each routing node includes a memory for storing a destination portion of a message signal. Upon subsequent recall of the stored destination portion, a previous route can be reestablished and a message signal absent the destination portion transmitted therethrough.

Circuit switching network with routing nodes

Configured for accelerated operation of processing elements in a SIMD parallel processing system is disclosed. The output of an exclusive-OR gate is coupled to one input of the element ALU while a first input of the gate is adapted to receive signals intended for the ALU input. Upon loading a `1` bit into a register coupled to a gate second input, signals applied to the gate first input are complemented and applied to the ALU input. As a result, different arithmetic and logic operations can be performed simultaneously by different elements in the processing system in response to a single series of instructions.

Growing community of inventors

Schenectady, NY, United States of America

Robert Marcel Mattheyses