A numerical method for solving shortest path problems

DOI10.1007/S10092-018-0256-5zbMath1388.49035OpenAlexW2790290064WikidataQ130201191 ScholiaQ130201191MaRDI QIDQ1742985

Xianqiang Yang

Publication date: 12 April 2018

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10092-018-0256-5

zbMATH Keywords

nonlinear programmingshortest path problemChebyshev pseudo-spectral method

Mathematics Subject Classification ID

Spectral, collocation and related methods for boundary value problems involving PDEs (65N35) Numerical methods based on nonlinear programming (49M37) Existence theories for optimal control problems involving ordinary differential equations (49J15)

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• A novel algorithm for solving optimal path planning problems based on parametrization method and fuzzy aggregation
• Chebyshev pseudo-spectral method for Bratu's problem
• A method for numerical integration on an automatic computer
• Connections between the covector mapping theorem and convergence of pseudospectral methods for optimal control
• Robot motion planning with uncertainty in control and sensing
• Optimization. Algorithms and consistent approximations
• Smoothing approach for a class of nonsmooth optimal control problems
• An applicable method for solving the shortest path problems
• Generalized Euler-Lagrange equation for nonsmooth calculus of variations
• A class of orthogonal polynomials
• Solving some optimal path planning problems using an approach based on measure theory
• Spectral Methods
• Spectral Methods in MATLAB
• A Pseudospectral Method for the Optimal Control of Constrained Feedback Linearizable Systems
• A WAVELET COLLOCATION SCHEME FOR SOLVING SOME OPTIMAL PATH PLANNING PROBLEMS
• Error Estimation in the Clenshaw-Curtis Quadrature Formula

This page was built for publication: A numerical method for solving shortest path problems