Implementation of efficient algorithms for globally optimal trajectories

DOI10.1109/9.661081MaRDI QIDQ4396101zbMATH OpenOpenAlexFDO

Authors L. C. Polymenakos, Dimitri P. Bertsekas, 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

continuous-space shortest path problemlabel correctinglabel settingoptimal control

Mathematics Subject Classification ID

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

Recommendations

• Efficient algorithms for globally optimal trajectories
• A finite-time algorithm for shortest path problems with time-varying costs
• On numerical methods of solving some optimal path problems on the plane
• Shortest path methods: A unifying approach

Cited in

(8)

• An ordered upwind method with precomputed stencil and monotone node acceptance for solving static convex Hamilton-Jacobi equations
• Search-trajectory optimization. II: Algorithms and computations
• Robust shortest path planning and semicontractive dynamic programming
• Efficient algorithms for globally optimal trajectories
• MG-FIM: a multi-GPU fast iterative method using adaptive domain decomposition
• A set oriented approach to global optimal control
• Error bounds for discrete-continuous free flight trajectory optimization
• A discrete-continuous algorithm for globally optimal free flight trajectory optimization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4396101)