scholarly journals Human–Robot Collaborative Assembly Based on Eye-Hand and a Finite State Machine in a Virtual Environment

2021 ◽  
Vol 11 (12) ◽  
pp. 5754
Author(s):  
Xue Zhao ◽  
Ye He ◽  
Xiaoan Chen ◽  
Zhi Liu
Keyword(s):  
Virtual Reality ◽  
Virtual Environment ◽  
Global Economy ◽  
Finite State Machine ◽  
State Machines ◽  
Probabilistic Roadmap ◽  
Assembly Method ◽  
Collaborative Assembly ◽  
Finite State ◽  
Object Move

With the development of the global economy, the demand for manufacturing is increasing. Accordingly, human–robot collaborative assembly has become a research hotspot. This paper aims to solve the efficiency problems inherent in traditional human-machine collaboration. Based on eye–hand and finite state machines, a collaborative assembly method is proposed. The method determines the human’s intention by collecting posture and eye data, which can control a robot to grasp an object, move it, and perform co-assembly. The robot’s automatic path planning is based on a probabilistic roadmap planner. Virtual reality tests show that the proposed method is more efficient than traditional methods.

scholarly journals Reduction in the Number of PAL Macrocells in the Circuit of a Moore FSM

2007 ◽  
Vol 17 (4) ◽  
pp. 565-575 ◽  
Author(s):  
Alexander Barkalov ◽  
Larysa Titarenko ◽  
Sławomir Chmielewski
Keyword(s):  
Finite State Machine ◽  
Finite State Machines ◽  
Optimization Methods ◽  
State Machine ◽  
Logic Circuits ◽  
State Machines ◽  
Embedded Memory ◽  
Effective Application ◽  
Finite State

Reduction in the Number of PAL Macrocells in the Circuit of a Moore FSMOptimization methods of logic circuits for Moore finite-state machines are proposed. These methods are based on the existence of pseudoequivalent states of a Moore finite-state machine, a wide fan-in of PAL macrocells and free resources of embedded memory blocks. The methods are oriented to hypothetical VLSI microcircuits based on the CPLD technology and containing PAL macrocells and embedded memory blocks. The conditions of effective application of each proposed method are shown. An algorithm to choose the best model of a finite-state machine for given conditions is proposed. Examples of proposed methods application are given. The effectiveness of the proposed methods is also investigated.

Stable Encoding of Finite-State Machines in Discrete-Time Recurrent Neural Nets with Sigmoid Units

2000 ◽  
Vol 12 (9) ◽  
pp. 2129-2174 ◽  
Author(s):  
Rafael C. Carrasco ◽  
Mikel L. Forcada ◽  
M. Ángeles Valdés-Muñoz ◽  
Ramón P. Ñeco
Keyword(s):  
Discrete Time ◽  
Finite State Machine ◽  
Finite State Machines ◽  
Activation Function ◽  
Neural Nets ◽  
State Machines ◽  
Computational Power ◽  
Simple Strategy ◽  
Finite State ◽  
Detailed Presentation

There has been a lot of interest in the use of discrete-time recurrent neural nets (DTRNN) to learn finite-state tasks, with interesting results regarding the induction of simple finite-state machines from input–output strings. Parallel work has studied the computational power of DTRNN in connection with finite-state computation. This article describes a simple strategy to devise stable encodings of finite-state machines in computationally capable discrete-time recurrent neural architectures with sigmoid units and gives a detailed presentation on how this strategy may be applied to encode a general class of finite-state machines in a variety of commonly used first- and second-order recurrent neural networks. Unlike previous work that either imposed some restrictions to state values or used a detailed analysis based on fixed-point attractors, our approach applies to any positive, bounded, strictly growing, continuous activation function and uses simple bounding criteria based on a study of the conditions under which a proposed encoding scheme guarantees that the DTRNN is actually behaving as a finite-state machine.

High-Speed and Area-Efficient Reconfigurable Multiplexer Bank for RAM-Based Finite State Machine Implementations

2015 ◽  
Vol 24 (07) ◽  
pp. 1550101 ◽  
Author(s):  
Raouf Senhadji-Navaro ◽  
Ignacio Garcia-Vargas
Keyword(s):  
High Speed ◽  
Finite State Machine ◽  
State Of The Art ◽  
Behavioral Model ◽  
State Machine ◽  
The State ◽  
Experimental Results ◽  
State Machines ◽  
Finite State ◽  
Area Efficient

This work is focused on the problem of designing efficient reconfigurable multiplexer banks for RAM-based implementations of reconfigurable state machines. We propose a new architecture (called combination-based reconfigurable multiplexer bank, CRMUX) that use multiplexers simpler than that of the state-of-the-art architecture (called variation-based reconfigurable multiplexer bank, VRMUX). The performance (in terms of speed, area and reconfiguration cost) of both architectures is compared. Experimental results from MCNC finite state machine (FSM) benchmarks show that CRMUX is faster and more area-efficient than VRMUX. The reconfiguration cost of both multiplexer banks is studied using a behavioral model of a reconfigurable state machine. The results show that the reconfiguration cost of CRMUX is lower than that of VRMUX in most cases.

scholarly journals Supply Chain Food Management using HFSM for RTS Game

2018 ◽  
Author(s):  
Dihin Muriyatmoko
Keyword(s):  
Supply Chain ◽  
User Interface ◽  
Finite State Machine ◽  
Finite State Machines ◽  
State Machine ◽  
State Machines ◽  
Game Play ◽  
Food Management ◽  
Finite State ◽  
Rts Game

Finite state machines have becomeextremely popular over the last decade and helpedgame developers build some pretty fun RTS games[1]. Finite State Machines have been widely used asa tool for developing RTS games, especially aspertains to solving problems related to AI, inputhandling, and game progression [2]. Anyhow, tocontrol game play and user interface for SupplyChain Management (SCM) of Food on RTS gameonly played conventional finite state machine(FSM) design. Therefore in this research isdeveloped Food SCM using Hierarchical StateFinite Machine (HFSM).HFSM allow for a modulardevelopment of states that is more maintainable andscalable[3]. The formalism of HFSM makes thestate machine approach truly applicable to real-lifeembedded systems [4].

scholarly journals A DESIGN FOR VERIFICATION APPROACH USING AN EMBEDDING OF PSL IN AsmL

2007 ◽  
Vol 16 (06) ◽  
pp. 859-881 ◽  
Author(s):  
AMJAD GAWANMEH ◽  
SOFIÈNE TAHAR ◽  
HAJA MOINUDEEN ◽  
ALI HABIBI
Keyword(s):  
Model Checking ◽  
Design Process ◽  
Finite State Machine ◽  
System Level ◽  
State Machines ◽  
Top Down ◽  
Finite State ◽  
Property Specification ◽  
Large Systems

In this paper, we propose to integrate an embedding of Property Specification Language (PSL) in Abstract State Machines Language (AsmL) with a top–down design for verification approach in order to enable the model checking of large systems at the early stages of the design process. We provide a complete embedding of PSL in the ASM language AsmL, which allows us to integrate PSL properties as a part of the design. For verification, we propose a technique based on the AsmL tool that translates the code containing both the design and the properties into a finite state machine (FSM) representation. We use the generated FSM to run model checking on an external tool, here SMV. Our approach takes advantage of the AsmL language capabilities to model designs at the system level as well as from the power of the AsmL tool in generating both C# code and FSMs from AsmL models. We applied our approach on the PCI-X bus standard, which AsmL model was constructed from the informal standard specifications and a subsequent UML model. Experimental results on the PCI-X bus case study showed a superiority of our approach to conventional verification.

scholarly journals Gift – An Integrated Development and Training System for Finite State Machine Based Approaches

2017 ◽  
Vol 13 (08) ◽  
pp. 147 ◽  
Author(s):  
Karsten Henke ◽  
Tobias Fäth ◽  
René Hutschenreuter ◽  
Heinz-Dietrich Wuttke
Keyword(s):  
Control Systems ◽  
Digital Control ◽  
Communication Systems ◽  
Finite State Machine ◽  
Finite State Machines ◽  
State Machine ◽  
State Machines ◽  
Digital Control Systems ◽  
Teaching Concept ◽  
Finite State

At the Ilmenau University of Technology’s “Integrated Communication Systems” Department a main teaching concept deals with the design of digital control systems. Different lectures from the 1st to the 8th semester are using Finite State Machines (FSM) as a specification technique to realize different design tasks. During undergraduate studies the basics of Finite State Machines and their usage within the design of digital control systems are taught. To conceptualize more complex digital systems, as required in higher courses, it is necessary to use powerful toolsets. One example of such a toolset is the GIFT (Graphical Interactive Finite State Machine Toolset) system, developed by the Integrated Communications System Group at the Ilmenau University of Technology. With this toolset we want to extent our remote lab GOLDi and implement new techniques for a web-based development system for Finite State Machines.

scholarly journals Applications of Cubic Structures to Subsystems of Finite State Machines

Symmetry ◽  
2018 ◽  
Vol 10 (11) ◽  
pp. 598 ◽  
Author(s):  
Nabilah Abughazalah ◽  
Naveed Yaqoob
Keyword(s):  
Direct Product ◽  
Finite State Machine ◽  
Finite State Machines ◽  
State Machine ◽  
State Machines ◽  
Finite State

This paper concerns three relationship between the recently proposed cubic sets and finite state machines. The notions of cubic finite state machine (cubic FSM), a subsystem of cubic FSM and cartesian composition (direct product, P-(R-) union, and P-(R-) intersection) of two subsystems of cubic FSMs are introduced. We study the cartesian composition, direct product and union of two subsystems of cubic FSMs is a subsystem of a cubic FSM. We provide many examples on each case. We consider conditions for subsystem of cubic FSM to be both an internal cubic subsystem of cubic FSM and an external cubic subsystem of cubic FSM.

Virtual Reality based Mobile Robot Navigation in Greenhouse Environment

2017 ◽  
Vol 8 (2) ◽  
pp. 854-859
Author(s):  
M. Saiful Azimi ◽  
Z. A. Shukri ◽  
M. Zaharuddin
Keyword(s):  
Virtual Reality ◽  
Mobile Robot ◽  
Mobile Robots ◽  
Virtual Environment ◽  
Robot Navigation ◽  
Tracking Error ◽  
Mobile Robot Navigation ◽  
Probabilistic Roadmap ◽  
Time Distance ◽  
Simulation Results

The difficulties of transporting heavy mobile robots limit robotic experiments in agriculture. Virtual reality however, offers an alternative to conduct experiments in agriculture. This paper presents an application of virtual reality in a robot navigational experiment using SolidWorks and simulated into MATLAB. Trajectories were initiated using Probabilistic Roadmap and compared based on travel time, distance and tracking error, and the efficiency was calculated. The simulation results showed that the proposed method was able to conduct the navigational experiment inside the virtual environment. U-turn trajectory was chosen as the best trajectory for crop inspection with 82.7% efficiency.

ALGORITHMS FOR THE JOIN AND AUTO-INTERSECTION OF MULTI-TAPE WEIGHTED FINITE-STATE MACHINES

2008 ◽  
Vol 19 (02) ◽  
pp. 453-476 ◽  
Author(s):  
JEAN-MARC CHAMPARNAUD ◽  
FRANCK GUINGNE ◽  
ANDRÉ KEMPE ◽  
FLORENT NICART
Keyword(s):  
Finite State Machine ◽  
Finite State Machines ◽  
State Machine ◽  
General Algorithm ◽  
State Machines ◽  
Practical Applications ◽  
Rational Relation ◽  
Finite State

A weighted finite-state machine with n tapes describes a rational relation on n strings. We recall some basic operations on n-ary rational relations, recast the important join operation in terms of "auto-intersection", and propose restricted algorithms for both operations. If two rational relations are joined on more than one tape, it can unfortunately lead to non-rational relations with undecidable properties. As a consequence, there cannot be a fully general algorithm, able to compile any rational join or auto-intersection. We define a class of triples 〈A,i,j〉 for which we are able to compile the auto-intersection of the machine A w.r.t. tapes i and j. We hope that this class is sufficient for many practical applications.

scholarly journals Research on the Properties of Lattice-Valued Finite State Machines in Computer Technology

2021 ◽  
Vol 2066 (1) ◽  
pp. 012063
Author(s):  
Zhonggang Hu
Keyword(s):  
Finite State Machine ◽  
Finite State Machines ◽  
State Machine ◽  
Exchange Capacity ◽  
State Machines ◽  
Strong Connectivity ◽  
Algebraic Properties ◽  
Finite State ◽  
Strongly Connected ◽  
Homomorphic Mapping

Abstract In this paper, we discuss some algebraic properties of Lattice valued finite state machine and prove that if there are homomorphic mapping satisfying certain conditions between two Lattice valued finite state machines, the first one is strongly connected (cycle), then then the second one is the same. And if the homomorphism is strongly homomorphic, one of the Lattice valued finite state machines is complete if and only if another Lattice valued finite state machine is complete. Discuss the completeness, strong connectivity, circulation and exchange capacity between the product of a Lattice valued finite state machine and the original Lattice valued finite state machine and get some results.

Sign in / Sign up

Export Citation Format

Share Document