Sciweavers

793 search results - page 12 / 159
» Analogical Path Planning
Sort
View
JAIR
2008
107views more  JAIR 2008»
13 years 8 months ago
Exploiting Subgraph Structure in Multi-Robot Path Planning
Multi-robot path planning is difficult due to the combinatorial explosion of the search space with every new robot added. Complete search of the combined state-space soon intracta...
Malcolm Ross Kinsella Ryan
RSS
2007
151views Robotics» more  RSS 2007»
13 years 9 months ago
Predicting Partial Paths from Planning Problem Parameters
— Many robot motion planning problems can be described as a combination of motion through relatively sparsely filled regions of configuration space and motion through tighter p...
Sarah Finney, Leslie Pack Kaelbling, Tomás ...
IJIT
2004
13 years 9 months ago
Memetic Algorithm Based Path Planning for a Mobile Robot
In this paper, the problem of finding the optimal collision free path for a mobile robot, the path planning problem, is solved using an advanced evolutionary algorithm called memet...
Neda Shahidi, Hadi Esmaeilzadeh, Marziye Abdollahi...
ICC
2007
IEEE
162views Communications» more  ICC 2007»
13 years 11 months ago
LSP and Back Up Path Setup in MPLS Networks Based on Path Criticality Index
This paper reports on a promising approach for solving problems found when Multi Protocol Label Switching (MPLS), soon to be a dominant protocol, is used in core network systems. D...
Ali Tizghadam, Alberto Leon-Garcia
IROS
2006
IEEE
143views Robotics» more  IROS 2006»
14 years 2 months ago
3D Field D: Improved Path Planning and Replanning in Three Dimensions
— We present an interpolation-based planning and replanning algorithm that is able to produce direct, lowcost paths through three-dimensional environments. Our algorithm builds u...
Joseph Carsten, Dave Ferguson, Anthony Stentz