Do whatever works: A robust approach to fault-tolerant autonomous control

This paper describes a highly distributed fault-tolerant control system capable of compensating for deficiencies in system-level performance even when the cause of a fault cannot be explicitly identified. Developed for an autonomous underwater vehicle that must remain operational for several weeks without human intervention, this system must be capable of dealing with events that cannot be anticipated at design time. A unique aspect of this system is that it handles such events by attempting to do whatever works if it is unable to diagnose and correct specific faults. The software architecture used in this approach is applicable to a wide range of complex autonomous control applications.     

CLSS: An Intelligent Crane Lorry Scheduling System

Companies that provide crane-lorry services are faced with the daily need to perform vehicle and driver allocation and scheduling. Many companies still do this manually due to the lack of suitable technologies. This manual approach is both time consuming and inaccurate and most probably will not lead to an optimized plan that can reduce operational costs. In this paper, we describe the design of a system called Crane Lorry Scheduling System (CLSS) that we have developed for the largest crane lorry company in Hong Kong. A crane lorry company is a company that provides lorries with different types of mounted crane equipment and drivers to service different types of moving and lifting jobs. CLSS is a Web-based application that streamlines communication with customers, subcontractors and employees/lorry drivers. We modeled the lorry-assignment problem as a constraint-satisfaction problem (CSP) algorithm, which we call the Crane Lorry Optimizing Engine (CLOE). CLOE was designed to be easily customizable to match the needs and requirements of different crane lorry companies. We experimented with two versions of CLOE, regular CLOE that finds best solutions and X-CLOE that finds optimal solutions. Results from our tests show that CLOE is faster and generates better quality plans than the manual approach.     

Conceptual Design of an AUV Equipped with a Three Degrees of Freedom Vectored Thruster

The early stages of design and simulation of a new concept, autonomous underwater vehicle equipped with vectored thrusters is investigated. The opportunity to increase the research effort in innovative solutions for AUV propulsion and guidance systems is related to the state-of-the-art analysis. The dynamics of submersibles is briefly recalled, to justify the choice to equip the vehicle with a three degrees of freedom mechanism capable to orient both the propeller and the stabilising tail-fins. The vehicle presented has to be considered as a concept submersible, that needs further improvements and tuning to become a completely running test-bench for navigation system assessment. A tailored simulation package and results are also described, in order to perform a wide ranging numerical test campaign to foresee life cycle behaviour.     

Development of an autonomous underwater robot “Twin-Burger” for testing intelligent behaviors in realistic environments

An autonomous underwater robot named Twin-Burger was developed as a versatile test bed to establish the techniques which realize intelligent robot behaviors. The robot was designed to have necessary functions for complex tasks including cooperative task execution with other robots and divers. The first robot Twin-Burger I was completed and launched in November 1992. This paper describes hardware and software systems of the robot. Motion of the robot is controlled by sliding controllers based on simplified equations of motion which are derived from system identification experiments. Tank tests proved that the robot was able to cruise along a commanded path as a sequence of control actions generated by the sliding controllers. The Distributed Vehicle Management Architecture (DVMA) is applied to the robot as an architecture for the control software. Mission execution experiments shows that the Twin-Burger behaves appropriately according to the mission and environmental conditions.     

Experiments in the coordinated control of an underwater arm/vehicle system

The addition of manipulators to small autonomous underwater vehicles (AUVs) can pose significant control challenges due to hydrodynamic interactions between the arm and the vehicle. Experiments conducted at the Monterey Bay Aquarium Research Institute (MBARI) using the OTTER vehicle have shown that dynamical interactions between an arm and a vehicle can be very significant. For the experiments reported in this paper, a single-link arm was mounted on OTTER. Tests showed that for 90-degree, two-second repetitive slews of the arm, the vehicle would move as much as 18 degrees in roll and 14 degrees in yaw when no vehicle control was applied.Using a new, highly accurate model of the arm/vehicle hydrodynamic interaction forces, which was developed as part of this research, a coordinated arm/vehicle control strategy was implemented. Under this model-based approach, interaction forces acting on the vehicle due to arm motion were predicted and fed into the vehicle controller. Using this method, station-keeping capability was greatly enhanced. Errors at the manipulator end point were reduced by over a factor of six when compared to results when no control was applied to the vehicle and by a factor of 2.5 when compared to results from a standard independent arm and vehicle feedback control approach. Using the coordinated-control strategy, arm end-point settling times were reduced by a factor three when compared to those obtained with arm and vehicle feedback control alone. These dramatic performance improvements were obtained with only a five-percent increase in total applied thrust.     

The plane with parallel coordinates

By means ofParallel Coordinates planar graphs of multivariate relations are obtained. Certain properties of the relationship correspond tothe geometrical properties of its graph. On the plane a point line duality with several interesting properties is induced. A new duality betweenbounded and unbounded convex sets and hstars (a generalization of hyperbolas) and between Convex Unions and Intersections is found. This motivates some efficient Convexity algorithms and other results inComputational Geometry. There is also a suprising cusp inflection point duality. The narrative ends with a preview of the corresponding results inR ^N .     

Quantitative Characterization of Event Streams in Analysis of Hard Real-Time Applications

Many real-time embedded systems process event streams that are composed of a finite number of different event types. Each different event type on the stream would typically impose a different workload to the system, and thus the knowledge of possible correlations and dependencies between the different event types could be exploited to get tighter analytic performance bounds of the complete system. We propose an abstract stream model to characterize such an event stream. The model captures the needed information of all possible traces of a class of event streams. Hence, it can be used to obtain hard bounded worst-case and best-case analysis results of a system. We show how the proposed abstract stream model can be obtained from a concrete stream specification, and how it can be used for performance analysis. The applicability of our approach and its advantages over traditional worst-case performance analysis are shown in a case study of a multimedia application.Ernesto Wandeler is a Ph.D. student at the Computer Engineering and Networks Laboratory of the Swiss Federal Institute of Technology, Zurich. His research interests include models, methods and tools for system-level performance analysis of real-time embedded systems. He holds a Dipl. El.-Ing. degree from ETH Zurich. In 2003, he received the Willi Studer Price and the ETH Medal, both from the Swiss Federal Institute of Technology, Zurich. He is a student member of the IEEE and the ACM.Alexander Maxiaguine is a Ph.D. student at the Computer Engineering and Networks Laboratory of the Swiss Federal Institute of Technology, Zurich. His research interests include models and methods for system-level performance analysis and scheduling of embedded multiprocessor architectures, especially for real-time multimedia applications. Maxiaguine has an M.S. in electrical engineering from the Moscow Technical University of Communications and Informatics. He is a member of the IEEE and the ACM.Lothar Thiele is a full professor of computer engineering at the Swiss Federal Institute of Technology, Zurich. His research interests include models, methods and software tools for the design of embedded systems, embedded software and bioinspired optimization techniques. In 1986 he received the Dissertation Award of the Technical University of Munich, in 1987, the Outstanding Young Author Award of the IEEE Circuits and Systems Society, in 1988, the Browder J. Thompson Memorial Award of the IEEE, and in 2000–2001, the IBM Faculty Partnership Award. In 2004, he joined the German Academy of Natural Scientists Leopoldina.     

The University of Texas at Arlington Autonomous Aerial Vehicle—An overview

This paper reports on the status of The University of Texas at Arlington student effort to design, build and fly an Autonomous Aerial Vehicle. Both the 1991 entry into the First International Aerial Robotics Competition as well as refinements being made for 1992 are described. Significant technical highlights include a real-time vision system for target objective tracking, a real-time ultrasonic locator system for position sensing, a novel mechanism for gradually moving from human to computer control, and a hierarchical control structure implemented on a 32-bit microcontroller. Detailed discussion about the design of multivariable automatic controls for stability augmentation is included. Position and attitude control loops are optimized according to a combined ₂ and criteria. We present a modification of a recently published procedure for recovering a desired open-loop transfer function shape within the framework of the mixed ₂/ problem. This work has led to a new result that frees a design parameter related to imposing the constraint. The additional freedom can be used to improve upon the performance and robustness characteristics of the system.     

Interconnections and symmetries of linear differential systems

In this paper we study the interplay between control problems and symmetries in the context of linear systems. In particular, we establish sufficient conditions under which it is possible to control a symmetric system in order to make it achieve control objectives, without breaking its symmetry.     

The dynamic clusters method in nonhierarchical clustering

Given a finite setE R ⁿ, the problem is to find clusters (or subsets of similar points inE) and at the same time to find the most typical elements of this set. An original mathematical formulation is given to the problem. The proposed algorithm operates on groups of points, called samplings (samplings may be called multiple centers or cores); these samplings adapt and evolve into interesting clusters. Compared with other clustering algorithms, this algorithm requires less machine time and storage. We provide some propositions about nonprobabilistic convergence and a sufficient condition which ensures the decrease of the criterion. Some computational experiments are presented.     

The Kreisel length-of-proof problem

A first-order system F has theKreisel length-of-proof property if the following statement is true for all formulas(x): If there is ak1 such that for alln0 there is a proof of(¯n) in F with at mostk lines, then there is a proof of x(x) in F. We consider this property for Parikh systems, which are first-order axiomatic systems that contain a finite number of axiom schemata (including individual axioms) and a finite number of rules of inference. We prove that any usual Parikh system formulation of Peano arithmetic has the Kreisel length-of-proof property if the underlying logic of the system is formulated without a schema for universal instantiation in either one of two ways. (In one way, the formula to be instantiated is built up in steps, and in the other way, the term to be substituted is built up in steps.) Our method of proof uses techniques and ideas from unification theory.     

An operation-control scheme for authorization in computer systems

The access-control authorization scheme, which is being used for the protection of operating systems, is found to be inadequate in other areas, such as in databases and information systems. A new authorization scheme, which is a natural extension of access control, is proposed. The new scheme, which is called operation control, is shown to be superior to the accesscontrol scheme in a number of ways. In particular, it facilitates more natural and efficient representations of policies, particularly the type of complex policies that appear in information systems, it facilitates enforcement by compile-time validation due to a greater stability of authority states, and it reduces the need for revocation.This work was partially supported by Grant DAHCIS-73-G6 of the Advanced Research Project Agency of the US government. This paper is a modified version of the paper An Activator-based protection scheme, July 1976 (SOSAP-TR-25).     

Methods for the Reduction of Odometry Errors in Over-Constrained Mobile Robots

This paper presents an analysis of odometry errors in over-constrained mobile robots, that is, vehicles that have more independent motors than degrees of freedom. Examples of over-constrained vehicles are the various 6-wheeled Mars Rovers like Rocky-7, Rocky-8, or Fido.Based on our analysis we developed two novel measures aimed at reducing odometry errors. We also developed a novel method that serves as a framework for the implementation of the two new measures, as well as for other, conventional error reducing measures.One of the two new measures, called Fewest Pulses Measure, makes use of the observation that most terrain irregularities, as well as wheel slip, result in an erroneous overcount of encoder pulses. The second new measure, called Cross-coupled Control Measure, optimizes the motor control algorithm of the robot to reduce synchronization errors that would otherwise result in wheel slip with conventional controllers.The novel method that serves as a framework for other measures is based on so-called Expert Rules. In this paper we formulate three expert rules aimed at reducing dead-reckoning errors. Two of these expert rules are related to the foregoing discussion on error reducing measures. The third expert rule adds a gyroscope to the system and we re-examine the effectiveness of the odometry error-reducing measures in the context of this addition.In the work described in this paper we modified a Pioneer AT skid-steer platform by providing it with four independent drive motors and encoders. We implemented our error-reducing measures and the expert rule method on this over-constrained platform and present experimental results.     

Sometime = always + recursion ≡ always on the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs

Summary We propose and compare two induction principles called always and sometime for proving inevitability properties of programs. They are respective formalizations and generalizations of Floyd invariant assertions and Burstall intermittent assertions methods for proving total correctness of sequential programs whose methodological advantages or disadvantages have been discussed in a number of previous papers. Both principles are formalized in the abstract setting of arbitrary nondeterministic transition systems and illustrated by appropriate examples. The sometime method is interpreted as a recursive application of the always method. Hence always can be considered as a special case of sometime. These proof methods are strongly equivalent in the sense that a proof by one induction principle can be rewritten into a proof by the other one. The first two theorems of the paper show that an invariant for the always method can be translated into an invariant for the sometime method even if every recursive application of the later is required to be of finite length. The third and main theorem of the paper shows how to translate an invariant for the sometime method into an invariant for the always method. It is emphasized that this translation technique follows the idea of transforming recursive programs into iterative ones. Of course, a general translation technique does not imply that the original sometime invariant and the resulting always invariant are equally understandable. This is illustrated by an example.     

Fuzzy measurement in the Mishnah and the Talmud

I discuss the attitude of Jewish law sources from the 2nd–:5th centuries to the imprecision of measurement. I review a problem that the Talmud refers to, somewhat obscurely, as impossible reduction. This problem arises when a legal rule specifies an object by referring to a maximized (or minimized) measurement function, e.g., when a rule applies to the largest part of a divided whole, or to the first incidence that occurs, etc. A problem that is often mentioned is whether there might be hypothetical situations involving more than one maximal (or minimal) value of the relevant measurement and, given such situations, what is the pertinent legal rule. Presumption of simultaneous occurrences or equally measured values are also a source of embarrassment to modern legal systems, in situations exemplified in the paper, where law determines a preference based on measured values. I contend that the Talmudic sources discussing the problem of impossible reduction were guided by primitive insights compatible with fuzzy logic presentation of the inevitable uncertainty involved in measurement. I maintain that fuzzy models of data are compatible with a positivistic epistemology, which refuses to assume any precision in the extra-conscious world that may not be captured by observation and measurement. I therefore propose this view as the preferred interpretation of the Talmudic notion of impossible reduction. Attributing a fuzzy world view to the Talmudic authorities is meant not only to increase our understanding of the Talmud but, in so doing, also to demonstrate that fuzzy notions are entrenched in our practical reasoning. If Talmudic sages did indeed conceive the results of measurements in terms of fuzzy numbers, then equality between the results of measurements had to be more complicated than crisp equations. The problem of impossible reduction could lie in fuzzy sets with an empty core or whose membership functions were only partly congruent. Reduction is impossible may thus be reconstructed as there is no core to the intersection of two measures. I describe Dirichlet maps for fuzzy measurements of distance as a rough partition of the universe, where for any region A there may be a non-empty set of - _A (upper approximation minus lower approximation), where the problem of impossible reduction applies. This model may easily be combined with probabilistic extention. The possibility of adopting practical decision standards based on -cuts (and therefore applying interval analysis to fuzzy equations) is discussed in this context. I propose to characterize the uncertainty that was presumably capped by the old sages as U-uncertainty, defined, for a non-empty fuzzy set A on the set of real numbers, whose -cuts are intervals of real numbers, as U(A) = 1/h(A) ₀ ^h(A) log [1+(A)]d, where h(A) is the largest membership value obtained by any element of A and (A) is the measure of the -cut of A defined by the Lebesge integral of its characteristic function.     

Optimal multilayer channel routing with overlap

This paper presents algorithms for multiterminal net channel routing where multiple interconnect layers are available. Major improvements are possible if wires are able to overlap, and our generalized main algorithm allows overlap, but only on everyKth (K 2) layer. Our algorithm will, for a problem with densityd onL layers,L K + 3,provably use at most three tracks more than optimal: (d + 1)/L/K + 2 tracks, compared with the lower bound of d/L/K. Our algorithm is simple, has few vias, tends to minimize wire length, and could be used if different layers have different grid sizes. Finally, we extend our algorithm in order to obtain improved results for adjacent (K = 1) overlap: (d + 2)/2L/3 + 5 forL 7.This work was supported by the Semiconductor Research Corporation under Contract 83-01-035, by a grant from the General Electric Corporation, and by a grant at the University of the Saarland.     

Mechatronics engineering education and dissemination program

For evolution of Mechanical System Technology, a simplified mechanism with sophisticated electronics control are replacing the traditional pure mechanical system. The new technology which combines the mechanical system with electronics control is being referred to as Mechatronics Technology and explosively growing in all over the industrialized countries. The paper describes, the concept and essential technology components of the mechatronics technology and the methodology and implementation of the Mechatronics Engineering Education.     

Sound and Complete Qualitative Simulation Needs “Quantitative” Filtering

The AI methodology of qualitative reasoning furnishes useful tools to scientists and engineers who need to deal with incomplete system knowledge during design, analysis, or diagnosis tasks. Qualitative simulators have a theoretical soundness guarantee; they cannot overlook any concrete equation implied by their input. On the other hand, the basic qualitative simulation algorithms have been shown to suffer from the incompleteness problem; they may allow non-solutions of the input equation to appear in their output. The question of whether a simulator with purely qualitative input which never predicts spurious behaviors can ever be achieved by adding new filters to the existing algorithm has remained unanswered. In this paper, we show that, if such a sound and complete simulator exists, it will have to be able to handle numerical distinctions with such a high precision that it must contain a component that would better be called a quantitative, rather than qualitative reasoner. This is due to the ability of the pure qualitative format to allow the exact representation of the members of a rich set of numbers.     

Maintaining Longest Paths Incrementally

Modeling and programming tools for neighborhood search often support invariants, i.e., data structures specified declaratively and automatically maintained incrementally under changes. This paper considers invariants for longest paths in directed acyclic graphs, a fundamental abstraction for many applications. It presents bounded incremental algorithms for arc insertion and deletion which run in O( + || log||) time and O() time respectively, where || and are measures of the change in the input and output. The paper also shows how to generalize the algorithm to various classes of multiple insertions/deletions encountered in scheduling applications. Preliminary experimental results show that the algorithms behave well in practice.