3,903 research outputs found
Embodied Artificial Intelligence through Distributed Adaptive Control: An Integrated Framework
In this paper, we argue that the future of Artificial Intelligence research
resides in two keywords: integration and embodiment. We support this claim by
analyzing the recent advances of the field. Regarding integration, we note that
the most impactful recent contributions have been made possible through the
integration of recent Machine Learning methods (based in particular on Deep
Learning and Recurrent Neural Networks) with more traditional ones (e.g.
Monte-Carlo tree search, goal babbling exploration or addressable memory
systems). Regarding embodiment, we note that the traditional benchmark tasks
(e.g. visual classification or board games) are becoming obsolete as
state-of-the-art learning algorithms approach or even surpass human performance
in most of them, having recently encouraged the development of first-person 3D
game platforms embedding realistic physics. Building upon this analysis, we
first propose an embodied cognitive architecture integrating heterogenous
sub-fields of Artificial Intelligence into a unified framework. We demonstrate
the utility of our approach by showing how major contributions of the field can
be expressed within the proposed framework. We then claim that benchmarking
environments need to reproduce ecologically-valid conditions for bootstrapping
the acquisition of increasingly complex cognitive skills through the concept of
a cognitive arms race between embodied agents.Comment: Updated version of the paper accepted to the ICDL-Epirob 2017
conference (Lisbon, Portugal
Ant-Inspired Density Estimation via Random Walks
Many ant species employ distributed population density estimation in
applications ranging from quorum sensing [Pra05], to task allocation [Gor99],
to appraisal of enemy colony strength [Ada90]. It has been shown that ants
estimate density by tracking encounter rates -- the higher the population
density, the more often the ants bump into each other [Pra05,GPT93].
We study distributed density estimation from a theoretical perspective. We
prove that a group of anonymous agents randomly walking on a grid are able to
estimate their density within a small multiplicative error in few steps by
measuring their rates of encounter with other agents. Despite dependencies
inherent in the fact that nearby agents may collide repeatedly (and, worse,
cannot recognize when this happens), our bound nearly matches what would be
required to estimate density by independently sampling grid locations.
From a biological perspective, our work helps shed light on how ants and
other social insects can obtain relatively accurate density estimates via
encounter rates. From a technical perspective, our analysis provides new tools
for understanding complex dependencies in the collision probabilities of
multiple random walks. We bound the strength of these dependencies using
of the underlying graph. Our results extend beyond
the grid to more general graphs and we discuss applications to size estimation
for social networks and density estimation for robot swarms
Multi-robot hunting in dynamic environments
This paper is concerned with multi-robot hunting in dynamic environments. A BCSLA approach is proposed to allow mobile robots to capture an intelligent evader. During the process of hunting, four states including dispersion-random-search, surrounding, catch and prediction are employed. In order to ensure each robot appropriate movement in each state, a series of strategies are developed in this paper. The dispersion-search strategy enables the robots to find the evader effectively. The leader-adjusting strategy aims to improve the hunting robots’ response to environmental changes and the outflank strategy is proposed for the hunting robots to force the evader to enter a besieging circle. The catch strategy is designed for shrinking the besieging circle to catch the evader. The predict strategy allows the robots to predict the evader’s position when they lose the tracking information about the evader. A novel collision-free motion strategy is also presented in this paper, which is called the direction-optimization strategy. To test the effect of cooperative hunting, the target to be captured owns a safety-motion strategy, which helps it to escape being captured. The computer simulations support the rationality of the approach.<br /
Coordinated task manipulation by nonholonomic mobile robots
Coordinated task manipulation by a group of autonomous mobile robots has received signicant research effort in the last decade. Previous studies in the area revealed that one of the main problems in the area is to avoid the collisions of the robots with obstacles as well as with other members of the group. Another problem is to come up with a model for successful task manipulation. Signicant research effort has accumulated on the denition of forces to generate reference trajectories for each autonomous mobile robots engaged in coordinated behavior. If the mobile robots are nonholonomic, this approach fails to guarantee successful manipulation of the task since the so-generated reference trajectories might not satisfy the nonholonomic constraint. In this work, we introduce a novel coordinated task manipulation model inclusive of an online collision avoidance algorithm. The reference trajectory for each autonomous nonholonomic mobile robot is generated online in terms of linear and angular velocity references for the robot; hence these references automatically satisfy the nonholonomic constraint. The generated reference velocities inevitably depend on the nature of the specied coordinated task. Several coordinated task examples, on the basis of a generic task, have been presented and the proposed model is veried through simulations
Swarm Robotics
Collectively working robot teams can solve a problem more efficiently than a single robot, while also providing robustness and flexibility to the group. Swarm robotics model is a key component of a cooperative algorithm that controls the behaviors and interactions of all individuals. The robots in the swarm should have some basic functions, such as sensing, communicating, and monitoring, and satisfy the following properties
Coordinated Robot Navigation via Hierarchical Clustering
We introduce the use of hierarchical clustering for relaxed, deterministic
coordination and control of multiple robots. Traditionally an unsupervised
learning method, hierarchical clustering offers a formalism for identifying and
representing spatially cohesive and segregated robot groups at different
resolutions by relating the continuous space of configurations to the
combinatorial space of trees. We formalize and exploit this relation,
developing computationally effective reactive algorithms for navigating through
the combinatorial space in concert with geometric realizations for a particular
choice of hierarchical clustering method. These constructions yield
computationally effective vector field planners for both hierarchically
invariant as well as transitional navigation in the configuration space. We
apply these methods to the centralized coordination and control of
perfectly sensed and actuated Euclidean spheres in a -dimensional ambient
space (for arbitrary and ). Given a desired configuration supporting a
desired hierarchy, we construct a hybrid controller which is quadratic in
and algebraic in and prove that its execution brings all but a measure zero
set of initial configurations to the desired goal with the guarantee of no
collisions along the way.Comment: 29 pages, 13 figures, 8 tables, extended version of a paper in
preparation for submission to a journa
- …