• Corpus ID: 239015891

Lifting DecPOMDPs for Nanoscale Systems - A Work in Progress

  title={Lifting DecPOMDPs for Nanoscale Systems - A Work in Progress},
  author={Tanya Braun and Stefan Fischer and Florian-Lennert Adrian Lau and Ralf Moller},
DNA-based nanonetworks have a wide range of promising use cases, especially in the field of medicine. With a large set of agents, a partially observable stochastic environment, and noisy observations, such nanoscale systems can be modelled as a decentralised, partially observable, Markov decision process (DecPOMDP). As the agent set is a dominating factor, this paper presents (i) lifted DecPOMDPs, partitioning the agent set into sets of indistinguishable agents, reducing the worstcase space… 

Figures from this paper

Lifting in multi-agent systems under uncertainty

Inspired by lifted inference, this paper examines symmetries within the agent set for a potential tractability and a compact encoding of symmetric DecPOMDPs as partitioned DecPomDPs and a formal analysis of complexity and tractability.

Who did it? Identifying the Most Likely Origins of Events

This paper investigates the problem of only knowing that events are observed, from a number of sensors or for individuals, but not which sensors or individuals exhibit those events specifically, and shows how lifting allows for generating all different possibilities to map those events, as it can do it over sets of indistinguishable random variables, leading to a set of queries.



Computation of decision problems within messages in DNA-tile-based molecular nanonetworks

Nanonetworks: A new communication paradigm

DNA-Based Molecular Communication as a Paradigm for Multi-Parameter Detection of Diseases

A variety of novel advantages and use cases for DNA-based molecular communication, which allows for adjustable error correction, immediate treatments, bio-compatibility, and the use of already available materials are presented.

Self-assembly of a nanoscale DNA box with a controllable lid

The DNA origami method is extended into three dimensions by creating an addressable DNA box that can be opened in the presence of externally supplied DNA ‘keys’, and controlled access to the interior compartment of this DNA nanocontainer could yield several interesting applications.

Approximate Solution Techniques for Factored First-Order MDPs

An extension of the FOM DP formalism known as a factored FOMDP is proposed and generalizations of symbolic dynamic programming and linear-value approximation solutions to exploit its structure are presented to make contributions to the field of first-order probabilistic inference.

Symbolic Dynamic Programming for First-order POMDPs

This work shows that it is also possible to exploit the full expressive power of first-order quantification to achieve state, action, and observation abstraction in a dynamic programming solution to relationally specified POMDPs.

Lifted Probabilistic Inference by Variable Elimination

Lifting attempts to improve the efficiency of inference by exploiting the symmetries in themodel, to perform an inference operation once for a whole group of interchangeable objects, instead of once per individual in.

First-Order Open-Universe POMDPs

This work examines the problem of extending a declarative PPL to define decision problems (specifically, POMDPs) and identifies non-trivial representational issues in describing an agent's capability for observation and action—issues that were avoided in previous work only by making strong and restrictive assumptions.

Symbolic Dynamic Programming for First-Order MDPs

This technique uses an MDP whose dynamics is represented in a variant of the situation calculus allowing for stochastic actions and produces a logical description of the optimal value function and policy by constructing a set of first-order formulae that minimally partition state space according to distinctions made by the valuefunction and policy.

Exploiting symmetries for scaling loopy belief propagation and relational training

This paper shows that (loopy) belief propagation (BP) can be lifted and establishes a link between lifting and radix sort, which paves the way for the first scalable lifted training approaches based on stochastic gradients, both in an online and a MapReduce fashion.