English
Related papers

Related papers: Probabilistic methods of bypassing the maze using …

200 papers

With the development of science and technology, mobile robots are playing a significant important role in the new round of world revolution. Further, mobile robots might assist or replace human beings in a great number of areas. To increase…

Robotics · Computer Science 2024-12-11 Jiawei Meng , Danail Stoyanov

Go has long been considered as a testbed for artificial intelligence. By introducing certain quantum features, such as superposition and collapse of wavefunction, we experimentally demonstrate a quantum version of Go by using correlated…

We study the problem of planning paths for $p$ distinguishable pebbles (robots) residing on the vertices of an $n$-vertex connected graph with $p \le n$. A pebble may move from a vertex to an adjacent one in a time step provided that it…

Data Structures and Algorithms · Computer Science 2015-03-20 Jingjin Yu , Daniela Rus

This paper develops an algorithm that guides a multi-robot system in an unknown environment in search of fixed targets. The area to be scanned contains an unknown number of convex obstacles of unknown size and shape. The algorithm covers…

Robotics · Computer Science 2012-02-13 Jonathan Rogge , Dirk Aeyels

The magic state injection process is a critical component of fault-tolerant quantum computing, and numerous studies have been conducted on this topic. Many existing studies have focused on square-lattice structures, where each qubit…

Quantum Physics · Physics 2024-12-30 Hansol Kim , Wonjae Choi , Younghun Kwon

Nowadays random number generation plays an essential role in technology with important applications in areas ranging from cryptography, which lies at the core of current communication protocols, to Monte Carlo methods, and other…

We introduce and investigate the computational complexity of a novel physical problem known as the Pinball Wizard problem. It involves an idealized pinball moving through a maze composed of one-way gates (outswing doors), plane walls,…

Computational Complexity · Computer Science 2025-10-06 Rosemary Adejoh , Andreas Jakoby , Sneha Mohanty , Christian Schindelhauer

Random number generators (RNG) are an important resource in many areas: cryptography (both quantum and classical), probabilistic computation (Monte Carlo methods), numerical simulations, industrial testing and labeling, hazard games,…

Quantum Physics · Physics 2015-05-27 Mario Stipcevic

In this paper we introduce the \emph{robust random number generation} problem where the goal is to design an abstract tile assembly system (aTAM system) whose terminal assemblies can be split into $n$ partitions such that a resulting…

Formal Languages and Automata Theory · Computer Science 2016-08-01 Cameron Chalk , Bin Fu , Eric Martinez , Robert Schweller , Tim Wylie

Pseudo-random number generators are widely used in many branches of science, mainly in applications related to Monte Carlo methods, although they are deterministic in design and, therefore, unsuitable for tackling fundamental problems in…

This paper shows experimental results on learning based randomized bin-picking combined with iterative visual recognition. We use the random forest to predict whether or not a robot will successfully pick an object for given depth images of…

Robotics · Computer Science 2018-05-23 Kensuke Harada , Weiwei Wan , Tokuo Tsuji , Kohei Kikuchi , Kazuyuki Nagata , Hiromu Onda

A random number generator is proposed based on a theorem about existence of chaos in fixed point iteration of x= cot2(x). Digital computer simulation of this function iteration exhibits random behavior. A method is proposed to extract…

Discrete Mathematics · Computer Science 2013-01-23 Nabarun Mondal , Partha P. Ghosh

Randomness is one of the most important resources in modern information science, since encryption founds upon the trust in random numbers. Since it is impossible to prove if an existing random bit string is truly random, it is relevant that…

Quantum Physics · Physics 2015-12-22 Lukas Oberreiter , Ilja Gerhardt

An approach to generate the pseudorandom-bit sequence from the asymptotic deterministic randomness system is proposed in this Letter. We study the characteristic of multi-value correspondence of the asymptotic deterministic randomness…

Chaotic Dynamics · Physics 2009-11-13 Kai Wang , Wenjiang Pei , Haishan Xia , Yiu-ming Cheung

We propose a new approach to nondeterministic random number generation. In theory, the randomness originated from the uncorrelated nature of consecutive laser pulses with Poissonian photon number distribution and that of the consecutive…

Quantum Physics · Physics 2015-05-13 Wei Wei , Hong Guo

We introduce a new sorting device for permutations which makes use of a pop stack augmented with a bypass operation. This results in a sorting machine, which is more powerful than the usual Popstacksort algorithm and seems to have never…

Discrete Mathematics · Computer Science 2025-03-12 Lapo Cioni , Luca Ferrari , Rebecca Smith

Physically disentangling entangled objects from each other is a problem encountered in waste segregation or in any task that requires disassembly of structures. Often there are no object models, and, especially with cluttered irregularly…

Robotics · Computer Science 2021-04-13 Joni Pajarinen , Oleg Arenz , Jan Peters , Gerhard Neumann

We consider the problem of planning a collision-free path of a robot in the presence of risk zones. The robot is allowed to travel in these zones but is penalized in a super-linear fashion for consecutive accumulative time spent there. We…

Computational Geometry · Computer Science 2017-03-10 Oren Salzman , Siddhartha Srinivasa

In recent years, a growing need has arisen in different fields for the development of computational systems for automated analysis of large amounts of data (high-throughput). Dealing with nonstandard noise structure and outliers, that could…

Applications · Statistics 2010-11-10 Anat Sakov , Ilan Golani , Dina Lipkind , Yoav Benjamini

We introduce and study the model of simply generated non-crossing partitions, which are, roughly speaking, chosen at random according to a sequence of weights. This framework encompasses the particular case of uniform non-crossing…

Probability · Mathematics 2017-06-30 Igor Kortchemski , Cyril Marzouk