Using Abstraction for Interpretable Robot Programs in Stochastic Domains
- URL: http://arxiv.org/abs/2207.12763v1
- Date: Tue, 26 Jul 2022 09:15:37 GMT
- Title: Using Abstraction for Interpretable Robot Programs in Stochastic Domains
- Authors: Till Hofmann, Vaishak Belle
- Abstract summary: A robot's actions are inherently noisy, as its sensors are noisy and its actions do not always have the intended effects.
Golog has been extended to models with degrees of belief and actions.
The resulting programs are much harder to comprehend, because they need to deal with the noise.
We define a high-level and nonstochastic model of the robot and then map the high-level model into the lower-level model.
- Score: 17.04153879817609
- License: http://creativecommons.org/licenses/by-sa/4.0/
- Abstract: A robot's actions are inherently stochastic, as its sensors are noisy and its
actions do not always have the intended effects. For this reason, the agent
language Golog has been extended to models with degrees of belief and
stochastic actions. While this allows more precise robot models, the resulting
programs are much harder to comprehend, because they need to deal with the
noise, e.g., by looping until some desired state has been reached with
certainty, and because the resulting action traces consist of a large number of
actions cluttered with sensor noise. To alleviate these issues, we propose to
use abstraction. We define a high-level and nonstochastic model of the robot
and then map the high-level model into the lower-level stochastic model. The
resulting programs are much easier to understand, often do not require belief
operators or loops, and produce much shorter action traces.
Related papers
- Adaptive Motion Generation Using Uncertainty-Driven Foresight Prediction [2.2120851074630177]
Uncertainty of environments has long been a difficult characteristic to handle, when performing real-world robot tasks.
This paper extended an existing predictive learning based robot control method, which employ foresight prediction using dynamic internal simulation.
The results showed that the proposed model adaptively diverged its motion through interaction with the door, whereas conventional methods failed to stably diverge.
arXiv Detail & Related papers (2024-10-01T15:13:27Z) - Innate Motivation for Robot Swarms by Minimizing Surprise: From Simple Simulations to Real-World Experiments [6.21540494241516]
Large-scale mobile multi-robot systems can be beneficial over monolithic robots because of higher potential for robustness and scalability.
Developing controllers for multi-robot systems is challenging because the multitude of interactions is hard to anticipate and difficult to model.
Innate motivation tries to avoid the specific formulation of rewards and work instead with different drivers, such as curiosity.
A unique advantage of the swarm robot case is that swarm members populate the robot's environment and can trigger more active behaviors in a self-referential loop.
arXiv Detail & Related papers (2024-05-04T06:25:58Z) - ManiGaussian: Dynamic Gaussian Splatting for Multi-task Robotic Manipulation [58.615616224739654]
Conventional robotic manipulation methods usually learn semantic representation of the observation for prediction.
We propose a dynamic Gaussian Splatting method named ManiGaussian for multi-temporal robotic manipulation.
Our framework can outperform the state-of-the-art methods by 13.1% in average success rate.
arXiv Detail & Related papers (2024-03-13T08:06:41Z) - RoboScript: Code Generation for Free-Form Manipulation Tasks across Real
and Simulation [77.41969287400977]
This paper presents textbfRobotScript, a platform for a deployable robot manipulation pipeline powered by code generation.
We also present a benchmark for a code generation benchmark for robot manipulation tasks in free-form natural language.
We demonstrate the adaptability of our code generation framework across multiple robot embodiments, including the Franka and UR5 robot arms.
arXiv Detail & Related papers (2024-02-22T15:12:00Z) - Towards Bridging the Gap between High-Level Reasoning and Execution on
Robots [2.6107298043931206]
When reasoning about actions, e.g., by means of task planning or agent programming with Golog, the robot's actions are typically modeled on an abstract level.
However, when executing such an action on a robot it can no longer be seen as a primitive.
In this thesis, we propose several approaches towards closing this gap.
arXiv Detail & Related papers (2023-12-30T12:26:12Z) - Interactive Planning Using Large Language Models for Partially
Observable Robotics Tasks [54.60571399091711]
Large Language Models (LLMs) have achieved impressive results in creating robotic agents for performing open vocabulary tasks.
We present an interactive planning technique for partially observable tasks using LLMs.
arXiv Detail & Related papers (2023-12-11T22:54:44Z) - Robot Learning with Sensorimotor Pre-training [98.7755895548928]
We present a self-supervised sensorimotor pre-training approach for robotics.
Our model, called RPT, is a Transformer that operates on sequences of sensorimotor tokens.
We find that sensorimotor pre-training consistently outperforms training from scratch, has favorable scaling properties, and enables transfer across different tasks, environments, and robots.
arXiv Detail & Related papers (2023-06-16T17:58:10Z) - Formal Modelling for Multi-Robot Systems Under Uncertainty [11.21074891465253]
We review modelling formalisms for multi-robot systems under uncertainty.
We discuss how they can be used for planning, reinforcement learning, model checking, and simulation.
arXiv Detail & Related papers (2023-05-26T15:23:35Z) - Distributional Instance Segmentation: Modeling Uncertainty and High
Confidence Predictions with Latent-MaskRCNN [77.0623472106488]
In this paper, we explore a class of distributional instance segmentation models using latent codes.
For robotic picking applications, we propose a confidence mask method to achieve the high precision necessary.
We show that our method can significantly reduce critical errors in robotic systems, including our newly released dataset of ambiguous scenes.
arXiv Detail & Related papers (2023-05-03T05:57:29Z) - Can Foundation Models Perform Zero-Shot Task Specification For Robot
Manipulation? [54.442692221567796]
Task specification is critical for engagement of non-expert end-users and adoption of personalized robots.
A widely studied approach to task specification is through goals, using either compact state vectors or goal images from the same robot scene.
In this work, we explore alternate and more general forms of goal specification that are expected to be easier for humans to specify and use.
arXiv Detail & Related papers (2022-04-23T19:39:49Z) - Learning from Sparse Demonstrations [17.24236148404065]
The paper develops the method of Continuous Pontryagin Differentiable Programming (Continuous PDP), which enables a robot learn an objective function from a few demonstrated examples.
The method finds an objective function and a time-warping function such that the robot's resulting trajectorys sequentially follow the trajectorys with minimal discrepancy loss.
The method is first evaluated on a simulated robot arm and then applied to a 6-DoF quadrotor to learn an objective function for motion planning in unmodeled environments.
arXiv Detail & Related papers (2020-08-05T14:25:39Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.