English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Currently, aircraft fighter pilots use some type of computer system to plot courses and determine fuel consumption. Even with a computer this is a time consuming tsak. The tradi- tional auterouting problem is further complicated when the aircraft in question is considered to be one of "stealth" or low- observable design. Research is being conducted irtto the use of supercomputers as aids to pilots in performing real-time mission routing. This paper presents the software engineering synthesis of an automated software tool, based on a paral- lelized search slgonthm, to determine mission routes from a real-time perspective. This investigation studies various ar- eas of the mission routing problem in conjunction the efficient usage of a supercomputer system. being conducted into the use of computers as aides to pilots selecting routes. Some preliminary systems have been used by operational squadrons. These systems allow pilots to plot their mission on a computer screen and have the computer perform all calculations automatically which reduces the time needed to plan a mission. With the viabtity of such systems demon- strated, there is an increased interest in the development of more sophisticated mission planning systems. Greater com- plexity is being incorporated into such systems because route selection is a multicritena problem. Muhicntena simply indi- cates a problem whose solution depends on a number of crite- ria. As criteria are added to the selection process there is an exponential incre- in the time to find a solution. Some of the factors a pilot must consider are threats, distance flown, fuel consumption, time on target, and refueling points. To reduce the complexity of this investigation, only the distance flown and probability of detection are the criteria used to select a route. The determination of the impact some of these criteria have upon the success of the mission are beyond the abilities of a pilot. With the advent of "stealth" or low-observable air- craft the detection by enemy has taken on new dimensions. No longer cart a simple probability of detection be calculated bssed on radar equations. The observability of an aircraft must first be modeled, next the orientation of the aircraft with respect to each of the radar sites must be determined, and then the probability of detection can be calculated. From a radar stand-point, observability is quantified by the radar cross section ( RCS) which is simply the cross section area of the sphere which produces the same levels of radar return as the object under consideration at the same distance. Aircraft designed to be low-observable seek to minimize RCS; however, the RCS is not a static function since is is clearly afected by the aircraft's pitch, roll, and yaw. This further refined criteria adds additional complexity to an already complex problem. - This paper will present the A* search algorithm. The dc+ sign and application of this search strategy, on a parallel com- puter, to the mission routing problem will be &cussed. Also, the analysis of experiments testing the implementation will be presented.

A parallelized search strategy for solving a multicriteria aircraft routing problem