.png){kind=icon}
Return
Motion planning using adaptive random walks
.png){kind=icon}
PRE
AI
DOI：10.1109/TRO.2004.833790.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a novel single-shot motion-planning algorithm based on adaptive random walks. The proposed algorithm turns out to be simple to implement, and the solution it produces can be easily and efficiently optimized. Furthermore, the algorithm can incorporate adaptive components, so the developer is not-required to specify all the parameters of the random distributions involved, and the algorithm itself can adapt to the environment it is moving in. Proofs of the theoretical soundness of the algorithm are provided, as well as implementation details. Numerical comparisons with well-known algorithms illustrate its effectiveness.
Keywords:
adaptive sampling
holonomic path planning
stochastic processes
Journal
IF:
10.5
Papers:
3.3K
Citations:
2.8W
Organization
No organization information available
Cited Papers
ShareSave
ShareSaveShareSaveShareSaveApplication of ATR-FTIR spectroscopy in quantitative analysis of deuterium in basic solutions.png)
Analusis
OAAI
AnalusisIF0
OAAIShareSavePHOTOCHEMISTRY OF QUINOLYLMETHYLISOTHIORONIUM SALTS. GUANINE SELECTIVE DNA PHOTOCLEAVAGE REAGENTS
PREAI
ShareSaveImmunization of High-Risk Infants Younger Than 18 Months of Age with Split-Product Influenza VaccinePediatrics
PediatricsIF0
PREAI
ShareSave
View more