IPC분류정보
국가/구분 |
United States(US) Patent
등록
|
국제특허분류(IPC7판) |
|
출원번호 |
US-0208588
(2008-09-11)
|
등록번호 |
US-8134492
(2012-03-13)
|
발명자
/ 주소 |
|
출원인 / 주소 |
- Lockheed Martin Corporation
|
대리인 / 주소 |
|
인용정보 |
피인용 횟수 :
6 인용 특허 :
4 |
초록
▼
A radar volume in a cued direction is searched with sequential pencil beams. The allowable scan time is limited. The cued direction and uncertainty identify a search face, and the range gives a search volume. The number of beams required to scan the volume is determined, and compared with the maximu
A radar volume in a cued direction is searched with sequential pencil beams. The allowable scan time is limited. The cued direction and uncertainty identify a search face, and the range gives a search volume. The number of beams required to scan the volume is determined, and compared with the maximum time. If less than the maximum, the scan is initiated. If greater than the maximum time, the scan region about the cued volume is subdivided into smaller portions, each of which is scanned sequentially.
대표청구항
▼
1. A method for searching an angular region of a radar search volume about a given cued direction and with a maximum range, where the search of the radar search volume is performed with sequentially applied radar beams having defined beamwidths, said method comprising the steps of: acquiring error i
1. A method for searching an angular region of a radar search volume about a given cued direction and with a maximum range, where the search of the radar search volume is performed with sequentially applied radar beams having defined beamwidths, said method comprising the steps of: acquiring error information;from said error information, determining azimuth and elevation extents of a search face of the radar search volume about the cue direction;determining an angular extent of each of a plurality of radar beams in azimuth and elevation;from said angular extents in azimuth and elevation for each radar beam, determining a number of beams required to cover the search face of the radar search volume;determining a dwell time for each of the radar beams given the maximum range;taking a product of said number of beams multiplied by the dwell time per beam to obtain a search time;comparing said search time with a maximum allowable search time;initiating radar scanning over said search face with said number of beams if said search time is less that said maximum allowable search time; andpartitioning said search face into sub-search-faces if said search time is greater than said maximum allowable search time, and for each of said sub-search-faces, initiating radar scanning;wherein said step of determining the number of beams required to cover the search face includes the calculation of N=[1+2flr((Aext2ΔA)+(12))][1+2flr((Eext2ΔE)+(12))]+4[1+flr(Aext2ΔA)][1+flr(Eext2ΔE)] where: Aext is half the azimuth extent of the search face;Eext is half the elevation extent of the search face;ΔA is the azimuthal beam separation at constant elevation;ΔA=(β/2)cos α, where β is the beam width and α is equal to ½ the acute angle of the two lines that extend from the center of a radar beam to the points of intersection of the circumference of the beam with the circumference of an adjacent beam;ΔE is the elevation separation of the line of centers of the horizontal rows;ΔE=(β/2)(1+sin α); andflr is a floor function that truncates the argument to the highest integer less than the argument. 2. The method of claim 1, further comprising the step of obtaining cued target information together with said error information. 3. The method of claim 2, wherein said cued target information and said error information are provided from a first ship to a second ship. 4. The method of claim 3, wherein the second ship processes said cued target information received from the first ship and determines target azimuth and elevation extents of the search face. 5. The method of claim 4, wherein said step of partitioning said search face into sub-search-faces if said search time is greater than said maximum allowable search time comprises determining a modified search volume, wherein the modified search volume has a maximum search elevation defined such that the search time for the modified search volume is less than or equal to the maximum allowable search time. 6. The method of claim 1, wherein the search face comprises a two-dimensional slice of the search volume at a given range. 7. A system for searching an angular region of a radar search volume, said system comprising: a command and decision unit for:determining azimuth and elevation extents of a search face of the radar search volume about a cue direction from error information; anddetermining an angular extent of each of a plurality of radar beams in azimuth and elevation; and a radar beam controller for: from said angular extents in azimuth and elevation for each radar beam, determining a number of beams required to cover the search face of the search volume;determining a dwell time for each of the radar beams given a maximum range;taking a product of said number of beams multiplied by the dwell time per beam to obtain a search time;comparing said search time with a maximum allowable search time;initiating radar scanning over said search face with said number of beams if said search time is less that said maximum allowable search time; andpartitioning said search face into sub-search-faces if said search time is greater than said maximum allowable search time, and for each of said sub-search-faces, initiating radar scanning. 8. The system of claim 7, wherein said step of determining the number of beams required to cover the search face includes a calculation comprising: N=[1+2flr((Aext2ΔA)+(12))][1+2flr((Eext2ΔE)+(12))]+4[1+flr(Aext2ΔA)][1+flr(Eext2ΔE)]where: Aext is half the azimuth extent of the search face;Eext is half the elevation extent of the search face;ΔA is the azimuthal beam separation at constant elevation;ΔA=(β/2)cos α, where β is the beam width and α is equal to ½ the acute angle of the two lines that extend from the center of a radar beam to the points of intersection of the circumference of the beam with the circumference of an adjacent beam;ΔE is the elevation separation of the line of centers of the horizontal rows;ΔE=(β/2)(1+sin α); andflr is a floor function that truncates the argument to the highest integer less than the argument. 9. The system of claim 7, wherein said step of partitioning said search face into sub-search-faces if said search time is greater than said maximum allowable search time comprises determining a modified search volume, wherein the modified search volume has a maximum search elevation defined such that the search time for the modified search volume is less than or equal to the maximum allowable search time. 10. The system of claim 7, wherein the search face comprises a two-dimensional slice of the search volume at a given range. 11. The system of claim 7, further comprising a first ship and a second ship, the first ship providing the second ship with the error information and the second ship including the command and decision unit and the beam controller. 12. The system of claim 11, wherein the first ship further provides the second ship with cued target information. 13. The system of claim 12, wherein the command and decision unit uses the cued target information to determine the azimuth and elevation extents of the search face. 14. A method for searching a portion of a radar search volume, said method comprising the steps of: determining azimuth and elevation extents of a search face of the search volume about the cue direction from error information;determining an angular extent of each of a plurality of radar beams in azimuth and elevation;from said angular extents in azimuth and elevation for each radar beam, determining a number of beams required to cover the search face of the radar search volume;determining a dwell time for each of the radar beams given a maximum search range of said plurality of radar beams;obtaining a search time by multiplying said number of beams by the dwell time per beam;comparing said search time with a maximum allowable search time;initiating radar scanning of the search face if said search time is less than said maximum allowable search time; andreducing a size of said search face if said search time is greater than said maximum allowable search time, and for said reduced size search face, initiating radar scanning. 15. The method of claim 14, wherein said step of determining the number of beams required to cover the search face includes a calculation comprising: N=[1+2flr((Aext2ΔA)+(12))][1+2flr((Eext2ΔE)+(12))]+4[1+flr(Aext2ΔA)][1+flr(Eext2ΔE)]where: Aext is half the azimuth extent of the search face;Eext is half the elevation extent of the search face;ΔA is the azimuthal beam separation at constant elevation;ΔA=(β/2)cos α, where β is the beam width and α is equal to ½ the acute angle of the two lines that extend from the center of a radar beam to the points of intersection of the circumference of the beam with the circumference of an adjacent beam;ΔE is the elevation separation of the line of centers of the horizontal rows;ΔE=(β/2)(1+sin α); andflr is a floor function that truncates the argument to the highest integer less than the argument. 16. The method of claim 14, wherein the azimuth and elevation extents of the search face are determined from cued target information. 17. The method of claim 16, wherein said step of reducing a size of said search face comprises determining a modified search volume, wherein the modified search volume has a maximum search elevation defined such that the search time for the modified search volume is less than or equal to the maximum allowable search time. 18. The method of claim 17, wherein the search face comprises a two-dimensional slice of the search volume at a given range.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.