An integrated rolling horizon and adaptive-refinement approach for disjoint trajectories optimization

DOI10.1007/s11081-022-09719-2zbMath1530.90059OpenAlexW4224031094MaRDI QIDQ6173784

Unnamed Author, Frauke Liers

Publication date: 13 July 2023

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11081-022-09719-2

zbMATH Keywords

optimizationinteger programmingadaptive refinementrolling horizondisjoint trajectories

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Survey of robot 3D path planning algorithms
• Simplifying maximum flow computations: the effect of shrinking and good initial flows
• On shortest disjoint paths in planar graphs
• Direct and indirect methods for trajectory optimization
• The directed subgraph homeomorphism problem
• A soft dynamic programming approach for on-line aircraft 4D-trajectory optimization
• Variable neighborhood search
• Handbook of optimization in the railway industry
• Subdimensional expansion for multirobot path planning
• Conflict-based search for optimal multi-agent pathfinding
• On mathematical programming with indicator constraints
• Dynamic graph generation for the shortest path problem in time expanded networks
• Solving network design problems via iterative aggregation
• A rolling-horizon approach for multi-period optimization
• A two-time-level model for mission and flight planning of an inhomogeneous fleet of unmanned aerial vehicles
• Scheduling Aircraft Landings—The Static Case
• Iterative Refinement for Linear Programming
• Using Piecewise Linear Functions for Solving MINLPs
• Conditions for the Existence of Planning Horizons
• On the Computational Complexity of Combinatorial Problems
• Alternative graph formulation for solving complex factory-scheduling problems
• Adaptive Bundle Methods for Nonlinear Robust Optimization
• Ship Traffic Optimization for the Kiel Canal
• Existence of Forecast Horizons in Undiscounted Discrete-Time Lot Size Models
• Solving Time Dependent Shortest Path Problems on Airway Networks Using Super-Optimal Wind

This page was built for publication: An integrated rolling horizon and adaptive-refinement approach for disjoint trajectories optimization