Sciweavers

Share
15 search results - page 1 / 3
» Path and trajectory diversity: Theory and algorithms
Sort
View
ICRA
2008
IEEE
135views Robotics» more  ICRA 2008»
8 years 9 months ago
Path and trajectory diversity: Theory and algorithms
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
Michael S. Branicky, Ross A. Knepper, James J. Kuf...
ICRA
2009
IEEE
119views Robotics» more  ICRA 2009»
8 years 10 months ago
Survivability: Measuring and ensuring path diversity
— A novel criterion is introduced for assessing the diversity of a collection of paths or trajectories. The main idea is the notion of survivability, which measures the likelihoo...
Lawrence H. Erickson, Steven M. LaValle
RAS
2008
86views more  RAS 2008»
8 years 2 months ago
Theory and implementation of path planning by negotiation for decentralized agents
This paper presents a cooperative decentralized path-planning algorithm for a group of autonomous agents that provides guaranteed collisionfree trajectories in real-time. The algo...
Oliver Purwin, Raffaello D'Andrea, Jin-Woo Lee
WEA
2004
Springer
128views Algorithms» more  WEA 2004»
8 years 8 months ago
GRASP with Path-Relinking for the Quadratic Assignment Problem
This paper describes a GRASP with path-relinking heuristic for the quadratic assignment problem. GRASP is a multi-start procedure, where different points in the search space are p...
Carlos A. S. Oliveira, Panos M. Pardalos, Mauricio...
SOFSEM
2004
Springer
8 years 8 months ago
Measures of Intrinsic Hardness for Constraint Satisfaction Problem Instances
Our aim is to investigate the factors which determine the intrinsic hardness of constructing a solution to any particular constraint satisfaction problem instance, regardless of th...
George Boukeas, Constantinos Halatsis, Vassilis Zi...
books