Method for a deeper search in a time-limited image satellite planning environment
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G05D-001/00
G01C-021/24
출원번호
US-0534789
(2009-08-03)
등록번호
US-8386098
(2013-02-26)
발명자
/ 주소
Bailey, David A.
출원인 / 주소
Bailey, David A.
인용정보
피인용 횟수 :
0인용 특허 :
3
초록▼
The present invention relates to image satellite planning, and more particularly to a method for allowing a deeper search for high value targets in a time-limited planning environment. In an exemplary embodiment, a method of computing an ordered subset of targets includes using an approximation for
The present invention relates to image satellite planning, and more particularly to a method for allowing a deeper search for high value targets in a time-limited planning environment. In an exemplary embodiment, a method of computing an ordered subset of targets includes using an approximation for the time needed for the satellite to re-orient to a new target, rather than calculating each maneuver time between targets. By approximating the maneuver time rather than calculating it, the calculation time is reduced. Each iteration through the traveling salesman problem takes less time, and more iterations can be accomplished between imaging windows. The iterative process can search deeper into the traveling salesman problem to find a better solution.
대표청구항▼
1. A method for determining a pointing path of a satellite for imaging a group of targets, each target having a value, the method comprising: determining by a computer system an estimated cost of reorienting the satellite between two targets in the group, wherein the estimated cost comprises an esti
1. A method for determining a pointing path of a satellite for imaging a group of targets, each target having a value, the method comprising: determining by a computer system an estimated cost of reorienting the satellite between two targets in the group, wherein the estimated cost comprises an estimated maneuver time for reorienting the satellite between the two targets;generating by the computer system an ordered subset of the targets that maximizes a total sum of the values of the targets in the subset and minimizes a total sum of the estimated costs of reorienting the satellite between ordered pairs of targets in the subset;calculating by the computer system an actual maneuver time for reorienting the satellite between the ordered pairs of targets in the subset;modifying by the computer system the ordered subset based on the calculated actual maneuver times; andgenerating by the computer system a pointing path for passing to the satellite for imaging the targets in the modified ordered subset, wherein determining the estimated cost of reorienting comprises obtaining the estimated maneuver time from a curve fit for maneuver time-angle data. 2. The method of claim 1, wherein the estimated maneuver time for reorienting the satellite between two targets is less than the calculated actual maneuver time for reorienting the satellite between the two targets. 3. The method of claim 1, wherein the curve fit is about 1-3% less than the best curve fit for the data. 4. The method of claim 1, further comprising transmitting the pointing path by a transmitter to the satellite. 5. The method of claim 4, further comprising imaging by the satellite the targets in the pointing path. 6. The method of claim 5, further comprising displaying an image of a target. 7. The method of claim 1, wherein modifying the ordered subset comprises removing one or more targets from the subset based on a view angle constraint of the satellite. 8. The method of claim 7, wherein modifying the ordered subset comprises simulating a plurality of pointing paths, one or more pointing paths having one or more targets removed. 9. The method of claim 8, wherein generating the pointing path comprises discarding simulated pointing paths based on the view angle constraint, and selecting the pointing path with the highest total sum of the values of the targets that does not violate the view angle constraint. 10. The method of claim 1, wherein generating the ordered subset comprises iteratively solving for the ordered subset. 11. The method of claim 10, wherein iteratively solving comprises selecting a first subset of targets that satisfies an imaging window constraint, calculating a sum of the values of the targets in the first subset, selecting a second subset of targets that satisfies the imaging window constraint, calculating a sum of the values of the targets in the second subset, and comparing the sums. 12. The method of claim 1, wherein modifying the ordered subset comprises replacing the estimated maneuver times with the calculated actual maneuver times. 13. The method of claim 1, wherein the computer system comprises first and second arrays of computer devices, and wherein generating the ordered subset is done by the first array, and generating the pointing path is done by the second array. 14. The method of claim 13, further comprising passing a data file having the ordered subset by the first array to the second array. 15. The method of claim 1, wherein the computer system comprises first and second arrays of computer devices and a database, and wherein determining the estimated cost comprises accessing by the first array an optimistic curve fit on a time-angle plot stored in the database, and wherein generating the ordered subset comprises iteratively solving by the first array for the ordered subset, and further comprising passing the ordered subset by the first array to the second array, and wherein calculating the actual maneuver times, modifying the ordered subset, and generating the pointing path are done by the second array. 16. A method for determining a pointing path of a satellite for imaging a group of targets, each target having a value, the method comprising: determining by a computer system an estimated cost of reorienting the satellite between two targets in the group, wherein the estimated cost comprises an estimated maneuver time for reorienting the satellite between the two targets;generating by the computer system an ordered subset of the targets that maximizes a total sum of the values of the targets in the subset and minimizes a total sum of the estimated costs of reorienting the satellite between ordered pairs of targets in the subset;calculating by the computer system an actual maneuver time for reorienting the satellite between the ordered pairs of targets in the subset;modifying by the computer system the ordered subset based on the calculated actual maneuver times; andgenerating by the computer system a pointing path for passing to the satellite for imaging the targets in the modified ordered subset, wherein modifying the ordered subset comprises removing one or more targets from the subset based on a view angle constraint of the satellite. 17. The method of claim 16, wherein modifying the ordered subset comprises simulating a plurality of pointing paths, one or more pointing paths having one or more targets removed. 18. The method of claim 17, wherein generating the pointing path comprises discarding simulated pointing paths based on the view angle constraint, and selecting the pointing path with the highest total sum of the values of the targets that does not violate the view angle constraint. 19. A method for determining a pointing path of a satellite for imaging a group of targets, each target having a value, the method comprising: determining by a computer system an estimated cost of reorienting the satellite between two targets in the group, wherein the estimated cost comprises an estimated maneuver time for reorienting the satellite between the two targets;generating by the computer system an ordered subset of the targets that maximizes a total sum of the values of the targets in the subset and minimizes a total sum of the estimated costs of reorienting the satellite between ordered pairs of targets in the subset;calculating by the computer system an actual maneuver time for reorienting the satellite between the ordered pairs of targets in the subset;modifying by the computer system the ordered subset based on the calculated actual maneuver times; andgenerating by the computer system a pointing path for passing to the satellite for imaging the targets in the modified ordered subset, wherein the computer system comprises first and second arrays of computer devices and a database, and wherein determining the estimated cost comprises accessing by the first array an optimistic curve fit on a time-angle plot stored in the database, and wherein generating the ordered subset comprises iteratively solving by the first array for the ordered subset, and further comprising passing the ordered subset by the first array to the second array, and wherein calculating the actual maneuver times, modifying the ordered subset, and generating the pointing path are done by the second array.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (3)
Galkowski Peggy J. ; Glickstein Ira S. ; Stiles Peter N. ; Szczerba Robert J., Real-time mission adaptable route planner.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.