A reachable set analysis method for generating near-optimal trajectories of constrained multiphase systems

DOI10.1007/S10957-014-0651-2zbMath1326.49049OpenAlexW2012323204MaRDI QIDQ887102

Bruce A. Conway, Christian M. Chilan

Publication date: 28 October 2015

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-014-0651-2

zbMATH Keywords

nonlinear programmingevolutionary algorithmstrajectory optimizationreachable setsobstacle avoidance

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) Numerical methods based on nonlinear programming (49M37)

Related Items (2)

Robust time-optimal guidance in a partially uncertain time-varying flow-field ⋮ Optimization-based subdivision algorithm for reachable sets

Uses Software

• SNOPT
• OTIS

Cites Work

• Unnamed Item
• Chattering arcs and chattering controls
• Parallel asynchronous particle swarm optimization
• Direct trajectory optimization using nonlinear programming and collocation
• Discrete approximations to optimal trajectories using direct transcription and nonlinear programming
• Direct optimization using collocation based on high-order Gauss-Lobatto quadrature rules
• Particle swarm optimization in electromagnetics
• Parallel global optimization with the particle swarm algorithm

This page was built for publication: A reachable set analysis method for generating near-optimal trajectories of constrained multiphase systems