.png){kind=icon}
.png){kind=icon}
Return
DE-Path: A Differential-Evolution-Based Method for Computing Energy-Minimizing Paths on Surfaces
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cad.2019.05.025.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Computing energy-minimizing paths that are general for different energy forms is a common task in science and engineering. Conventional methods adopt numerical solvers, such as conjugate gradient or quasi-Newton. While these are efficient, the results are highly sensitive with respect to the initial paths. In this paper we develop a method based on differential evolution (DE) for computing optimal solutions. We propose a simple strategy to encode paths and define path operations, such as addition and scalar multiplication, so that the discrete paths can fit into the DE framework. We demonstrate the effectiveness of our method on three applications: (1) computing discrete geodesic paths on surfaces with non-uniform density function; (2) finding a smooth path that follows a given vector field as much as possible; and (3) finding a curve on a terrain with (near-) constant slope. (C) 2019 Elsevier Ltd. All rights reserved.
Keywords:
Energy-minimizing paths
Differential evolution
Global solver
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
3.1
Papers:
3.1K
Citations:
6.4K