Numerical Solutions to the Variational Problems by Dijkstra’s Path-Finding Algorithm

Numerical Solutions to the Variational Problems by Dijkstra’s Path-Finding Algorithm

In this work, we propose the general idea of using a path-finding algorithm to solve a variational problem. By interpreting a variational problem of finding the function that minimizes a functional integral as a shortest path finding, we can apply the shortest path-finding algorithm to numerically e...

Full description

Saved in:
Bibliographic Details
Main Authors: Thanaporn Arunthong, Laddawan Rianthakool, Khanchai Prasanai, Chakrit Na Takuathung, Sakchai Chomkokard, Wiwat Wongkokua, Noparit Jinuntuya
Format: Article
Language:English
Published: MDPI AG 2024-11-01
Series:Applied Sciences
Subjects:
path finding
Dijkstra’s algorithm
variational problems
optimization
Online Access:https://www.mdpi.com/2076-3417/14/22/10674
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://www.mdpi.com/2076-3417/14/22/10674

Similar Items