A geodesic approach to calculating the information sets in dynamic search problems

DOI10.3103/S0278641909040037zbMath1182.65101MaRDI QIDQ845538

P. A. Voronin

Publication date: 29 January 2010

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

zbMATH Keywords

Hamilton-Jacobi equationgeodesic distancesdynamic searchdistance fields

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Existence theories for optimal control problems involving ordinary differential equations (49J15) Discrete approximations in optimal control (49M25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient solution to the eikonal equation on parametric manifolds
• Weighted distance maps computation on parametric three-dimensional manifolds
• O(\(N\)) implementation of the fast marching algorithm
• Computing geodesic paths on manifolds
• Fast Marching Methods
• Dynamic search in three-dimensional convex domains

This page was built for publication: A geodesic approach to calculating the information sets in dynamic search problems