Skip to main content

Composing Navigation Functions on Cartesian Products of Manifolds with Boundary

  • Chapter
  • First Online:
Algorithmic Foundations of Robotics VI

Part of the book series: Springer Tracts in Advanced Robotics ((STAR,volume 17))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Editor information

Michael Erdmann Mark Overmars David Hsu Frank van der Stappen

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics