Filters








958 Hits in 5.3 sec

Shape Recognition by a Finite Automaton Robot

Robert Gmyr, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, Christian Scheideler, Michael Wagner
2018 International Symposium on Mathematical Foundations of Computer Science  
Motivated by the problem of shape recognition by nanoscale computing agents, we investigate the problem of detecting the geometric shape of a structure composed of hexagonal tiles by a finite-state automaton  ...  To determine the computational power of the finite-state automaton robot, we identify functions that can or cannot be decided when the robot is given a certain number of pebbles.  ...  M F C S 2 0 1 8 52:4 Shape Recognition by a Finite Automaton Robot Our Contributions In this paper we investigate the problem of shape recognition by a single robot.  ... 
doi:10.4230/lipics.mfcs.2018.52 dblp:conf/mfcs/GmyrHKKRS18 fatcat:5rapwqohibgunfaftbp6ifibly

Space Ants: Constructing and Reconfiguring Large-Scale Structures with Finite Automata

Amira Abdel-Rahman, Aaron T. Becker, Daniel E. Biediger, Kenneth C. Cheung, Sándor P. Fekete, Neil A. Gershenfeld, Sabrina Hugo, Benjamin Jenett, Phillip Keldenich, Eike Niehs, Christian Rieck, Arne Schmidt (+4 others)
2020 International Symposium on Computational Geometry  
In this video, we consider recognition and reconfiguration of lattice-based cellular structures by very simple robots with only basic functionality.  ...  We present algorithmic methods that are able to detect and reconfigure arbitrary polyominoes, based on finite-state robots, while also preserving connectivity of a structure during reconfiguration.  ...  Furthermore, they presented algorithms for shape formation [28] and shape recognition [27] using robots on tiles.  ... 
doi:10.4230/lipics.socg.2020.73 dblp:conf/compgeom/Abdel-RahmanBBC20 fatcat:belfwfzkt5enjn3fh4cbjtnfx4

Activity Recognition Using Probabilistic Timed Automata [chapter]

Lucjan Pelc, Bogdan Kwolek
2008 Pattern Recognition Techniques, Technology and Applications  
Non-deterministic finite automaton has been employed in work (Wada & Matsuyama, 2000) as a sequence analyzer.  ...  The automaton makes the transition that has been caused by the action a and resets the clock t.  ...  By employing depth, color, as well as elliptical shape features the utilized particle filter tracks a head over a sequence of images and generates the trajectories of the head.  ... 
doi:10.5772/6249 fatcat:kw2lzh6d7rbv5cvgnqq2uiydcm

Algorithmic and complexity issues of robot motion in an uncertain environment

Vladimir J Lumelsky
1987 Journal of Complexity  
This paper presents a survey of one approach to planning collision-free paths for an automaton operating in an environment with obstacles. Path planning is one of the central problems in robotics.  ...  Typically, the task is presented in the two-or three-dimensional space, with the automaton being either an autonomous vehicle or an arm manipulator with a fixed base.  ...  In general, the actual path of a finite automaton will differ from that of a point automaton.  ... 
doi:10.1016/0885-064x(87)90025-2 fatcat:jmdrt2a6dzapjjwxcqnaz4cubu

The Hand-gesture-based Control Interface with Wearable Glove System

Vladislav Berezhnoy, Dmitry Popov, Ilya Afanasyev, Nikolaos Mavridis
2018 Proceedings of the 15th International Conference on Informatics in Control, Automation and Robotics  
The paper presents an approach to building a gesture-based control interface with a wearable glove system and a real-time gesture recognition algorithm.  ...  FCM) clustering and constructing grammars of gestures by fuzzy membership functions.  ...  ACKNOWLEDGEMENTS This research has been supported by the grant of Russian Ministry of Education and Science, agreement: No14.606.21.0007, ID: RFMEFI60617X0007, "Android Technics" company and Innopolis  ... 
doi:10.5220/0006909304580465 dblp:conf/icinco/BerezhnoyPAM18 fatcat:a2uyf5yvszamlojr5wxdw5ovfa

Style-Based Robotic Motion in Contemporary Dance Performance [chapter]

Amy LaViers, Lori Teague, Magnus Egerstedt
2014 Controls and Art  
This chapter reviews a framework for generating robotic motion and describes its application in a performance at Georgia Institute of Technology.  ...  The sequencing framework is then employed in performance both on a humanoid robot and real dancers.  ...  The performance of "Automaton" was funded by a generous grant from GA Tech's School of Electrical and Computer Engineering.  ... 
doi:10.1007/978-3-319-03904-6_9 fatcat:kbghyyt5hnbvdh7i7fldb6hybu

Software Modeling of Technical Objects

Vasily Osipov, Alexander Vodijo, Radoslav Yoshinov, Nataly Zhukova
2020 Problemi na tehničeskata kibernetika i robotikata  
It is proposed to use multi-level relatively finite operational automats when building the models. Such automats can reflect the behavior of both single and group objects.  ...  Acknowledgment This work is supported by National Science Program "Information and Communication technologies for unified Digital Market in Science, Education and security".  ...  The dimension of an automaton is determined by the number of generalized states, which can be finite or countable.  ... 
doi:10.7546/pecr.72.20.03 fatcat:cogiezny2zbk5ly4ykf55vyzji

An interactive interface for service robots

E.A. Topp, D. Kragic, P. Jensfelt, H.I. Christensen
2004 IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004  
Guided by a number of scenarios commonly used in a service robot framework, the experimental evaluation will show the benefit of sensory integration which allows the design of a robust and natural interaction  ...  In this paper, we present an initial design of an interactive interface for a service robot based on multi sensor fusion.  ...  ACKNOWLEDGMENT This paper is based on a master thesis project of Professor R.  ... 
doi:10.1109/robot.2004.1308790 dblp:conf/icra/ToppKJC04 fatcat:a6dphyw4cnarjhox4fow6bllda

The Motion Grammar: Analysis of a Linguistic Method for Robot Control

Neil Dantam, Mike Stilman
2013 IEEE Transactions on robotics  
The production rules of the grammar represent a top-down task decomposition of robot behavior. The terminal symbols of this language represent sensor readings that are parsed in real-time.  ...  We present the Motion Grammar: an approach to represent and verify robot control policies based on Context-Free Grammars.  ...  Finite Automaton.  ... 
doi:10.1109/tro.2013.2239553 fatcat:iths6v7uhvd37gbv4usnynhq3y

Modular Verification for a Class of PLTL Properties [chapter]

Pierre-Alain Masson, Hassan Mountassir, Jacques Julliand
2000 Lecture Notes in Computer Science  
The verification of dynamic properties of a reactive systems by model-checking leads to a potential combinatorial explosion of the state space that has to be checked.  ...  These conditions define a larger class which contains other patterns such as 2(p ⇒ (qU r)). Finally, we show through the example of an industrial Robot that this method is valid in a practical way.  ...  Definition 7 (Recognition of a Finite Path) A finite path σ = s 0 s 1 . . . s n of a transition system T S =< A, S, S 0 , →, AP, L > is recognized by a path τ = b 0 b 1 . . . b n+1 of a Büchi automaton  ... 
doi:10.1007/3-540-40911-4_23 fatcat:2fo3bxhfijhfpmxudwy2etbdei

Inferring finite automata with stochastic output functions and an application to map learning

Thomas Dean, Dana Angluin, Kenneth Basye, Sean Engelson, Leslie Kaelbling, Evangelos Kokkevis, Oded Maron
1995 Machine Learning  
We formulate map learning as the problem of inferring from noisy observations the structure of a reduced deterministic finite automaton.  ...  It is often useful for a robot to construct a spatial representation of its environment from experiments and observations, in other words, to learn a map of its environment by exploration.  ...  Acknowledgments This work was supported in part by a National Science Foundation Presidential Young Investigator Award IRI-8957601, by the Air Force and the Advanced Research Projects Agency of the Department  ... 
doi:10.1007/bf00993822 fatcat:y7x26upvnnewtjxmfuotnixb2q

The Motion Grammar: Linguistic Perception, Planning, and Control

Neil Dantam, Mike Stilman
2011 Robotics: Science and Systems VII  
Branches of the syntax tree form the levels of a hierarchical decomposition, and the individual robot sensor readings are given by tokens.  ...  We implement this approach in the interactive game of Yamakuzushi on a physical robot resulting in a system that repeatably competes with a human opponent in sustained game-play for matches up to six minutes  ...  Since we can transform Σ to a Finite Automaton, Σ must recognize a Regular System Language.  ... 
doi:10.15607/rss.2011.vii.007 dblp:conf/rss/DantamS11 fatcat:ycs6vcjcevaupdt6gfg5uxjvd4

Neuro-Fuzzy Network Technique for Semantic Segmentation Robotics

Kanwaljit Kaur, Gurjit Singh
2017 International Journal of Computer Applications  
The proposed technique work better for robotic environment for fast and efficient results.The proposed technique provides better accuracy as compared to previous technique and work better in semantic segmentation  ...  Difficulties of the situation recognition drawback are usually stricken by massive look and read point the main task of robotics is semantic central unit.  ...  A regular RF classifier usually processes data points severally from one another, and every information corresponds to a feature vector that is sometimes calculated during a closely finite native region  ... 
doi:10.5120/ijca2017915858 fatcat:627s5bv4n5e6jinqbf2p6a7u4y

Decentralized evolution of robotic behavior using finite state machines

Lukas König, Sanaz Mostaghim, Hartmut Schmeck, Suranga Hettiarachchi
2009 International Journal of Intelligent Computing and Cybernetics  
Paper type: Research paper Purpose: In Evolutionary Robotics (ER), robotic control systems are subject to a developmental process inspired by natural evolution.  ...  In this article, a control system representation based on Finite State Machines (FSMs) is utilized to build a decentralized online-evolutionary framework for swarms of mobile robots.  ...  Therefore, we use Finite State Machines (FSMs) for the representation of robotic controllers, introducing a model called Moore Automaton for Robot Behavior (MARB) (based on the preliminary work by König  ... 
doi:10.1108/17563780911005845 fatcat:ckqqaswhsbdeljife5kukb44xm

Finite Automata, Pattern Recognition and Perceptrons

Herbert B. Keller
1961 Journal of the ACM  
Any finite automaton with n-input lines and k-output lines then corresponds, at each instant of time, to some function f € F(S,R); ie., ‘oe | Il ee on on 1eS FINITE AUTOMATA, PATTERN RECOGNITION AND PERCEPTRONS  ...  FINITE AUTOMATA, PATTERN RECOGNITION AND PERCEPTRONS 7 Returning to the proposed automaton we let all the input lines go to some device which adds the binary signals on them and represents the sum as a  ... 
doi:10.1145/321052.321053 fatcat:itphuokpefeabo42vmfok5dzl4
« Previous Showing results 1 — 15 out of 958 results