|
|
|
Volumn 4, Issue , 1996, Pages 3014-3019
|
|
On the expected complexity of random path planning
|
|
Author keywords
[No Author keywords available]
|
|
Indexed keywords
ALGORITHMS;
COLLISION AVOIDANCE;
COMPUTATIONAL COMPLEXITY;
CONVERGENCE OF NUMERICAL METHODS;
MARKOV PROCESSES;
MATRIX ALGEBRA;
OPTIMIZATION;
PROBABILITY;
ROBOTS;
BROWNIAN MOTION PROPERTY;
CONVERGENCE TIME;
LOCAL MINIMA;
POTENTIAL FIELDS;
PROBABILISTIC CONVERGENCE;
RANDOM MOTIONS;
RANDOM PATH PLANNING;
TRANSITION MATRIX;
MOTION PLANNING;
|
|
EID: 0029696814
PISSN: 10504729
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
|
Times cited : (23)
|
|
References (7)
|
