Effective Algorithms for a Class of Discrete Valued Optimal Control Problems

DOI10.1007/978-3-540-88063-9_1zbMath1195.49041OpenAlexW124689663MaRDI QIDQ3589728

Volker Rehbock, Ian van Loosen, Louis Caccetta

Publication date: 20 September 2010

Published in: Optimization and Cooperative Control Strategies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88063-9_1

zbMATH Keywords

optimal control problemsdiscrete control valuesexact switching timestransit path problem

Mathematics Subject Classification ID

Applications of optimal control and differential games (49N90)

Related Items

Optimal switching control of a fed-batch fermentation process, Mobile object evasion from detection by a group of observers

Uses Software

• MISER3

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Cooperative control and optimization
• Control parametrization enhancing technique for optimal discrete-valued control problems
• Optimal strategies for the control of a train
• The shortest route problem with constraints
• Aircraft routing under the risk of detection
• Shortest chain subject to side constraints
• A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
• An algorithm for the resource constrained shortest path problem
• A dual algorithm for the constrained shortest path problem
• MISER3:Solving optimal control problems—an update
• Approximation Schemes for the Restricted Shortest Path Problem
• A Survey of Lagrangean Techniques for Discrete Optimization
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
• Finding the K Shortest Loopless Paths in a Network
• A simple efficient approximation scheme for the restricted shortest path problem