By Topic

Concurrent path selection and real-time applications: aircraft routing and task scheduling

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Lawson, D.I. ; Honeywell CSO, Houston, TX, USA

A method of finding the shortest concurrent path on a graph for p concurrent players, p⩾1, is presented. Real-time applications, the routing of aircraft and the scheduling of collections of tasks are then discussed and a parallel Bellman shortest path algorithm is described which finds the shortest path from node r to node s on a graph G. Using this algorithm and the proper configuration of processors the shortest path on a graph with k nodes can be found in O(log n) time for 2(m-1)+1<k<(n=2m)+1. This is faster than other algorithms currently available within the professional literature. To find concurrent paths is a new problem which has particular application for the best use of resources. The algorithm can be adapted to schedule a wide variety of concurrent tasks

Published in:

Digital Avionics Systems Conference, 1998. Proceedings., 17th DASC. The AIAA/IEEE/SAE  (Volume:1 )

Date of Conference:

31 Oct-7 Nov 1998