Building artificial memory to autonomous agents using dynamic and hierarchical finite state machine

Events detection and handling based on hierarchical finite state machines in EAST PCS

Sharing intellectual property (IP) blocks in today's competitive market poses significant high security risks. In this paper, we present a tutorial for a watermarking approach based on the embedding of the ownership proof as part of the IP design's finite state machine (FSM). It utilizes coinciding as well as unused transitions in the state transition graph of the design. Based on this approach, we have developed a robust watermarking framework, used for copyright protection. The developed technique increases the robustness of the watermark and allows a secure implementation, hence enabling the development of the first public-key IP watermarking scheme at the FSM level. In order to integrate these algorithms in the design cycle of industrial projects, we extend the above techniques to enable the watermarking of hierarchical finite state machines (HFSMs)

In the manufacturing process, digital twin technology can provide real-time mapping, prediction, and optimization of the physical manufacturing process in the information world. In order to realize the complete expression and accurate identification of and changes in the real-time state of the manufacturing process, a digital twin framework of incremental learning driven by stream data is proposed. Additionally, a novel method of stream data-driven equipment operation state modeling and incremental anomaly detection is proposed based on the digital twin. Firstly, a hierarchical finite state machine (HFSM) for the manufacturing process was proposed to completely express the manufacturing process state. Secondly, the incremental learning detection method driven by stream data was used to detect the anomaly of the job process data, so as to change the job status in real time. Furthermore, the F1 value and time consumption of the proposed algorithm were compared and analyzed using a general dataset. Finally, the method was applied to the practical case development of a welding manufacturer’s digital twin system. The flexibility of the proposed model is calculated by the quantitative method. The results show that the proposed state modeling and anomaly detection method can help the system realize job state mapping and state change quickly, effectively, and flexibly.

A model for a phased-array radar in the context of a defensive Naval system has been developed using hierarchical finite state machines. This model is used to study resource management for a fleet of ships equipped with one radar unit each. This fleet is under attack from aerial enemy agents. A control algorithm formulated on this specific model is used to dynamically generate a greedy policy for radar operation. The defense system is evaluated in its capability to acquire and track those aerial threats, in two configurations -centralized and decentralized (independent). The performance is quantified on the basis of time taken to establish the threat trajectory, time to compute the policy and the number of threats the system fails to track. A comparison of performance in the two configurations is provided.

Perkembangan industri game mendorong kebutuhan akan sistem kendali karakter dan pertarungan yang responsif dalam genre Action RPG 2D. Penelitian ini bertujuan untuk mengimplementasikan sistem character player yang mencakup character controller dan combat system menggunakan Godot Engine. Character controller dirancang untuk memberikan kendali yang halus terhadap pergerakan karakter seperti bergerak, berlari, dan melompat, sedangkan combat system difokuskan pada mekanisme attack, deteksi musuh, upgrade stats, dan pengurangan damage musuh. Metode yang digunakan adalah rekayasa perangkat lunak dengan tahapan analisis, perancangan, implementasi, dan pengujian. Sistem kendali karakter dikembangkan menggunakan Hierarchical Finite State Machine (HFSM) agar modular dan mudah dikembangkan, sedangkan sistem pertarungan memanfaatkan area dan animasi yang sinkron. Hasil pengujian menunjukkan bahwa sistem berjalan dengan baik dan memberikan pengalaman bermain yang responsif dan stabil. Implementasi ini penting sebagai acuan pengembangan game Action RPG 2D berbasis open-source.

The W-method is one of the most general and widely used methods for generating tests from a finite state machine (FSM). The paper shows how the W-method can be used to generate test sequences from a hierarchical FSM and also from a system of communicating FSMs in which the communication is one-directional. By refining test suites in parallel with the specification and using a divide and conquer strategy, the size of the test data is considerably reduced in comparison to the case in which tests are derived directly from the final specification.

We present a real-world scenario for investigating and demonstrating hierarchical self-optimization in autonomous groups of mobile robots. The scenario is highly dynamic and easily expandable. It offers adequate starting points for the integration of hierarchical self-optimization. Reinforcement learning, e. g., can be introduced in order to improve the individual behavior of a single robot. Also swarm intelligence algorithms can improve the overall team behavior with respect to common goals. A reference behavior system incorporating a dynamic role assignment and hierarchical state machines was implemented and has been applied to the miniature robot BeBot. The system was evaluated by conducting several tests.

The authors present a hierarchical analysis of interconnected finite state machines helpful for testability evaluation. Formal operators determine the controllable and observable functional parts of the modules of the hierarchy; several kinds of functional redundancies are deduced and their causes are diagnosed. A prototype written in PROLOG validates these concepts. >

This paper describes an approach to the design of virtual control circuits on Xilinx XC6200 dynamically reconfigurable FPGAs. Virtual capability allows the same hardware to be used to implement different parts of a control algorithm. The specification method adopted is based on Hierarchical Graph-Schemes. The circuit implementation model uses Hierarchical Finite State Machines, which support top-down decomposition of the control algorithms.

An agent-based modeling framework for the multi-UAV rendezvous recharging problem

The paper analyses and compares alternative iterative and recursive implementations of N-ary search algorithms in hardware (in field programmable gate arrays, in particular). The improvements over the previous results have been achieved with the aid of the proposed novel methods for the fast implementation of hierarchical algorithms. The methods possess the following distinctive features: 1) providing sub-algorithms with multiple entry points; 2) fast stack unwinding for exits from recursive sub-algorithms; 3) hierarchical returns based on two alternative approaches; 4) rational use of embedded memory blocks for the design of a hierarchical finite state machine.

Verification of scope-dependent hierarchical state machines

Content-based visualization for intelligent problem-solving environments

In model based development, embedded systems are modeled using a mix of dataflow formalism, that capture the flow of computation, and hierarchical state machines, that capture the modal behavior of the system. For safety analysis, existing approaches rely on a compilation scheme that transform the original model (dataflow and state machines) into a pure dataflow formalism. Such compilation often result in loss of important structural information that capture the modal behaviour of the system. In previous work we have developed a compilation technique from a dataflow formalism into modular Horn clauses. In this paper, we present a novel technique that faithfully compile hierarchical state machines into modular Horn clauses. Our compilation technique preserves the structural and modal behavior of the system, making the safety analysis of such models more tractable.

We propose an hierarchical state machine (HSM) model for specifying behavioral interfaces of peers participating in a composite Web service. We integrate the HSM model to a design pattern which is supported by a modular verification technique that can 1) statically analyze the properties about global interactions of a composite Web service and 2) check the conformance of the Java implementations of the participant peers to their interfaces. We extend the synchronizability analysis to HSMs to efficiently identify composite Web services whose global interactions can be analyzed with respect to unbounded queues using finite state model checkers. We also discuss automated translation of behavioral interfaces specified as HSMs to BPEL specifications to be published and used by other services.