Data processing: vehicles – navigation – and relative location – Navigation – Determination of travel data based on the start point and...
Reexamination Certificate
2002-02-21
2004-04-06
Black, Thomas G. (Department: 3663)
Data processing: vehicles, navigation, and relative location
Navigation
Determination of travel data based on the start point and...
C345S440000, C345S421000, C345S428000, C342S070000, C342S073000, C342S02600R, C356S003070
Reexamination Certificate
active
06718261
ABSTRACT:
FIELD OF THE INVENTION
The present invention relates to a system for routing multiple sensors through a predefined area and, more particularly, to a system for scanning a target portion of the predefined area utilizing multiple sensors and coordinating the progress of the sensors through the predefined area.
BACKGROUND OF THE INVENTION
Various operations are becoming increasingly dependent on intelligent systems to guide the planning and execution of critical mission tasks. Planning missions by hand, or by large, ground-based computer systems is rapidly becoming obsolete in a world in which rapid access to information is almost as important as physical capability. One of the critical planning tasks involves the real-time route and sensor planning for a variety of mission scenarios. The missions may be military or civil and take place on land, sea or in the air. Developing algorithms and architectures to solve these problems is a rapidly growing area of interest. Once a large enough portion of an area has been scanned by one or more sensor equipped entities, other entities may safely enter the area and perform their various functions.
One of the main components of such planning operations involves the development of accurate and efficient route and sensor planning algorithms for a team comprising various team members. Most of the current research in this area focuses on the routing of a single entity between two stationary locations. In the real-world, situations are dynamic and the planning and replanning of such operations is generally considered the most critical part of a mission. If mission doctrine permits communication between the team members, then one approach is to do planning at a single location using intelligent software agents to achieve appropriate coordination.
Such planning operations include, but are certainly not limited to, reconnaissance and surveillance operations, coordinated attack patterns, coordinated team progression, traveling and bounding overwatch, and target handoff. These operations are needed for a variety of operational platforms including air, naval, ground, and various tactical combinations of all three.
Finding solutions to these team coordination problems is very difficult and can determine the difference between success and failure of the mission. It is unlikely that there will be expedient solutions for this class of problems. Thus, heuristic approaches are used to generate efficient solutions in real-time that are as good or better than a human could generate. Only limited research has been conducted for solving these types of problems. Not just limited to military and civil applications, team planning operations may be critical for commercial autonomous robotics as well as outer space related applications, commercial avionics, and intelligent transportation systems. As part of this area, it is also important to consider the task of real-time coordination and plan adjustment in the execution of distributed mission plans across heterogeneous platforms.
SUMMARY OF THE INVENTION
In accordance with one aspect of the present invention, 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.
In accordance with another aspect of the present invention, a system routes a plurality of entities through a predetermined area and for scanning the predetermined area. The system includes a plan for a plurality of entities, the plan including a plurality of routes and sets of scan points for each of the entities; a deterministic method for computing the plan; and a plurality of devices corresponding to each of the entities, the devices each performing routing and scanning operations independently from the other of the plurality of entities.
In accordance with still another aspect of the present invention, a computer program product determines a route for each of a plurality of entities through a predetermined area and analyzes the content of the predetermined area. The product includes a first instruction for implementing a deterministic method for computing a plan for each of the plurality of entities, the plan including a plurality of routes and sets of scan points for each of the entities; a second instruction for inputting the plan; and a third instruction for performing each of the first and second instructions by each of the plurality of entities independently from the other entities.
REFERENCES:
patent: 4323880 (1982-04-01), Lucas
patent: 4682160 (1987-07-01), Beckwith, Jr. et al.
patent: 4814711 (1989-03-01), Olsen et al.
patent: 4868755 (1989-09-01), McNulty et al.
patent: 4984168 (1991-01-01), Neukrichner et al.
patent: 5083256 (1992-01-01), Trovato et al.
patent: 5187667 (1993-02-01), Short
patent: 5204817 (1993-04-01), Yoshida
patent: 5247356 (1993-09-01), Ciampa
patent: 5268698 (1993-12-01), Smith, Sr. et al.
patent: 5458490 (1995-10-01), Cabana
patent: 5481479 (1996-01-01), Wight et al.
patent: 5497157 (1996-03-01), Gruener et al.
patent: 5629626 (1997-05-01), Russell et al.
patent: 5631640 (1997-05-01), Deis et al.
patent: 5636123 (1997-06-01), Rich et al.
patent: 5638282 (1997-06-01), Chazelle et al.
patent: 5646844 (1997-07-01), Gudat et al.
patent: 5668717 (1997-09-01), Spall
patent: 5712788 (1998-01-01), Liaw et al.
patent: 5724125 (1998-03-01), Ames
patent: 5731978 (1998-03-01), Tamai et al.
patent: 5751576 (1998-05-01), Monson
patent: 5790123 (1998-08-01), Wald et al.
patent: 5815417 (1998-09-01), Orr et al.
patent: 5838262 (1998-11-01), Kershner et al.
patent: 5883586 (1999-03-01), Tran et al.
patent: 5884223 (1999-03-01), Tognazzini
patent: 5892462 (1999-04-01), Tran
patent: 5928294 (1999-07-01), Zelinkovsky
patent: 5999881 (1999-12-01), Law et al.
patent: 6038509 (2000-03-01), Poppen et al.
patent: 6047234 (2000-04-01), Cherveny et al.
patent: 6076042 (2000-06-01), Tognazzini
patent: 6085147 (2000-07-01), Myers
patent: 6092009 (2000-07-01), Glover
patent: 6122572 (2000-09-01), Yavnai
patent: 6128574 (2000-10-01), Diekhans
patent: 6134500 (2000-10-01), Tang et al.
patent: 6148259 (2000-11-01), Hagelauer
patent: 6167331 (2000-12-01), Matsumoto et al.
patent: 6169981 (2001-01-01), Werbos
patent: 6173219 (2001-01-01), Deker
patent: 6175802 (2001-01-01), Okude et al.
patent: 6175804 (2001-01-01), Szczerba
patent: 6182007 (2001-01-01), Szczerba
patent: 6201496 (2001-03-01), Lee
patent: 6212471 (2001-04-01), Stiles et al.
patent: 6236351 (2001-05-01), Conner et al.
patent: 6512476 (2003-01-01), Woodell
patent: 2002/0036584 (2002-03-01), Jocoy et al.
patent: 3511960 (1986-10-01), None
Didomizio Virginia A.
Hoebel Louis J.
Mattheyses Robert M.
Moitra Abha
Szczerba Robert J.
Black Thomas G.
Lockheed Martin Corporation
Tarolli, Sundheim Covell & Tummino L.L.P.
To Tuan C
LandOfFree
Architecture for real-time maintenance of distributed... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Architecture for real-time maintenance of distributed..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Architecture for real-time maintenance of distributed... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3198027