System and method for optimizing aircraft flight path

• US 4,812,990 A
• Filed: 04/29/1987
• Issued: 03/14/1989
• Est. Priority Date: 04/29/1987
• Status: Expired due to Fees

• Current Assignee: Merit Technology, Inc.
• Original Assignee: Merit Technology, Inc.
• Inventors: Adams, Daniel R., McKenzie, Richard E.
• Primary Examiner(s): Lall, Parshotam S.
• Assistant Examiner(s): Black, Thomas G.
• Application Number:
  US07/044,059
• Time in Patent Office: 685 Days
• Field of Search: 364/433, 364/448, 364/424, 364/447, 364/427, 364/428, 364/460, 364/461, 364/443, 364/439, 364/442, 364/444, 342/29
• US Class Current: 701/3
• CPC Class Codes: G05D 1/0005 with arrangements to save energy
• CPC Class Codes: G06F 30/15 Vehicle, aircraft or watercraft design
• CPC Class Codes: G06F 30/18 Network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air conditioning [HVAC] or cabling circuit design at the physical level G06F30/39; network planning tools for wireless communication networks H04W16/18

Abstract

A system and method for determining the optimal path for an aircraft to fly from a first position to a second position so that the aircraft heading at the second position is within preselected minimum and maximum heading limits. A two-dimensional reference grid is constructed so that the first position is in the center cell of the first rank of the grid and the second position is adjacent to the center cell of the last rank thereof. Dynamic programming techniques are used to determine the possible flight paths between the first and second positions and to select the path of minimum cost as the optimal path. The possible flight paths are constructed by identifying the possible connections between the last rank and the second postion and then between each pair of adjacent ranks, working backward from the last rank to the first position, which is located in the first rank. A possible connection is deemed to exist when the aircraft can fly from one point to a target point (e.g., between specified cells in adjacent ranks) and arrive at the target point within particular heading limits without exceeding the predetermined maximum lateral acceleration of the aircraft. Corresponding heading limits are determined for each "connected" cell in the grid, so that all possible flight paths are examined, consistent with the preselected heading limits at the second position (e.g., the target area) and the maximum lateral acceleration allowed for the aircraft.

Claims

1. A system for determining an optimal path for an aircraft to fly from position to a second position so that the aircraft heading at the second position is within preselected minimum and maximum heading limits, said system comprising:

means for constructing a reference grid, the length of which is oriented along a first axis connecting said first and second positions so that said first axis corresponds to the centerline of the grid and the width of which corresponds to a preselected width along a second axis which is perpendicular to said first axis, said grid being divided into N number of ranks in succession between said first and second positions, said first position being at the center of the first rank and said second position being adjacent to the center of the Nth rank, each of said ranks spanning the entire width of said grid and being divided into a predetermined number of rectangular cells;

means for determining connected cells in said Nth rank, the connected cells in the Nth rank being those cells from which the aircraft can reach said second position within the preselected minimum and maximum heading limits without exceeding the maximum lateral acceleration allowed for the aircraft;

means for determining the cost of flying from each of the connected cells in the Nth rank to said second position based on a preselected cost function;

means for determining corresponding minimum and maximum heading limits at each of the connected cells in the Nth rank, said minimum and maximum heading limits representing a range of allowed headings for the aircraft at the corresponding connected cell which will enable the aircraft to reach the second position within the preselected minimum and maximum heading limits without exceeding the maximum lateral acceleration;

means for determining connected paths between each pair of adjacent ranks (i-1) and i in sequence beginning with i=N and ending with i=2, each of said connected paths representing a discrete connection between a specified cell in the (i-1)th rank and a specified connected cell in the ith rank whereby the aircraft can reach the specified cell in the ith rank within the corresponding heading limits from the specified cell in the (i-1)th rank without exceeding the maximum lateral acceleration, each of the cells in the (i-1)th rank from which the aircraft can reach at least one of the connected cells in the ith rank within the corresponding heading limits without exceeding the maximum lateral acceleration being a connected cell in the (i-1)th rank;

means for determining the cost of flying from the (i-1)th rank to the ith rank along each of said connected paths and for determining the minimum cost of flying from each of the connected cells in the (i-1)th rank to said second position based on a preselected cost function for each rank in sequence beginning with i=N and ending with i=2;

means for storing the corresponding path of minimum cost between each connected cell in the (i-1)th rank and the second position and the corresponding cost of said minimum cost path for each of the connected cells in the (i-1)th rank, for each rank in sequence beginning with i=N and ending with i=2;

means for determining corresponding minimum and maximum heading limits for each of the connected cells in the (i-1)th rank, for each rank in sequence beginning with i=N and ending with i=2, said heading limits representing a range of allowed headings for the aircraft at the corresponding connected cell in the (i-1)th rank which will enable the aircraft to reach a particular one of the connected cells in the ith rank within the corresponding heading limits without exceeding the maximum lateral acceleration, said particular connected cell in the ith rank being that cell which lies on the path of minimum cost between the corresponding connected cell in the (i-1)th rank and the second position;

means for determining particular ones of the connected cells in the second rank which the aircraft can reach from said first position within the corresponding heading limits without exceeding the maximum lateral acceleration;

means for determining the cost of flying from said first position to each of said particular connected cells and for determining the path of minimum cost of flying from said first position to said second position, said minimum cost path being the optimal flight path for the aircraft between said first and second positions; and

means for determining corresponding minimum and maximum heading limits at the first position, said heading limits representing a range of allowed headings for the aircraft at the first position which will enable the aircraft to reach the particular connected cell in the second rank which lies on the path of minimum cost between the first and second positions.

2. The system according to claim 1 further including means for converting said optimal flight path between said first and second positions into a series of corresponding headings for the aircraft o fly between adjacent ranks in the grid and for controlling said aircraft to fly at the corresponding heading between each pair of adjacent ranks from the first rank to the Nth rank and from the Nth to the second position.

3. The system according to claim 2 wherein said preselected cost function includes cost parameters relating to threat avoidance and terrain avoidance, each of the connected paths between adjacent ranks having predetermined cost parameters assigned thereto, the total cost of each of said connected paths being the sum total of the corresponding cost parameters assigned thereto.

4. The system according to claim 1 wherein each of said ranks has M number of cells, where M is an odd integer, so that the center of each rank is at the center of the corresponding middle cell.

5. A method for determining the optimal path for an aircraft to fly from a first position to a second position so that the aircraft heading at the second position is within preselected minimum and maximum heading limits, said method comprising the steps of:

constructing a referecne grid, the length of which is oriented along a first axis connecting said first and second positions so that the first axis corresponds to the centerline of the grid and the width of which corresponds to a preselected width along a second axis which is perpendicular to said first axis, said grid being divided into N number of ranks in succession between said first and second positions, said first position being at the center of the first rank and said second position being adjacent to the center of the Nth rank, each of said ranks spanning the entire width of said grid and being divided into a predetermined number of rectangular cells;

determining connected cells in said Nth rank, the connected cells in the Nth rank being those cells from which the aircraft can reach said second position within the preselected minimum and maximum heading limits without exceeding the maximum lateral acceleration allowed for the aircraft;

determining the cost of flying from each of the conencted cells in the Nth rank to said second position based on a preselected cost function;

determining the corresponding heading limits at each of the connected cells in the Nth rank, said heading limits representing a range of allowed headings for the aircraft at the corresponding connected cell in the Nth rank from which the aircraft can reach the second position within the preselected minimum and maximum heading limits; and

performing the following steps for each pair of adjacent ranks in sequence beginning with i=N and ending with i=2;

determining connected paths between each pair of adjacent ranks (i-1) and i, each of said connected paths representing a discrete connection between a specified cell in the (i-1)th rank and a specified connected cell in the ith rank whereby the aircraft can reach the specified cell in the ith rank within the corresponding heading limits from the specified cell in the (i-1)th rank without exceeding the maximum lateral acceleration, each of the cells in the (i-1)th rank from which the aircraft can reach at least one of the connected cells in the ith rank within the corresponding heading limits without exceeding the maximum lateral acceleration being a connected cell in the (i-1)th rank;

determining the cost of flying from the (i-1)th rank to the ith rank along each of said connected paths and determining the minimum cost of flying from each of the connected cells in the (i-1)th rank to said second position based on the preselected cost function;

storing the corresponding path of minimum cost between each connected cell in the (i-1)th rank and the second position and the corresponding cost of said minimum cost path for each of the connected cells in the (i-1)th rank; and

determining corresponding minimum and maximum heading limits for each of the connected cells in the (i-1)th rank, said heading limits representing a range of allowed headings for the aircraft at the corresponding connected cell in the (i-1)th rank which will enable the aircraft to reach a particular one of the connected cells in the ith rank with the corresponding heading limits without exceeding the maximum lateral acceleration, said particular connected cell in the ith rank being that cell which lies on the path of minimum cost between the corresponding connected cell in the (i-1)th rank and the second position.

6. The method according to claim 5 wherein the connected cells in each of the ranks, beginning with the Nth rank and ending with the first rank, are determined according to the following steps:

forming a first circle of radius R equal to V² /Gmax where V is the aircraft velocity and Gmax is the maximum lateral acceleration of the aircraft, said first circle passing through a target point at the corresponding minimum heading limit and curving towards smaller headings as said first circle moves away from the target point, said headings being measured with respect to a first portion of said second axis extending from the centerline of the grid toward the right boundary thereof, as viewed from said first position towards said second position, so that the smallest possible heading is along said first portion of said second axis and the largest possible heading is along a second portion of said second axis, opposite from said first portion, which extends from the centerline of the grid to the left boundary thereof, as viewed from said first position toward said second position;

determining the particular cells in a first portion of a particular rank, lying between the left boundary of the particular rank and a middle cell whose center is on the first axis, from which the aircraft can reach the target point within the corresponding minimum and maximum heading limits without exceeding the maximum lateral acceleration, those cells in said first portion of the particular rank whose centers are on or outside the perimeter of said first circle being connected cells from which said aircraft can reach said target point within the corresponding heading limits;

forming a second circle of radius R passing through said target point at the corresponding maximum heading and curving toward larger heading angles as said second circle moves away from said target point; and

determining the particular cells in a second portion of the particular rank, lying between said middle cell and the right boundary of the particular rank, from which the aircraft can reach the target point within the corresponding minimum and maximum heading limits without exceeding the maximum lateral acceleration, those cells in said second portion of the particular rank whose centers are on or outside the perimeter of said second circle being connected cells from which the aircraft can reach said target point within the corresponding heading limits.

7. The method according to claim 6 wherein the step of determining the respective minimum and maximum heading limits of each of the connected cells in each rank in sequence beginning with the Nth rank and ending with the first rank is comprised of the following sub-steps:

determining a first angle (B) representing the difference between the corresponding maximum heading at the target point and a local heading along an axis connecting a corresponding one of the connected cells in the particular rank to the target point;

comparing a first distance (L) between the center of the corresponding cell and the target point with the second distance equal to 2R|sinB| and for generating a first signal if L is greater than or equal to 2R|sinB| and alternatively for generating a second signal if L is less than 2R|sinB|;

in response to said first electrical signal, determining a first heading which is the greater heading as between (1) a heading equal to said local heading minus said first angle (B) and (2) said smallest possible heading and comparing said first heading determined above with said largest possible heading, the minimum heading at the corresponding connected cell being equal to the smaller of said first heading and said largest possible heading;

in response to second electrical signal, determining a second heading which is the greater heading as between (1) a heading equal to said local heading minus a second angle equal to arcsin L/2R and (2) said smallest possible heading and comparing the second heading determined above with said largest possible heading, the minimum heading at the corresponding connected cell being equal to the smaller of said second heading and said largest possible heading;

determining a third angle (A) representing the difference between the corresponding minimum heading at the target point and said local heading;

comparing the first distance (L) with a third distance equal 2R|sinA| and generating a third electrical signal if L is greater than or equal to 2R|inA| and alternatively generating a fourth electrical signal if L is less than 2R|sinA|;

in response to said third electrical signal, determining a third heading which is the greater heading as between (1) a heading equal to said local heading minus said third angle (A)and (2) said smallest possible heading and comparing said third heading with said largest possible heading, the maximum heading at the corresponding connected cell being equal to the smaller of said third heading and said largest possible heading; and

in response to said fourth electrical signal determining a fourth heading which is the greater heading as between (1) a heading equal to said local heading minus said second angle (arcsin L/2R) and (2) said smallest possible heading and comparing said fourth heading with said largest possible heading, the maximum heading at the corresponding connected cell being equal to the smaller of said fourth heading and said largest possible heading.

8. The method according to claim 7 wherein said target point is said second position and said particular rank is said Nth rank.

9. The method according to claim 7 wherein said target point is a specified connected cell in the ith rank and said particular rank corresponds to the (i-1)th rank.

10. The method according to claim 5 further including the step of converting said optimal flight path between said first and second positions into a series of corresponding headings for the aircraft to fly between adjacent ranks in the grid and controlling said aircraft to fly at the corresponding heading between each pair of adjacent ranks from the first rank to the Nth rank and from the Nth rank to the second position.