Abstract
Given two compact, simply connected manifolds with boundary, and a navigation function (NF) on each manifold, this paper presents a simple composition law that yields a new NF on the cross product space. The method provides tunable “hooks” for shaping the new potential function while still guaranteeing obstacle avoidance and essentially global convergence. The composition law is associative, and successive compositions fold into a single, computational simple expression, enabling the practical construction of NFs on the Cartesian product of several manifolds.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
About this chapter
Cite this chapter
Cowan, N.J. Composing Navigation Functions on Cartesian Products of Manifolds with Boundary. In: Erdmann, M., Overmars, M., Hsu, D., van der Stappen, F. (eds) Algorithmic Foundations of Robotics VI. Springer Tracts in Advanced Robotics, vol 17. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10991541_8
Download citation
DOI: https://doi.org/10.1007/10991541_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25728-8
Online ISBN: 978-3-540-31506-3
eBook Packages: EngineeringEngineering (R0)