DocumentCode
1581492
Title
Sculpting potential fields in the BVP Path Planner
Author
Prestes, Edson ; Idiart, Marco
Author_Institution
Inst. de Inf., Univ. Fed. do Rio Grande do Sul, Porto Alegre, Brazil
fYear
2009
Firstpage
183
Lastpage
188
Abstract
BVP Path Planners generate potential fields whose gradient descent represents navigational routes from any point of the environment to a goal position. The resulting trajectories are smooth and free of local minima. In this paper, we refine our BVP PP approach by introducing a novel form for the core equation that permits to easily cope with terrain inhomogeneities. This is accomplished by changing locally the concavity/convexity of the potential, and then creating regions with higher or lower traveling preferences. We present analytical results and simulated experiments to demonstrate our proposal.
Keywords
boundary-value problems; concave programming; convex programming; gradient methods; path planning; BVP path planner; boundary value problems; gradient descent; navigational routes; potential field concavity; potential field convexity; potential fields; traveling preferences; Analytical models; Biomimetics; Boundary conditions; Boundary value problems; Laplace equations; Navigation; Orbital robotics; Partial differential equations; Proposals; Robots;
fLanguage
English
Publisher
ieee
Conference_Titel
Robotics and Biomimetics (ROBIO), 2009 IEEE International Conference on
Conference_Location
Guilin
Print_ISBN
978-1-4244-4774-9
Electronic_ISBN
978-1-4244-4775-6
Type
conf
DOI
10.1109/ROBIO.2009.5420620
Filename
5420620
Link To Document