Engineering topics
Publications and source records attributed to Fox, Barry R..
COMPASS is interactive planning and scheduling software system used like spreadsheet. System places activities only at feasible times, taking into consideration all constraints imposed upon activity and resources it requires. Version 1.4 written in Ada and contains standard X-Windows interfaces written in C.
A set of viewgraphs on resource representation in COMPASS is given. COMPASS is an incremental, interactive, non-chronological scheduler written in Ada with an X-windows user interface. Beginning with an empty schedule, activities are added to the schedule one at a time, taking into consideration the placement of the activities already on the timeline and the resources that have been reserved for them. The order that the activities are added to the timeline and their location on the timeline are controlled by selection and placement commands invoked by the user. The order that activities are added to the timeline and their location are independent. The COMPASS code library is a cost effective platform for the development of new scheduling applications. It can be effectively used off the shelf for compatible scheduling applications or it can be used as a parts library for the development of custom scheduling systems.
Information on Space Station Freedom scheduling problems and techniques are presented in viewgraph form. Topics covered include automated scheduling systems, user interface standards, benefits of interactive scheduling systems, incremental scheduling, software engineering, computer graphics interface, distributed resource management, and advanced applications.
The implementation of an inference engine for embedded diagnostic systems is described. The system consists of two distinct parts. The first is an off-line compiler which accepts a propositional logical statement of the relationship between facts and conclusions and produces data structures required by the on-line inference engine. The second part consists of the inference engine and interface routines which accept assertions of fact and return the conclusions which necessarily follow. Given a set of assertions, it will generate exactly the conclusions which logically follow. At the same time, it will detect any inconsistencies which may propagate from an inconsistent set of assertions or a poorly formulated set of rules. The memory requirements are fixed and the worst case execution times are bounded at compile time. The data structures and inference algorithms are very simple and well understood. The data structures and algorithms are described in detail. The system has been implemented on Lisp, Pascal, and Modula-2.
A system for reasoning about robotic assembly tasks is described. The first element of this system is a facility for itemizing the constraints which determine the admissible orderings over the activities to be sequenced. The second element is a facility which partitions the activities into independent subtasks and produces a set of admissible strategies for each. Finally, the system has facilities for constructing an admissible sequence of activities which is consistent with the given constraints. This can be done off-line, in advance of task execution, or it can be done incrementally, at execution time, according to conditions in the execution environment. The language of temporal constraints and the methods of inference presented in related papers are presented. It is shown how functional and spatial relationships between components impose temporal constraints on the order of assembly and how temporal constraints then imply admissible strategies and feasible sequences.