Sciweavers

603 search results - page 112 / 121
» Motion Planning for Multiple Robots
Sort
View
CP
2008
Springer
13 years 9 months ago
Guiding Search in QCSP+ with Back-Propagation
The Quantified Constraint Satisfaction Problem (QCSP) has been introduced to express situations in which we are not able to control the value of some of the variables (the universa...
Guillaume Verger, Christian Bessiere
ICRA
2010
IEEE
120views Robotics» more  ICRA 2010»
13 years 6 months ago
Probabilistic search with agile UAVs
— Through their ability to rapidly acquire aerial imagery, Unmanned Aerial Vehicles (UAVs) have the potential to aid target search tasks. Many of the core algorithms which are us...
Sonia Waharte, Andrew Colquhoun Symington, Niki Tr...
RAS
2000
70views more  RAS 2000»
13 years 7 months ago
Feature extraction and tracking for scanning range sensors
A solution to the problem of simultaneously extracting and tracking a piecewise-linear range representation of a mobile robot's local environment is presented. The classical ...
Nick E. Pears
DAGM
2009
Springer
13 years 11 months ago
An Efficient Linear Method for the Estimation of Ego-Motion from Optical Flow
Abstract. Approaches to visual navigation, e.g. used in robotics, require computationally efficient, numerically stable, and robust methods for the estimation of ego-motion. One of...
Florian Raudies, Heiko Neumann
ICRA
2005
IEEE
120views Robotics» more  ICRA 2005»
14 years 1 months ago
Hybrid PRM Sampling with a Cost-Sensitive Adaptive Strategy
— A number of advanced sampling strategies have been proposed in recent years to address the narrow passage problem for probabilistic roadmap (PRM) planning. These sampling strat...
David Hsu, Gildardo Sánchez-Ante, Zheng Sun