Wavefront expansion algorithm
 | This article, Wavefront expansion algorithm, has recently been created via the Articles for creation process. Please check to see if the reviewer has accidentally left this template after accepting the draft and take appropriate action as necessary.
Reviewer tools: Inform author |
overview
- original article request was “Wavefront expansion motion planner”
key points
- sampling based motion planner
- pathplanner for determine the shorted path between start and goal
- commonly used in robotics [1]
- similar to potential field [2]
- numerical potential field
- Wavefront algorithm = BFS (Breadth First Search) [3]
References
- ^ Chytra Pawashe and Metin Sitti (2006). "Two-dimensional vision-based autonomous microparticle manipulation using a nanoprobe". Journal of Micromechatronics. 3 (3). Brill: 285--306. doi:10.1163/156856306777924671.
- ^ Miraglia, Giovanni and Hook, IV (2019). "A Feedback Motion Plan for Vehicles with Bounded Curvature Constraints". arXiv:arXiv:1910.06460 preprint arXiv:1910.06460.
{{cite arXiv}}: Check|arxiv=value (help)CS1 maint: multiple names: authors list (link) - ^ Simonin, Olivier and Charpillet, Francois and Thierry, Eric (2007). "Collective construction of numerical potential fields for the foraging problem". Research Report RR-6171, inria-00143302v1.
{{cite journal}}: CS1 maint: multiple names: authors list (link)