Convex trigonometry with applications to sub-Finsler geometry

TL;DR

This paper introduces a generalized convex trigonometry method for describing flat convex sets, enabling explicit solutions to sub-Finsler optimal control problems on various geometric groups, especially with polygonal control sets.

Contribution

It develops a new convex trigonometry framework that extends classical functions, facilitating the analysis of sub-Finsler problems on multiple geometric structures.

Findings

Explicit solutions for sub-Finsler problems on Heisenberg, Engel, and Cartan groups.

Effective handling of polygonal control sets in sub-Finsler geometry.

Generalization of classical trigonometry for convex set descriptions.

Abstract

A new convenient method of describing flat convex compact sets is proposed. It generalizes classical trigonometric functions $\sin$ and $\cos$. Apparently, this method may be very useful for explicit description of solutions of optimal control problems with two-dimensional control. Using this method a series of sub-Finsler problems with two-dimensional control lying in an arbitrary convex set $\Omega$ is investigated. Namely, problems on the Heisenberg, Engel, and Cartan groups and also Grushin's and Martinet's cases are considered. A particular attention is paid to the case when $\Omega$ is a polygon.