Maximum Escape Angle/Precise Positional/Non-Iterative

This article is a stub. You can help RoboWiki by expanding it.

Illustration of non-iterative PPMEA.

Non-iterative PPMEA is a mathematical definition of PPMEA along with an algorithm to calculate it.

Definition

Consider the Escape Envelope ignoring heading & velocity changing rules. Without walls, this area is essentially the area of Escape Circle, in which PPMEA equals to traditional MEA. And with walls, it is the intersection of the area of the escape circle and the battle field (points reachable by a robot considering only walls).

Then PPMEA can be defined as the angles between the line-of-sight and each of the pair of rays with maximum angle between them, where the rays are from firer to points in the Escape Envelope described above.

Algorithm

The rays with the property described above can either by tangent rays to the circumference part of the outline of the escape envelope described above, or rays to the vertexes of the area.

With this in mind, to find PPMEA, take a collection of rays from firer to the intersections of the escape circle and the walls, along with the tangent rays to the escape circle whenever the intersection is within the battle field. The PPMEAs can be calculated by taking the maximums of the angles formed by one of the rays and line of sight, in either direction.

See also

• Escape Circle