A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Convergent Network Approximation for the Continuous Euclidean Length Constrained Minimum Cost Path Problem

2009
*
SIAM Journal on Optimization
*

In many path planning situations we would like to find a path of constrained Euclidean length in R 2 that minimises a line integral. We call this the Continuous Length-Constrained Minimum Cost Path Problem (C-LCMCPP). Generally, this will be a non-convex optimization problem, for which continuous approaches only ensure locally optimal solutions. However, network discretisations yield weight constrained network shortest path problems (WCSPPs), which can in practice be solved to global

doi:10.1137/070695356
fatcat:vthmvdgbtjbipl5cyuy3fhmzzq