Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

10192938 · Oct 201919922001200920172026
48 results for wheeled robots

A novel controller for wheeled robots handles joystick inputs for smooth steering.

problem Steering control for differential-drive wheeled robots from indirect joystick inputs.
method Developed a geometric controller based on Darboux frame kinematics.
result Smooth trajectories achieved with safety constraints and no desired states.

In this work we describe the preparation of a time series dataset of inertial measurements for determining the surface type under a wheeled robot. The data consists of over 7600 labeled time series samples, with the corresponding surface type annotation. This data was used in two public competitions with over 1500 part…

2019-05-01abs ↗pdf ↗

New model for visual cortex border completion using bicycle wheel motions.

problem Understanding border completion in the visual cortex V1.
method Sub-Riemannian Hamiltonian formalism and bicycle wheel analogy.
result Analogies between visual cortex border completion and bicycle wheel motions.

The paper develops a learning framework for diverse legged robots.

problem General and autonomous learning of core skills in locomotion.
method Data-efficient, off-policy multi-task RL algorithm with semantically identical reward functions.
result The same algorithm can learn diverse and reusable locomotion skills across different legged robots.

In multi-task reinforcement learning there are two main challenges: at training time, the ability to learn different policies with a single model; at test time, inferring which of those policies applying without an external signal. In the case of continual reinforcement learning a third challenge arises: learning tasks…

2019-07-11abs ↗pdf ↗

The paper computes groups and modules for wheel graphs using Fibonacci and Chebyshev polynomials.

problem Computing groups and modules for wheel graphs.
method Utilized Fibonacci and Chebyshev polynomials to compute the Reduced Fox Coloring Group and Alexander-Burau-Fox Module.
result Computed groups and modules for wheel graphs using Fibonacci and Chebyshev polynomials.

The purpose of this research paper it is to present a new approach in the framework of a biased roulette wheel. It is used the approach of a quantitative trading strategy, commonly used in quantitative finance, in order to assess the profitability of the strategy in the short term. The tools of backtesting and walk-for…

2016-09-30abs ↗pdf ↗

In a previous paper, we generalized the definition of the framed Kontsevich integral initially presented by Le and Murakami. We also defined an isotopy invariant Z~f\widetilde{Z}_f that is well-behaved under band sum moves. Using this invariant we study the construction of the LMO invariant, the Wheeling Theorem, and th…

2010-10-13abs ↗pdf ↗

We study the unwheeled rational Kontsevich integral of torus knots. We give a precise formula for these invariants up to loop degree 3 and show that they appear as colorings of simple diagrams. We show that they behave under cyclic branched coverings in a very simple way. Our proof is combinatorial: it uses the results…

2003-10-08abs ↗pdf ↗

Using technique of wheeled props we establish a correspondence between the homotopy theory of unimodular Lie 1-bialgebras and the famous Batalin-Vilkovisky formalism. Solutions of the so called quantum master equation satisfying certain boundary conditions are proven to be in 1-1 correspondence with representations of …

2008-04-15abs ↗pdf ↗

We study the rational Kontsevich integral of torus knots. We construct explicitely a series of diagrams made of circles joined together in a tree-like fashion and colored by some special rational functions. We show that this series codes exactly the unwheeled rational Kontsevich integral of torus knots, and that it beh…

2004-04-14abs ↗pdf ↗

This paper studies the construction of geometric integrators for nonholonomic systems. We derive the nonholonomic discrete Euler-Lagrange equations in a setting which permits to deduce geometric integrators for continuous nonholonomic systems (reduced or not). The formalism is given in terms of Lie groupoids, specifyin…

2007-04-12abs ↗pdf ↗

We express characteristic numbers of compact hyperkähler manifolds in graph-theoretical form, considering them as a special case of the curvature invariants introduced by Rozansky and Witten. The appropriate graphs are generated by ``wheels'' and we use the recently proved Wheeling Theorem to give a formula for the L2 …

1999-08-20abs ↗pdf ↗

The complement of a non-separating planar graph contains a K_n minor.

problem Characterizing the structure of complements of planar graphs.
method Analyzing the structure of complements of non-separating planar graphs and using examples to illustrate hypotheses.
result The order 2n-3 is the lowest possible for a non-separating planar graph whose complement contains a K_n minor.

We write a formula for the LMO invariant of a rational homology sphere presented as a rational surgery on a link in S^3. Our main tool is a careful use of the Aarhus integral and the (now proven) "Wheels" and "Wheeling" conjectures of B-N, Garoufalidis, Rozansky and Thurston. As steps, side benefits and asides we give …

2000-07-07abs ↗pdf ↗

We recall the construction of the Kontsevich graph orientation morphism γOr(γ)γ\mapsto {\rm O\vec{r}}(γ) which maps cocycles γγ in the non-oriented graph complex to infinitesimal symmetries P˙=Or(γ)(P)\dot{\mathcal{P}} = {\rm O\vec{r}}(γ)(\mathcal{P}) of Poisson bi-vectors on affine manifolds. We reveal in particular why there alw…

2018-11-19abs ↗pdf ↗

Hybrid model uses LLM to build transparent Bayesian networks for trading decisions.

problem Rigorous and transparent reasoning required in financial trading, especially for options strategies.
method Combines LLM strengths with Bayesian Networks, using LLM to construct context-specific networks and select relevant data.
result Empirically, the hybrid system outperforms market benchmarks with superior risk-adjusted performance.

The paper tackles exact linearization and control of flat discrete-time systems.

problem Exact linearization and control of flat nonlinear discrete-time systems.
method Investigates conditions for choosing new inputs and feedbacks that may depend on forward-shifts of the new input.
result Easily verifiable conditions for choosing a feasible input and a new input that minimizes forward-shifts of the flat output.

Autonomous robots often encounter challenging situations where their control policies fail and an expert human operator must briefly intervene, e.g., through teleoperation. In settings where multiple robots act in separate environments, a single human operator can manage a fleet of robots by identifying and teleoperati…

2019-09-22abs ↗pdf ↗

A new framework for robot block-stacking tasks using causal probabilistic models.

problem Robots fail outside controlled environments due to uncertainty and lack of explicit design for all scenarios.
method Causal probabilistic framework combining causal models and probabilistic representations of noise.
result Robots can perceive, reason about, and explain their environment for block-stacking tasks.

This research evaluates learning models for bionic robots, focusing on transfer function identification.

problem Developers need guidance on selecting and constructing transfer functions for bionic robots.
method Comprehensive evaluation strategy including data collection, learning model selection, comparative analysis, and transfer function identification.
result A framework for effectively dealing with multi-input multi-output robotic data.

Deep Reinforcement Learning (DRL) has emerged as a powerful control technique in robotic science. In contrast to control theory, DRL is more robust in the thorough exploration of the environment. This capability of DRL generates more human-like behaviour and intelligence when applied to the robots. To explore this capa…

2019-10-16abs ↗pdf ↗

ROBEL is an open-source platform of cost-effective robots designed for reinforcement learning in the real world. ROBEL introduces two robots, each aimed to accelerate reinforcement learning research in different task domains: D'Claw is a three-fingered hand robot that facilitates learning dexterous manipulation tasks, …

2019-09-25abs ↗pdf ↗

Learning to control robots directly based on images is a primary challenge in robotics. However, many existing reinforcement learning approaches require iteratively obtaining millions of robot samples to learn a policy, which can take significant time. In this paper, we focus on learning a realistic world model capturi…

2018-05-20abs ↗pdf ↗

Learning robot objective functions from human input has become increasingly important, but state-of-the-art techniques assume that the human's desired objective lies within the robot's hypothesis space. When this is not true, even methods that keep track of uncertainty over the objective fail because they reason about …

2018-10-11abs ↗pdf ↗

Top 8 robotic vision systems tackled lifelong object recognition challenges.

problem Lifelong learning in robotic vision for varied, dynamic environments.
method Design of a dataset with diverse conditions and rules for evaluation.
result Robotic vision systems improved over time with dynamic object appearances.