A method of finding the shortest concurrent path on a graph for p concurrent players, p/spl ges/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/sup -1/)+1
Concurrent path selection and real-time applications: aircraft routing and task scheduling
17th DASC. AIAA/IEEE/SAE. Digital Avionics Systems Conference. Proceedings (Cat. No.98CH36267) ; 1 ; C11/1-C11/8 vol.1
1998-01-01
682295 byte
Conference paper
Electronic Resource
English
COMBINED AIRCRAFT MAINTENANCE ROUTING AND MAINTENANCE TASK SCHEDULING
European Patent Office | 2016
|Real-time adaptive aircraft scheduling
NTRS | 1990
|Real-Time Adaptive Aircraft Scheduling
NTIS | 1990
|Daily aircraft routing and scheduling
Tema Archive | 1997
|