Problem of Finding an Optimal Piecewise Linear Path Connecting Two Given Points with the Possibility of Making n Turns
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916015353364480 |
|---|---|
| author | N, Nefedov V. |
| author_facet | N, Nefedov V. |
| contents | We consider the problem of finding an optimal piecewise linear path (polygonal line) connecting two given points with the possibility of making n turns at some points (the absolute value of each turn angle does not exceed a prescribed bound). Under some condition, we characterize the region to which all interior vertices of such a path must belong (Theorem 1). It is shown that for any point from this region, there exists a polygonal line satisfying the given constraints (Lemma 1). Based on these findings, an explicit expression is derived (Theorem 2) that describes the collection of all admissible sequences of corner points. This expression is then used to construct a finite family of sequences that approximates the aforementioned collection. The resulting finite approximating family serves as the basis for developing algorithms that provide approximate solutions to an optimization problem, where the objective function accounts for both the cost of traversing the segments and the cost associated with the turns. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_15449 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Problem of Finding an Optimal Piecewise Linear Path Connecting Two Given Points with the Possibility of Making n Turns N, Nefedov V. Optimization and Control We consider the problem of finding an optimal piecewise linear path (polygonal line) connecting two given points with the possibility of making n turns at some points (the absolute value of each turn angle does not exceed a prescribed bound). Under some condition, we characterize the region to which all interior vertices of such a path must belong (Theorem 1). It is shown that for any point from this region, there exists a polygonal line satisfying the given constraints (Lemma 1). Based on these findings, an explicit expression is derived (Theorem 2) that describes the collection of all admissible sequences of corner points. This expression is then used to construct a finite family of sequences that approximates the aforementioned collection. The resulting finite approximating family serves as the basis for developing algorithms that provide approximate solutions to an optimization problem, where the objective function accounts for both the cost of traversing the segments and the cost associated with the turns. |
| title | Problem of Finding an Optimal Piecewise Linear Path Connecting Two Given Points with the Possibility of Making n Turns |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2605.15449 |