English
Related papers

Related papers: Forgetting Event Order in Higher-Dimensional Autom…

200 papers

The problem of identifying geometric structure in data is a cornerstone of (unsupervised) learning. As a result, Geometric Representation Learning has been widely applied across scientific and engineering domains. In this work, we…

Machine Learning · Computer Science 2025-06-03 Imran Nasim , Melanie Weber

State estimation of multi-modal hybrid systems is an important problem with many applications in the field robotics. However, incorporating discrete modes in the estimation process is hampered by a potentially combinatorial growth in…

Robotics · Computer Science 2021-03-25 Fan Jiang , Varun Agrawal , Russell Buchanan , Maurice Fallon , Frank Dellaert

Deformable object manipulation stands as one of the most captivating yet formidable challenges in robotics. While previous techniques have predominantly relied on learning latent dynamics through demonstrations, typically represented as…

Robotics · Computer Science 2025-02-04 Yang You , Bokui Shen , Congyue Deng , Haoran Geng , Songlin Wei , He Wang , Leonidas Guibas

This paper introduces the SEAD framework that simplifies the process of designing and describing autonomous vehicle platooning manoeuvres. Although a large body of research has been formulating platooning manoeuvres, it is still challenging…

Multiagent Systems · Computer Science 2021-04-13 Corvin Deboeser , Jordan Ivanchev , Thomas Braud , Alois Knoll , David Eckhoff , Alberto Sangiovanni-Vincentelli

Stochastic HYPE is a novel process algebra that models stochastic, instantaneous and continuous behaviour. It develops the flow-based approach of the hybrid process algebra HYPE by replacing non-urgent events with events with…

Systems and Control · Computer Science 2014-11-18 Luca Bortolussi , Vashti Galpin , Jane Hillston

Traditionally, finite automata theory has been used as a framework for the representation of possibly infinite sets of strings. In this work, we introduce the notion of second-order finite automata, a formalism that combines finite automata…

Formal Languages and Automata Theory · Computer Science 2021-08-31 Alexsander Andrade de Melo , Mateus de Oliveira Oliveira

In this paper we present a unifying approach for deciding various bisimulations, simulation equivalences and preorders between two timed automata states. We propose a zone based method for deciding these relations in which we eliminate an…

Formal Languages and Automata Theory · Computer Science 2013-07-30 Shibashis Guha , Shankara Narayanan Krishna , Chinmay Narayan , S. Arun-Kumar

Reasoning from sequences of raw sensory data is a ubiquitous problem across fields ranging from medical devices to robotics. These problems often involve using long sequences of raw sensor data (e.g. magnetometers, piezoresistors) to…

Optimization decomposition methods are a fundamental tool to develop distributed solution algorithms for large scale optimization problems arising in fields such as machine learning and optimal control. In this paper, we present an…

Optimization and Control · Mathematics 2024-03-12 Tyler Hanks , Matthew Klawonn , Evan Patterson , Matthew Hale , James Fairbanks

Hybrid manufacturing (HM) technologies combine additive and subtractive manufacturing (AM/SM) capabilities, leveraging AM's strengths in fabricating complex geometries and SM's precision and quality to produce finished parts. We present a…

Computational Geometry · Computer Science 2018-05-21 Morad Behandish , Saigopal Nelaturi , Johan de Kleer

Data Drift is the phenomenon where the generating model behind the data changes over time. Due to data drift, any model built on the past training data becomes less relevant and inaccurate over time. Thus, detecting and controlling for data…

Machine Learning · Computer Science 2025-04-29 Subhadip Bandyopadhyay , Joy Bose , Sujoy Roy Chowdhury

Attention regulates information transfer between tokens. For this, query and key vectors are compared, typically in terms of a scalar product, $\mathbf{Q}^T\mathbf{K}$, together with a subsequent softmax normalization. In geometric terms,…

Machine Learning · Computer Science 2025-08-11 Claudius Gros

Sudden changes in the dynamics of robotic tasks, such as contact with an object or the latching of a door, are often viewed as inconvenient discontinuities that make manipulation difficult. However, when these transitions are…

Robotics · Computer Science 2020-08-07 Ajinkya Jain , Scott Niekum

First-order logic is a natural way of expressing properties of computation. It is traditionally used in various program logics for expressing the correctness properties and certificates. Although such representations are expressive for some…

Programming Languages · Computer Science 2021-04-15 Yurii Kostyukov , Dmitry Mordvinov , Grigory Fedyukovich

We study the expressiveness and succinctness of history-deterministic pushdown automata (HD-PDA) over finite words, that is, pushdown automata whose nondeterminism can be resolved based on the run constructed so far, but independently of…

Formal Languages and Automata Theory · Computer Science 2024-08-07 Shibashis Guha , Ismaël Jecker , Karoliina Lehtinen , Martin Zimmermann

We address the problem of efficiently organizing search over very large trees, which arises in many applications ranging from autonomous driving to aerial vehicles. Here, we are motivated by off-road autonomy, where real-time planning is…

Robotics · Computer Science 2025-12-10 Sidharth Talia , Oren Salzman , Siddhartha Srinivasa

FPGAs provide highly parallel and customizable hardware solutions but are traditionally programmed using low-level Hardware Description Languages (HDLs) like VHDL and Verilog. These languages have a low level of abstraction and require…

Hardware Architecture · Computer Science 2025-04-11 Hendrik Folmer

This thesis investigates the central role of homomorphism problems (structure-preserving maps) in two complementary domains: database querying over finite, graph-shaped data, and constraint solving over (potentially infinite) structures.…

Logic in Computer Science · Computer Science 2025-10-10 Rémi Morvan

In this work, we develop a fully implicit Hybrid High-Order algorithm for the Cahn-Hilliard problem in mixed form. The space discretization hinges on local reconstruction operators from hybrid polynomial unknowns at elements and faces. The…

Numerical Analysis · Mathematics 2016-07-01 Florent Chave , Daniele A. Di Pietro , Fabien Marche , Franck Pigeonneau

While end-to-end Vision-Language-Action (VLA) models offer a promising paradigm for robotic manipulation, fine-tuning them on narrow control data often compromises the profound reasoning capabilities inherited from their base…

Computer Vision and Pattern Recognition · Computer Science 2026-05-12 Tianshuo Yang , Guanyu Chen , Yutian Chen , Zhixuan Liang , Yitian Liu , Zanxin Chen , Chunpu Xu , Haotian Liang , Jiangmiao Pang , Yao Mu , Ping Luo