Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
163
Communication in reactive multiagent robotic systems
- Autonomous Robots
, 1994
"... Abstract. Multiple cooperating robots are able to complete many tasks more quickly and reliably than one robot alone. Communication between the robots can multiply their capabilities and e ectiveness, but to what extent? In this research, the importance of communication in robotic societies is inves ..."
Abstract
-
Cited by 270 (19 self)
- Add to MetaCart
is investigated through experiments on both simulated and real robots. Performance was measured for three di erent types of communication for three di erent tasks. The levels of communication are progressively more complex and potentially more expensive to implement. For some tasks, communication can signi cantly
RANDOM SCATTERING OF BITS BY PREDICTION
, 909
"... Abstract. We investigate a population of binary mistake sequences that result from learning with parametric models of di erent order. We obtain estimates of their error, algorithmic complexity and divergence from a purely random Bernoulli sequence. We study the relationship of these variables to the ..."
Abstract
- Add to MetaCart
Abstract. We investigate a population of binary mistake sequences that result from learning with parametric models of di erent order. We obtain estimates of their error, algorithmic complexity and divergence from a purely random Bernoulli sequence. We study the relationship of these variables
Throughput capacity of random ad hoc networks with infrastructure support
- in MOBICOM
, 2003
"... In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a network architecture allows ad hoc nodes to communicate with each other by purely using the remaining ad hoc nodes as thei ..."
Abstract
-
Cited by 100 (0 self)
- Add to MetaCart
points, constitute a connected topology graph. This is a significant improvement over the capacity of random ad hoc networks with no infrastructure support which is found as Θ(W / p N log(N)) in [1]. Although better capacity figures may be obtained by complex network coding or exploiting mobility
Robotic mapping with polygonal random fields
- In 21st Conf. on Uncertainty in Artificial Intelligence
, 2005
"... Two types of probabilistic maps are popular in the mobile robotics literature: occupancy grids and geometric maps. Occupancy grids have the advantages of simplicity and speed, but they represent only a restricted class of maps and they make incorrect independence assumptions. On the other hand, curr ..."
Abstract
-
Cited by 8 (0 self)
- Add to MetaCart
Two types of probabilistic maps are popular in the mobile robotics literature: occupancy grids and geometric maps. Occupancy grids have the advantages of simplicity and speed, but they represent only a restricted class of maps and they make incorrect independence assumptions. On the other hand
Research Article Motion Control of Robots Using a Chaotic Truly Random Bits Generator
, 2012
"... This work introduces chaotic motion control of mobile or humanoid robots, in order to cover a terrain. The proposed method, in order to achieve complete coverage of the entire terrain, is based on a truly random bits generator. This generator is created by a nonlinear circuit, which produces double- ..."
Abstract
- Add to MetaCart
This work introduces chaotic motion control of mobile or humanoid robots, in order to cover a terrain. The proposed method, in order to achieve complete coverage of the entire terrain, is based on a truly random bits generator. This generator is created by a nonlinear circuit, which produces double
Model-free learning and control in a mobile robot
- In Proceedings of the Fifth International Conference on Natural Computation
"... A model-free, biologically-motivated learning and control algorithm called S-learning is described as implemented in an Surveyor SRV-1 mobile robot. S-learning demonstrated learning of robotic and environmental structure sufficient to allow it to achieve its goals (finding high- or low-contrast view ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
A model-free, biologically-motivated learning and control algorithm called S-learning is described as implemented in an Surveyor SRV-1 mobile robot. S-learning demonstrated learning of robotic and environmental structure sufficient to allow it to achieve its goals (finding high- or low
Robotics General Terms Algorithms, Theory
"... Coverage is a fundamental problem in robotics, where a robot is required to visit every part of a given area as effi-ciently as possible ([1], [3], [4], [5], [6], [8]). Coverage has many applications in various domains, from automatic floor ..."
Abstract
- Add to MetaCart
Coverage is a fundamental problem in robotics, where a robot is required to visit every part of a given area as effi-ciently as possible ([1], [3], [4], [5], [6], [8]). Coverage has many applications in various domains, from automatic floor
The Limits of Mathematics
, 1994
"... theoretic incompleteness theorems. The first of these theorems states that an N-bit formal axiomatic system cannot enable one to exhibit any specific object with program-size complexity greater than N + c. The second of these theorems states that an N-bit formal axiomatic system cannot enable one to ..."
Abstract
-
Cited by 69 (9 self)
- Add to MetaCart
to determine more than N +c ′ scattered bits of the halting probability Ω. Most people believe that anything that is true is true for a reason. These theorems show that some things are true for no reason at all, i.e., accidentally, or at random. The latest and I believe the deepest proofs of these two theorems
An Optimization Approach to Planning for Mobile Manipulation
- Proc. of IEEE Int. Conf. Robotics and Automation(ICRA
, 2008
"... Abstract — We present an optimization-based approach to grasping and path planning for mobile manipulators. We focus on pick-and-place operations, where a given object must be moved from its start configuration to its goal configuration by the robot. Given only the start and goal configurations of t ..."
Abstract
-
Cited by 20 (2 self)
- Add to MetaCart
for the object in its start and goal configurations using a co-evolutionary algorithm. In the planning phase, a path is found connecting the two robot configurations found by the optimization phase using Rapidly-Exploring Random Trees (RRTs). We benchmark our algorithm and demonstrate it on a 10 DOF mobile
Results 1 - 10
of
163
