An investigation into real-time scheduling for a particular application
The purpose of this investigation was to determine the feasibility of real-time selection of paths and scheduling of traffic on a model railroad system via a minicomputer. Investigations into heuristic search procedures and operating systems theory were made and several restrictions were imposed upon the model.
The investigation of heuristic search methods for selection of minimal cost paths yielded the selection of an optimal heuristic cost estimator and modification of a specific search algorithm.
Because of peculiarities of the system itself several restrictions were imposed upon the application. The conclusion was made that real-time selection, checking, rejection, and reselection put the complexity of this type of simulation out of reach of a state of the art machine, given the relatively small but complex model toward which the simulation is directed.
In order to cope with peculiarities of the system a preprocessing procedure was devised to check for feasible path combinations.
Finally, an adaptation of an allocation algorithm was implemented which was successful at real-time allocation of track sections.
Thesis76.L252.pdf
4.88 MB
Adobe PDF
d43e06f957863713f1145500d8f37429