Linear Optimization in time-critical Control Loop

This page cannot be shown here. You can still read it on the original site — the toolbar below keeps your place in the directory.

Problem Given a start and endpoint, find the eager and lazy path from start to end. Model The visualization translates to a simple rhombus (German: Raute) where the enclosed area is to be maximized. The task is to find the corner points A, B, C, D, of the Raute. There is a twist, however. The points must be contained within a “valid” area, whereas start and endpoint may lie outside.

Problem

Given a start and endpoint, find the eager and lazy path from start to end.

Model

The visualization translates to a simple rhombus (German: Raute) where the enclosed area is to be maximized.

The task is to find the corner points A, B, C, D, of the Raute.

There is a twist, however. The points must be contained within a “valid” area, whereas start and endpoint may lie outside.

Read on /linear-optimization-in-time-critical-control-loop/ ↗