16,367 research outputs found
Pyroomacoustics: A Python package for audio room simulations and array processing algorithms
We present pyroomacoustics, a software package aimed at the rapid development
and testing of audio array processing algorithms. The content of the package
can be divided into three main components: an intuitive Python object-oriented
interface to quickly construct different simulation scenarios involving
multiple sound sources and microphones in 2D and 3D rooms; a fast C
implementation of the image source model for general polyhedral rooms to
efficiently generate room impulse responses and simulate the propagation
between sources and receivers; and finally, reference implementations of
popular algorithms for beamforming, direction finding, and adaptive filtering.
Together, they form a package with the potential to speed up the time to market
of new algorithms by significantly reducing the implementation overhead in the
performance evaluation step.Comment: 5 pages, 5 figures, describes a software packag
Stable Prehensile Pushing: In-Hand Manipulation with Alternating Sticking Contacts
This paper presents an approach to in-hand manipulation planning that
exploits the mechanics of alternating sticking contact. Particularly, we
consider the problem of manipulating a grasped object using external pushes for
which the pusher sticks to the object. Given the physical properties of the
object, frictional coefficients at contacts and a desired regrasp on the
object, we propose a sampling-based planning framework that builds a pushing
strategy concatenating different feasible stable pushes to achieve the desired
regrasp. An efficient dynamics formulation allows us to plan in-hand
manipulations 100-1000 times faster than our previous work which builds upon a
complementarity formulation. Experimental observations for the generated plans
show that the object precisely moves in the grasp as expected by the planner.
Video Summary -- youtu.be/qOTKRJMx6HoComment: IEEE International Conference on Robotics and Automation 201
Hide-and-Seek with Directional Sensing
We consider a game played between a hider, who hides a static object in one
of several possible positions in a bounded planar region, and a searcher, who
wishes to reach the object by querying sensors placed in the plane. The
searcher is a mobile agent, and whenever it physically visits a sensor, the
sensor returns a random direction, corresponding to a half-plane in which the
hidden object is located. We first present a novel search heuristic and
characterize bounds on the expected distance covered before reaching the
object. Next, we model this game as a large-dimensional zero-sum dynamic game
and we apply a recently introduced randomized sampling technique that provides
a probabilistic level of security to the hider. We observe that, when the
randomized sampling approach is only allowed to select a very small number of
samples, the cost of the heuristic is comparable to the security level provided
by the randomized procedure. However, as we allow the number of samples to
increase, the randomized procedure provides a higher probabilistic security
level.Comment: A short version of this paper (without proofs) will be presented at
the 18th IFAC World Congress (IFAC 2011), Milan (Italy), August 28-September
2, 201
Interactive Data Exploration with Smart Drill-Down
We present {\em smart drill-down}, an operator for interactively exploring a
relational table to discover and summarize "interesting" groups of tuples. Each
group of tuples is described by a {\em rule}. For instance, the rule tells us that there are a thousand tuples with value in the
first column and in the second column (and any value in the third column).
Smart drill-down presents an analyst with a list of rules that together
describe interesting aspects of the table. The analyst can tailor the
definition of interesting, and can interactively apply smart drill-down on an
existing rule to explore that part of the table. We demonstrate that the
underlying optimization problems are {\sc NP-Hard}, and describe an algorithm
for finding the approximately optimal list of rules to display when the user
uses a smart drill-down, and a dynamic sampling scheme for efficiently
interacting with large tables. Finally, we perform experiments on real datasets
on our experimental prototype to demonstrate the usefulness of smart drill-down
and study the performance of our algorithms
- …