Obtaining the optimal shortest path between two points on a quasi-developable Bézier-type surface using the Geodesic-based Q-learning algorithm.
Vahide BulutAytug OnanBetul SenyaylaPublished in: Eng. Appl. Artif. Intell. (2024)
Keyphrases
- shortest path
- geodesic distance
- learning algorithm
- optimal path
- shortest path algorithm
- shortest path problem
- minimal surface
- routing algorithm
- road network
- steiner tree
- shortest distance
- optimal solution
- flow graph
- discrete geometry
- travel time
- weighted graph
- point sets
- edge weights
- path length
- surface shape
- minimum length
- minimum spanning tree
- endpoints
- surface reconstruction
- range images