A mission computer (10) stores a nominal route plan which includes information indicative of the precise arrival time at specific navigation positions, e.g., waypoints, and the planned fuel consumption during travel to the specified waypoints. The mission computer (10) provides a time and fuel display system (15) with the route plan information. The time and fuel display system (15) generates a display (200) which indicates the total distance to be traveled during the mission (202), a distance traveled indicator (212) to reflect the progress of the aircraft along the mission, and a time bar (205) and a fuel bar (207) the height of which with respect to the indicator (212) are indicative of the percentage that the current time and fuel values are over or under the planned values for the current waypoint. The distance traveled indicator (212) is labeled with a waypoint designation (215) which is indicative of the designation of the waypoint towards which the aircraft is currently flying. A mission time display (220) and a fuel reserve display (223 ) provide a visual indication of the planned arrival time at the final destination and the planned fuel reserve upon arrival at the final destination. A Bingo fuel indicator (225) is provided to indicate the amount of fuel required to fly a direct route, at maximum range airspeed, to the mission end point with a planned fuel reserve.
An intraocular data display device having an N.times.M display with each row (N) and column (M) of the display confined by a planar waveguide array. The waveguides will form uniform pixel size anywhere on the display and ensure uniform pixel luminance across the display.
A system and method for making a decision of whether to carry additional fuel on an aircraft for a particular flight based on a forecast, such as for low visibility and ceiling. Preferably, observations-based probabilistic forecasts are utilized. The forecast probability of the weather at the planned aerodrome being below a prescribed minimum level is calculated using statistical regression analysis of past data. An optimal probability is estimated using cost parameters on an individual flight bases. If this forecast probability is greater than the optimal probability for a particular flight, then extra fuel is carried by that flight. This is in contrast to current practice whereby the same categorical forecast is applied to all flights. The combination of improved short-term forecasts and identification of optimal forecast probabilities minimizes the financial impact of errors and weather forecasts on airline operations thereby providing a superior financial outcome.
This invention concerns a display device for aircraft comprising a display surface (15) that has a punctual marking (11) arranged so as to represent the pilot's own airplane and one or more threat markings, each of which is arranged so as to represent a direction to an associated detected threat. The display device is characterized in that each threat marking comprise an indicator (14, 15) that contains information about the time to the associated threat, and in that it is arranged so as to present, on a display surface (15), a current time discrepancy relative to a planned mission and a remaining amount of fuel relative to the planned mission. The invention also concerns a method for presenting one or more detected threats in relation to an aircraft.
A display unit for an automobile includes a graph comprising a vertical axis X and a horizontal axis Y. The vertical axis X indicates a remaining capacity of driving energy, such the capacity of batteries in an electric vehicle, and the horizontal axis Y indicates a remaining distance that can be traveled based on the remaining capacity of driving energy. Thus, the remaining capacity and the remaining distance are integrally displayed on a single graph.
A hybrid of grid-based and graph-based search computations, together with provision of a sparse search technique effectively limited to high-probability candidate nodes provides accommodation of path constraints in an optimization search problem in substantially real-time with limited computational resources and memory. A grid of best cost (BC) values are computed from a grid of map cost (MC) values and used to evaluate nodes included in the search. Minimum segment/vector length, maximum turn angle, and maximum path length along a search path are used to limit the number of search vectors generated in the sparse search. A min-heap is preferably used as a comparison engine to compare cost values of a plurality of nodes to accumulate candidate nodes for expansion and determine which node at the terminus of a partial search path provides the greatest likelihood of being included in a near-optimal complete solution, allowing the search to effectively jump between branches to carry out further expansion of a node without retracing portions of the search path. Capacity of the comparison engine can be limited in the interest of expediting of processing and values may be excluded or discarded therefrom. Other constraints such as approach trajectory are accommodated by altering MC and BC values in a pattern or in accordance with a function of a parameter such as altitude or by testing of the search path previously traversed.