Implementation of efficient algorithms for globally optimal trajectories

DOI10.1109/9.661081zbMath1032.49037OpenAlexW2132202988MaRDI QIDQ4396101

Dimitri P. Bertsekas, L. C. Polymenakos, John N. Tsitsiklis

Publication date: 23 August 1998

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/9.661081

zbMATH Keywords

optimal controllabel settinglabel correctingcontinuous-space shortest path problem

Mathematics Subject Classification ID

Nonlinear programming (90C30) Discrete approximations in optimal control (49M25)

Related Items (4)

MG-FIM: A Multi-GPU Fast Iterative Method Using Adaptive Domain Decomposition ⋮ An ordered upwind method with precomputed stencil and monotone node acceptance for solving static convex Hamilton-Jacobi equations ⋮ A set oriented approach to global optimal control ⋮ Robust shortest path planning and semicontractive dynamic programming

This page was built for publication: Implementation of efficient algorithms for globally optimal trajectories