Sciweavers

111 search results - page 18 / 23
» Anytime Path Planning and Replanning in Dynamic Environments
Sort
View
AAAI
2008
13 years 9 months ago
An Efficient Motion Planning Algorithm for Stochastic Dynamic Systems with Constraints on Probability of Failure
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
Masahiro Ono, Brian C. Williams
AI
1999
Springer
13 years 6 months ago
Experiences with an Interactive Museum Tour-Guide Robot
This article describes the software architecture of an autonomous, interactive tour-guide robot. It presents a modular, distributed software architecture, which integrates localiz...
Wolfram Burgard, Armin B. Cremers, Dieter Fox, Dir...
JIRS
2010
104views more  JIRS 2010»
13 years 5 months ago
On the Generation of Trajectories for Multiple UAVs in Environments with Obstacles
Abstract This paper presents a methodology based on a variation of the Rapidlyexploring Random Trees (RRTs) that generates feasible trajectories for a team of autonomous aerial veh...
Armando Alves Neto, Douglas Guimarães Macha...
ICRA
2009
IEEE
115views Robotics» more  ICRA 2009»
14 years 1 months ago
Multi-robot coordination using generalized social potential fields
Abstract— We present a novel approach to compute collisionfree paths for multiple robots subject to local coordination constraints. More specifically, given a set of robots, the...
Russell Gayle, William Moss, Ming C. Lin, Dinesh M...
TSMC
1998
82views more  TSMC 1998»
13 years 6 months ago
To push or not to push: on the rearrangement of movable objects by a mobile robot
—We formulate and address the problem of planning a pushing manipulation by a mobile robot which tries to rearrange several movable objects in its work space. We present an algor...
Ohad Ben-Shahar, Ehud Rivlin