Shifting role for human factors in an ‘unmanned’ era

Human factors practitioners (HFPs) play many different roles in the design, creation, operation and maintenance of engineered systems. Less well known are the methods which are aimed at helping with the early stages of design, which are more systems-oriented and often involve questions of the concept of operation in which the engineered system will be fielded. Emerging from the field of cognitive engineering, these methods, including simulation, cognitive work analysis, cognitive task analyses and hierarchical task analysis, will be important as autonomous systems become increasingly capable. Even the most capable systems will continue to interact with humans, and it is at these interfaces between humans and engineered systems that HFP will continue to be needed. This paper describes recent work to leverage these methods to inform concepts of operation in aviation and space, machine learning algorithms and goal-oriented human–machine collaboration.     

A Measurement‐Based Approach for Designing Fixed‐Order Controllers for Unknown Closed‐Loop Architecture

This paper presents a new technique to design fixed‐structure controllers for linear unknown systems using a set of measurements. In model‐based approaches, the measured data are used to identify a model of the plant for which a suitable controller can be designed. Due to the fact that real processes cannot be described perfectly by mathematical models, designing controllers using such models to guarantee some desired closed‐loop performance is a challenging task. Hence, a possible alternative to model‐based methods is to directly utilize the measured data in the design process. We propose an approach to designing structured controllers using a set of closed‐loop frequency‐domain data. The principle of such an approach is based on computing the parameters of a fixed‐order controller for which the closed‐loop frequency response fits a desired frequency response that describes some desired performance indices. This problem is formulated as an error minimization problem, which can be solved to find suitable values of the controller parameters. The main feature of the proposed control methodology is that it can be applied to stable and unstable plants. Additionally, the design process depends on a pre‐selected controller structure, which allows for the selection of low‐order controllers. An application of the proposed method to a DC servomotor system is presented to experimentally validate and demonstrate its efficacy.     

Architectural design and FPGA implementation of radix-4 CORDIC processor

A new scaled radix-4 CORDIC architecture that incorporates pipelining and parallelism is presented. The latency of the architecture is n/2 clock cycles and throughput rate is one valid result per n/2 clocks for n bit precision. A 16 bit radix-4 CORDIC architecture is implemented on the available FPGA platform. The corresponding latency of the architecture is eight clock cycles and throughput rate is one valid result per eight clock cycles. The entire scaled architecture operates at 56.96 MHz of clock rate with a power consumption of 380 mW. The speed can be enhanced with the upgraded version of FPGA device. A speed-area optimized processor is obtained through this architecture and is suitable for real time applications.     

Strategy logic

We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properties of nonzero-sum games in a simple and natural way. We show that the one-alternation fragment of strategy logic is strong enough to express the existence of Nash equilibria and secure equilibria, and subsumes other logics that were introduced to reason about games, such as ATL, ATL¹, and game logic. We show that strategy logic is decidable, by constructing tree automata that recognize sets of strategies. While for the general logic, our decision procedure is nonelementary, for the simple fragment that is used above we show that the complexity is polynomial in the size of the game graph and optimal in the size of the formula (ranging from polynomial to 2EXPTIME depending on the form of the formula).