Sciweavers

86 search results - page 9 / 18
» Efficient path planning in changing environments
Sort
View
ICRA
2005
IEEE
115views Robotics» more  ICRA 2005»
14 years 1 months ago
An Interpolated Dynamic Navigation Function
— The E∗ algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation. It calculates a navigation function as a sampling of ...
Roland Philippsen, Roland Siegwart
ICRA
2006
IEEE
183views Robotics» more  ICRA 2006»
14 years 1 months ago
Anytime Dynamic Path-planning with Flexible Probabilistic Roadmaps
Abstract— Probabilistic roadmaps (PRM) have been demonstrated to be very promising for planning paths for robots with high degrees of freedom in complex 3D workspaces. In this pa...
Khaled Belghith, Froduald Kabanza, Leo Hartman, Ro...
TC
2008
13 years 7 months ago
An Efficient and Deadlock-Free Network Reconfiguration Protocol
Component failures and planned component replacements cause changes in the topology and routing paths supplied by the interconnection network of a parallel processor system over ti...
Olav Lysne, José Miguel Montañana, J...
IROS
2007
IEEE
144views Robotics» more  IROS 2007»
14 years 1 months ago
Global action selection for illumination invariant color modeling
— A major challenge in the path of widespread use of mobile robots is the ability to function autonomously, learning useful features from the environment and using them to adapt ...
Mohan Sridharan, Peter Stone
FLAIRS
2006
13 years 9 months ago
Efficient Bids on Task Allocation for Multi-Robot Exploration
We propose a real time single item auction based task allocation method for the multi-robot exploration problem and investigate new bid evaluation strategies in this domain. In th...
Sanem Sariel, Tucker R. Balch